Abstract Let$$\mathbb {F}_q^d$$ be thed-dimensional vector space over the finite field withqelements. For a subset$$E\subseteq \mathbb {F}_q^d$$ and a fixed nonzero$$t\in \mathbb {F}_q$$ , let$$\mathcal {H}_t(E)=\{h_y: y\in E\}$$ , where$$h_y:E\rightarrow \{0,1\}$$ is the indicator function of the set$$\{x\in E: x\cdot y=t\}$$ . Two of the authors, with Maxwell Sun, showed in the case$$d=3$$ that if$$|E|\ge Cq^{\frac{11}{4}}$$ andqis sufficiently large, then the VC-dimension of$$\mathcal {H}_t(E)$$ is 3. In this paper, we generalize the result to arbitrary dimension by showing that the VC-dimension of$$\mathcal {H}_t(E)$$ isdwhenever$$E\subseteq \mathbb {F}_q^d$$ with$$|E|\ge C_d q^{d-\frac{1}{d-1}}$$ .
more »
« less
This content will become publicly available on May 12, 2026
Evaluation codes arising from symmetric polynomials
Abstract Datta and Johnsen (Des Codes Cryptogr 91:747–761, 2023) introduced a new family of evaluation codes in an affine space of dimension$$\ge 2$$ over a finite field$${\mathbb {F}}_q$$ where linear combinations of elementary symmetric polynomials are evaluated on the set of all points with pairwise distinct coordinates. In this paper, we propose a generalization by taking low dimensional linear systems of symmetric polynomials. Computation for small values of$$q=7,9$$ shows that carefully chosen generalized Datta–Johnsen codes$$\left[ \frac{1}{2}q(q-1),3,d\right] $$ have minimum distancedequal to the optimal value minus 1.
more »
« less
- Award ID(s):
- 2127742
- PAR ID:
- 10621549
- Publisher / Repository:
- Springer
- Date Published:
- Journal Name:
- Designs, Codes and Cryptography
- ISSN:
- 0925-1022
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract LetXbe ann-element point set in thek-dimensional unit cube$$[0,1]^k$$ where$$k \ge 2$$ . According to an old result of Bollobás and Meir (Oper Res Lett 11:19–21, 1992) , there exists a cycle (tour)$$x_1, x_2, \ldots , x_n$$ through thenpoints, such that$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} \le c_k$$ , where$$|x-y|$$ is the Euclidean distance betweenxandy, and$$c_k$$ is an absolute constant that depends only onk, where$$x_{n+1} \equiv x_1$$ . From the other direction, for every$$k \ge 2$$ and$$n \ge 2$$ , there existnpoints in$$[0,1]^k$$ , such that their shortest tour satisfies$$\left( \sum _{i=1}^n |x_i - x_{i+1}|^k \right) ^{1/k} = 2^{1/k} \cdot \sqrt{k}$$ . For the plane, the best constant is$$c_2=2$$ and this is the only exact value known. Bollobás and Meir showed that one can take$$c_k = 9 \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ for every$$k \ge 3$$ and conjectured that the best constant is$$c_k = 2^{1/k} \cdot \sqrt{k}$$ , for every$$k \ge 2$$ . Here we significantly improve the upper bound and show that one can take$$c_k = 3 \sqrt{5} \left( \frac{2}{3} \right) ^{1/k} \cdot \sqrt{k}$$ or$$c_k = 2.91 \sqrt{k} \ (1+o_k(1))$$ . Our bounds are constructive. We also show that$$c_3 \ge 2^{7/6}$$ , which disproves the conjecture for$$k=3$$ . Connections to matching problems, power assignment problems, related problems, including algorithms, are discussed in this context. A slightly revised version of the Bollobás–Meir conjecture is proposed.more » « less
-
Abstract We prove that there are$$\gg \frac{X^{\frac{1}{3}}}{(\log X)^2}$$ imaginary quadratic fieldskwith discriminant$$|d_k|\le X$$ and an ideal class group of 5-rank at least 2. This improves a result of Byeon, who proved the lower bound$$\gg X^{\frac{1}{4}}$$ in the same setting. We use a method of Howe, Leprévost, and Poonen to construct a genus 2 curveCover$$\mathbb {Q}$$ such thatChas a rational Weierstrass point and the Jacobian ofChas a rational torsion subgroup of 5-rank 2. We deduce the main result from the existence of the curveCand a quantitative result of Kulkarni and the second author.more » « less
-
Abstract The minimum linear ordering problem (MLOP) generalizes well-known combinatorial optimization problems such as minimum linear arrangement and minimum sum set cover. MLOP seeks to minimize an aggregated cost$$f(\cdot )$$ due to an ordering$$\sigma $$ of the items (say [n]), i.e.,$$\min _{\sigma } \sum _{i\in [n]} f(E_{i,\sigma })$$ , where$$E_{i,\sigma }$$ is the set of items mapped by$$\sigma $$ to indices [i]. Despite an extensive literature on MLOP variants and approximations for these, it was unclear whether the graphic matroid MLOP was NP-hard. We settle this question through non-trivial reductions from mininimum latency vertex cover and minimum sum vertex cover problems. We further propose a new combinatorial algorithm for approximating monotone submodular MLOP, using the theory of principal partitions. This is in contrast to the rounding algorithm by Iwata et al. (in: APPROX, 2012), using Lovász extension of submodular functions. We show a$$(2-\frac{1+\ell _{f}}{1+|E|})$$ -approximation for monotone submodular MLOP where$$\ell _{f}=\frac{f(E)}{\max _{x\in E}f(\{x\})}$$ satisfies$$1 \le \ell _f \le |E|$$ . Our theory provides new approximation bounds for special cases of the problem, in particular a$$(2-\frac{1+r(E)}{1+|E|})$$ -approximation for the matroid MLOP, where$$f = r$$ is the rank function of a matroid. We further show that minimum latency vertex cover is$$\frac{4}{3}$$ -approximable, by which we also lower bound the integrality gap of its natural LP relaxation, which might be of independent interest.more » « less
-
Abstract We consider thed-dimensional MagnetoHydroDynamics (MHD) system defined on a sufficiently smooth bounded domain,$$d = 2,3$$ with homogeneous boundary conditions, and subject to external sources assumed to cause instability. The initial conditions for both fluid and magnetic equations are taken of low regularity. We then seek to uniformly stabilize such MHD system in the vicinity of an unstable equilibrium pair, in the critical setting of correspondingly low regularity spaces, by means of explicitly constructed, static, feedback controls, which are localized on an arbitrarily small interior subdomain. In additional, they will be minimal in number. The resulting space of well-posedness and stabilization is a suitable product space$$\displaystyle \widetilde{\textbf{B}}^{2- ^{2}\!/_{p}}_{q,p}(\Omega )\times \widetilde{\textbf{B}}^{2- ^{2}\!/_{p}}_{q,p}(\Omega ), \, 1< p < \frac{2q}{2q-1}, \, q > d,$$ of tight Besov spaces for the fluid velocity component and the magnetic field component (each “close” to$$\textbf{L}^3(\Omega )$$ for$$d = 3$$ ). Showing maximal$$L^p$$ -regularity up to$$T = \infty $$ for the feedback stabilized linear system is critical for the analysis of well-posedness and stabilization of the feedback nonlinear problem.more » « less
An official website of the United States government
