English
Related papers

Related papers: New inductive constructions of complete caps in $P…

200 papers

An infinite $(p,q)$-theorem, or an $(\aleph_0,q)$-theorem, involving two families $\mathcal{F}$ and $\mathcal{G}$ of sets, states that if in every infinite subset of $\mathcal{F}$, there are $q$ sets that are intersected by some set in…

Combinatorics · Mathematics 2025-09-12 Sutanoya Chakraborty , Arijit Ghosh

Capsets are subsets of $\mathbb{F}_3^n$ with no three points on a line and a capset is complete if it is not a subset of a larger capset. We study some new constructions of capsets via algebraic equations over extensions of $\mathbb{F}_3$.…

Combinatorics · Mathematics 2026-03-10 Cassie Grace , José Felipe Voloch

The problem of constructing curves with many points over finite fields has received considerable attention in the recent years. Using the class field theory approach, we construct new examples of curves ameliorating some of the known…

Number Theory · Mathematics 2016-11-16 Pavel Solomatin

We continue our study of ends of non-compact manifolds, with a focus on the inward tameness condition. For manifolds with compact boundary, inward tameness, has significant implications. For example, such manifolds have stable homology at…

Geometric Topology · Mathematics 2017-04-19 Craig R. Guilbault , Frederick C. Tinsley

We are interested in the quantity $\rho$(q, g) defined as the smallest positive integer such that r $\ge$ $\rho$(q, g) implies that any absolutely irreducible smooth projective algebraic curve defined over F q of genus g has a closed point…

Algebraic Geometry · Mathematics 2023-10-18 Yves Aubry , Fabien Herbaut , Julien Monaldi

For an integer $q\ge 2$, a perfect $q$-hash code $C$ is a block code over $[q]:=\{1,\ldots,q\}$ of length $n$ in which every subset $\{\mathbf{c}_1,\mathbf{c}_2,\dots,\mathbf{c}_q\}$ of $q$ elements is separated, i.e., there exists…

Information Theory · Computer Science 2023-03-03 Chaoping Xing , Chen Yuan

For any fixed dimension $d \geq 3$ we construct a Nikodym set in $F_q^d$ of cardinality $q^d - (\frac{d-2}{\log 2} +1+o(1)) q^{d-1} \log q$ in the limit $q \to \infty$, when $q$ is an odd prime power. This improves upon the naive random…

Combinatorics · Mathematics 2025-12-02 Terence Tao

We propose a new method of constructing q-ary propelinear perfect codes. The approach utilizes permutations of the fixed length q-ary vectors that arise from the automorphisms of the regular subgroups of the affine group. For any prime q it…

Combinatorics · Mathematics 2021-12-17 Ivan Mogilnykh

In this paper, we give a geometric construction of the three strong non-lifted $(3\mod{5})$-arcs in $\operatorname{PG}(3,5)$ of respective sizes 128, 143, and 168, and construct an infinite family of non-lifted, strong $(t\mod{q})$-arcs in…

Combinatorics · Mathematics 2023-08-29 Sascha Kurz , Ivan Landjev , Francesco Pavese , Assia Rousseva

An infinite family of exactly-solvable and integrable potentials on a plane is introduced. It is shown that all already known rational potentials with the above properties allowing separation of variables in polar coordinates are particular…

Mathematical Physics · Physics 2015-05-13 Frédérick Tremblay , Alexander V. Turbiner , Pavel Winternitz

For any integer $\rho \geq 1$ and for any prime power q, the explicit construction of a infinite family of completely regular (and completely transitive) q-ary codes with d=3 and with covering radius $\rho$ is given. The intersection array…

Information Theory · Computer Science 2008-10-29 J. Rifa , V. A. Zinoviev

We show that the metric dimension of a finite projective plane of order $q\geq 23$ is $4q-4$, and describe all resolving sets of that size. Let $\tau_2$ denote the size of the smallest double blocking set in $\mathrm{PG}(2,q)$, the…

Combinatorics · Mathematics 2017-01-31 Tamás Héger , Marcella Takáts

Assuming Lang's conjectured lower bound on the heights of non-torsion points on an elliptic curve, we show that there exists an absolute constant C such that for any elliptic curve E/Q and non-torsion point P in E(Q), there is at most one…

Number Theory · Mathematics 2015-02-06 Katherine E. Stange

Let $q\ge 2$ be a prime power. In this note we present a formulation for obtaining the known $(q+1,8)$-cages which has allowed us to construct small $(k,g)$--graphs for $k=q-1, q$ and $g=7,8$. Furthermore, we also obtain smaller…

Combinatorics · Mathematics 2015-01-13 M. Abreu , G. Araujo-Pardo , C. Balbuena , D. Labbate

We prove that a non-empty set L of at most q^5+q^4+q^3+q^2+q+1 lines of PG(n, q) with the properties that (1) every point of PG(n,q) is incident with either 0 or q+1 elements of L, (2) every plane plane of PG(n, q) is incident with either…

Combinatorics · Mathematics 2014-05-06 Ferdinand Ihringer

Let $\mathrm{PG}(3,q)$ be the projective space of dimension three over the finite field with $q$ elements. Consider a twisted cubic in $\mathrm{PG}(3,q)$. The structure of the point-plane incidence matrix in $\mathrm{PG}(3,q)$ with respect…

Combinatorics · Mathematics 2020-03-03 Daniele Bartoli , Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

Number Theory · Mathematics 2025-10-10 Magdaléna Tinková , Pavlo Yatsyna

In a 2022, Bartoli, Cossidente, Marino, and Pavese proved that in the projective space ${\rm PG}(3,q^3)$, one can find three $\mathbb F_q$-subgeometries such that the union of their point sets is a strong blocking set. This proves the…

Combinatorics · Mathematics 2025-11-20 Sam Adriaensen , Peter Sziklai , Zsuzsa Weiner

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…

Combinatorics · Mathematics 2022-08-10 Ferdinand Ihringer

In this paper, we describe the properties of the $i$-components of Hamming codes. We suggest constructions of the admissible families of components of Hamming codes. It is shown that every $q$-ary code of length $m$ and minimum distance 5…

Information Theory · Computer Science 2012-02-03 Alexander M. Romanov
‹ Prev 1 3 4 5 6 7 10 Next ›