Searcharxiv⌕ Search

arXiv subjects

Bence Csajbók

Publications and source records attributed to Bence Csajbók.

At least 19 recordsLinked to original sources

Intersecting families and nonvanishing multivariate polynomials over finite fields

Let $\mathcal{P}_{n,d}$ be the space of polynomials in $n$ variables over $\mathbb{F}_q$ of degree at most $d$. Two polynomials $f,g\in\mathcal{P}_{n,d}$ intersect if $f(\mathbf a)=g(\mathbf a)$ for some $\mathbf a\in\mathbb{F}_q^n$. A star consists of all polynomials $f\in\mathcal{P}_{n,d}$ satisfying $f(\mathbf a)=b$ for fixed $\mathbf a\in\mathbb{F}_q^n$ and $b\in\mathbb{F}_q$. We completely classify the maximum intersecting families in $\mathcal{P}_{n,d}$. When $n=1$ and $d\geq 2$, it was previously shown that all maximum intersecting families are stars. We prove that the same conclusion holds for all $n\geq 2$ and $d\geq 2$ when $q$ is odd. When $q$ is even, however, the situation is more subtle, and a new phenomenon emerges: for $q\geq 4$, maximum non-star examples exist precisely when $d\leq n$. Along the way, we prove two further results of independent interest. First, we determine the span of nonvanishing polynomials in $\mathcal{P}_{n,d}$. Second, we characterize all linear functionals $Ψ\colon\mathcal{P}_{n,d}\to\mathbb{F}_q$ whose kernels are disjoint from the set of nonvanishing polynomials. The first result plays a crucial role in the proof of our main result; the second is a Gleason--Kahane--Żelazko theorem for polynomials of bounded degree over finite fields.

math.NT↗

Small complete 3-term progression free sets in cyclic groups and vector spaces

A classical extremal problem on progression free sets is to determine the maximum size of a $3$-term arithmetic progression free set in algebraic structures, for instance in intervals of integers or in finite vector spaces. To determine the minimum size of a complete $3$-term arithmetic progression free set is a lower-end analogue of this problem. It is also closely related to complete caps and saturating sets in finite geometry. A simple counting argument shows that the order of magnitude of the minimum size is at least the square root of the cardinality of the structure. Addressing two open problems, we show that this lower bound is essentially tight. First, for every cyclic group $\mathbb{Z}_m$, we give explicit constructions of complete $3$-AP-free sets whose size is less than $2\sqrt m$. For $m\ge81$ the constructed sets satisfy the stronger, so-called complete $(2,-1)$-avoiding property; the remaining cases $m<81$ are covered by a finite verification. Second, we resolve the vector space variant in a weaker sense by showing that for every fixed odd prime $p$ and $\varepsilon>0$, there is a constant $C_{p, \varepsilon}$ such that \[ a(3\text{-}\mathrm{AP},\mathbb{F}_p^n)\le C_{p, \varepsilon}\,n^{1+\varepsilon}\,p^{n/2} =p^{n/2+o(n)} \] holds for the minimum size $a(3\text{-}\mathrm{AP},\mathbb{F}_p^n)$ of a complete 3-AP-free subset of $\mathbb{F}_p^n$, for all $n\ge1$.

math.CO↗

Small 3-fold blocking sets in $\mathrm{PG}(2,p^n)$

A $t$-fold blocking set of the finite Desarguesian plane $\mathrm{PG}(2,p^n)$, $p$ prime, is a set of points meeting each line of the plane in at least $t$ points. The minimum size of such sets is of interest for numerous reasons; however, even the minimum size of nontrivial blocking sets (i.e. $1$-fold blocking sets not containing a line) in \(\mathrm{PG}(2,p^n)\) is an open question when $n\geq 5$ is odd. For $n>1$ the conjectured lower bound for this size is $(p^n+p^{n(s-1)/s}+1)$, where $p^{n/s}$ is the size of the largest proper subfield of $\mathbb{F}_{p^n}$. Since the union of $t$ pairwise disjoint nontrivial blocking sets is a $t$-fold blocking set, it is conjectured that when $p^{n/s}$ is large enough w.r.t. $t$, then the minimum size of a $t$-fold blocking set in $\mathrm{PG}(2,p^n)$ is $t(p^n+p^{n(s-1)/s}+1)$. If $n$ is even, then the decomposition of the plane into disjoint Baer subplanes gives a $t$-fold blocking set of this size. However, for odd $n$, the existence of such sets is an unsolved problem in most cases. In this paper, we construct $3$-fold blocking sets of conjectured size. These blocking sets are obtained as the disjoint union of three linear blocking sets of Rédei type, and they lie on the same orbit of the projectivity $(x:y:z)\mapsto (z:x:y)$.

math.CO↗

A lower bound on the minimum weight of some geometric codes

The $p$-ary code associated with the incidence structure of points and $t$-spaces in a projective space $\mathrm{PG}(m,q)$, where $q=p^h$, is the $\mathbb{F}_p$-subspace generated by the incidence vectors of the blocks of this design. The dual of this code consists of all vectors orthogonal to every codeword of the original code. In contrast to the codes derived from point-subspace incidences, the minimum weight of the corresponding dual codes is generally unknown, which makes the problem more challenging. In 2008 Lavrauw, Storme and Van de Voorde proved the following reduction: the minimum weight of the dual of the code derived from point and $t$-space incidences in $\mathrm{PG}(m,q)$ is the same as the minimum weight of the dual of the code derived from point and line incidences in $\mathrm{PG}(m-t+1,q)$. After a series of works by Delsarte (1970), Assmus and Key (1992), Calkin, Key and De Resmini (1999), the best known lower bound for the case of point-line incidences was established in [B. Bagchi and P. Inamdar: Projective geometric codes, J. Combin. Theory Ser. A, 99(1) (2002), 128-142]. The problem of determining the minimum weight of these codes admits a natural geometric interpretation in terms of multisets of points in a projective space which meet each line in $0$ modulo $p$ points. In this paper, by adopting this geometrical perspective and exploiting certain polynomial techniques from [S. Ball, A. Blokhuis, A. Gács, P. Sziklai, Zs. Weiner: On linear codes whose weights and length have a common divisor, Adv. Math., 211 (2007), 94-104], we prove a substantial improvement of the Bagchi-Inamdar bound in the case where $h>1$ and $m, p >2$.

math.CO↗

Complete $3$-term arithmetic progression free sets of small size in vector spaces and other abelian groups

A subset $S$ of an abelian group $G$ is called $3$-$\mathrm{AP}$ free if it does not contain a three term arithmetic progression. Moreover, $S$ is called complete $3$-$\mathrm{AP}$ free, if it is maximal w.r.t. set inclusion. One of the most central problems in additive combinatorics is to determine the maximal size of a $3$-$\mathrm{AP}$ free set, which is necessarily complete. In this paper we are interested in the minimum size of complete $3$-$\mathrm{AP}$ free sets. We define and study saturation w.r.t. $3$-$\mathrm{AP}$s and present constructions of small complete $3$-$\mathrm{AP}$ free sets and $3$-$\mathrm{AP}$ saturating sets for several families of vector spaces and cyclic groups.

math.CO↗

Extending a result of Carlitz and McConnel to polynomials which are not permutations

Let $D$ denote the set of directions determined by the graph of a polynomial $f$ of $\mathbb{F}_q[x]$, where $q$ is a power of the prime $p$. If $D$ is contained in a multiplicative subgroup $M$ of $\mathbb{F}_q^\times$, then by a result of Carlitz and McConnel it follows that $f(x)=ax^{p^k}+b$ for some $k\in \mathbb{N}$. Of course, if $D\subseteq M$, then $0\notin D$ and hence $f$ is a permutation. If we assume the weaker condition $D\subseteq M \cup \{0\}$, then $f$ is not necessarily a permutation, but Sziklai conjectured that $f(x)=ax^{p^k}+b$ follows also in this case. When $q$ is odd, and the index of $M$ is even, then a result of Ball, Blokhuis, Brouwer, Storme and Sz\H onyi combined with a result of McGuire and Göloğlu proves the conjecture. Assume $°f\geq 1$. We prove that if the size of $D^{-1}D=\{d^{-1}d' : d\in D\setminus \{0\},\, d'\in D\}$ is less than $q-°f+2$, then $f$ is a permutation of $\mathbb{F}_q$. We use this result to verify the conjecture of Sziklai.

math.CO↗

On regular sets of affine type in finite Desarguesian planes and related codes

In this paper, we consider point sets of finite Desarguesian planes whose multisets of intersection numbers with lines is the same for all but one exceptional parallel class of lines. We call such sets regular of affine type. When the lines of the exceptional parallel class have the same intersection numbers, then we call these sets regular of pointed type. Classical examples are e.g. unitals; a detailed study and constructions of such sets with few intersection numbers is due to Hirschfeld and Szőnyi from 1991. We here provide some general construction methods for regular sets and describe a few infinite families. The members of one of these families have the size of a unital and meet affine lines of $\mathrm{PG}(2, q^2)$ in one of $4$ possible intersection numbers, each of them congruent to $1$ modulo $\sqrt{q}$. As a byproduct, we determine the intersection sizes of the Hermitian curve defined over $\mathrm{GF}(q^2)$ with suitable rational curves of degree $\sqrt{q}$ and we obtain $\sqrt{q}$-divisible codes with $5$ non-zero weights. We also determine the weight enumerator of the codes arising from the general constructions modulus some $q$-powers.

math.CO↗

Renitent lines

There are many examples for point sets in finite geometry, which behave "almost regularly" in some (well-defined) sense, for instance they have "almost regular" line-intersection numbers. In this paper we investigate point sets of a desarguesian affine plane, for which there exist some (sometimes: many) parallel classes of lines, such that almost all lines of one parallel class intersect our set in the same number of points (possibly mod $p$, the characteristic). The lines with exceptional intersection numbers are called renitent, and we prove results on the (regular) behaviour of these renitent lines.

math.CO↗

On the maximum field of linearity of linear sets

Let $V$ denote an $r$-dimensional $\mathbb{F}_{q^n}$-vector space. For an $m$-dimensional $\mathbb{F}_q$-subspace $U$ of $V$ assume that $\dim_q \left(\langle {\bf v}\rangle_{\mathbb{F}_{q^n}} \cap U\right) \geq 2$ for each non zero vector ${\bf v}\in U$. If $n\leq q$ then we prove the existence of an integer $1<d \mid n$ such that the set of one-dimensional $\mathbb{F}_{q^n}$-subspaces generated by non-zero vectors of $U$ is the same as the set of one-dimensional $\mathbb{F}_{q^n}$-subspaces generated by non-zero vectors of $\langle U\rangle_{\mathbb{F}_{q^d}}$. If we view $U$ as a point set of $\mathrm{AG}(r,q^n)$, it means that $U$ and $\langle U \rangle_{\mathbb{F}_{q^d}}$ determine the same set of directions. We prove a stronger statement when $n \mid m$. In terms of linear sets it means that an $\mathbb{F}_q$-linear set of $\mathrm{PG}(r-1,q^n)$ has maximum field of linearity $\mathbb{F}_q$ only if it has a point of weight one. We also present some consequences regarding the size of a linear set.

math.CO↗

Intersecting families of graphs of functions over a finite field

Let $U$ be a set of polynomials of degree at most $k$ over $\mathbb{F}_q$, the finite field of $q$ elements. Assume that $U$ is an intersecting family, that is, the graphs of any two of the polynomials in $U$ share a common point. Adriaensen proved that the size of $U$ is at most $q^k$ with equality if and only if $U$ is the set of all polynomials of degree at most $k$ passing through a common point. In this manuscript, using a different, polynomial approach, we prove a stability version of this result, that is, the same conclusion holds if $|U|>q^k-q^{k-1}$. We prove a stronger result when $k=2$. For our purposes, we also prove the following results. If the set of directions determined by the graph of $f$ is contained in an additive subgroup of $\mathbb{F}_q$, then the graph of $f$ is a line. If the set of directions determined by at least $q-\sqrt{q}/2$ affine points is contained in the set of squares/non-squares plus the common point of either the vertical or the horizontal lines, then up to an affinity the point set is contained in the graph of some polynomial of the form $αx^{p^k}$.

math.CO↗

On a conjecture about maximum scattered subspaces of $\mathbb{F}_{q^6}\times \mathbb{F}_{q^6}$

Maximum scattered subspaces are not only objects of intrinsic interest in finite geometry but also powerful tools for the construction of MRD-codes, projective two-weight codes, and strongly regular graphs. In 2018 Csajbók, Marino, Polverino, and Zanella introduced a new family of maximum scattered subspaces in $\mathbb{F}_{q^6} \times \mathbb{F}_{q^6}$ arising from polynomials of type $f_b(x)=bx^q+x^{q^4}$ for certain choices of $b \in \mathbb{F}_{q^6}$. Throughout characterizations for $f_{b_2}(x)$ and $f_{b_1}(x)$ giving rise to equivalent maximum scattered subspaces, the authors conjectured that the portion of new and inequivalent maximum scattered subspaces obtained in this way is quite large. In this paper first we find necessary and sufficient conditions for $b$ to obtain a maximum scattered subspace. Such conditions were found independently with different techniques also by Polverino and Zullo 2019. Then we prove the conjecture on the number of new and inequivalent maximum scattered subspaces of this family.

math.CO↗

Small complete caps in ${\rm PG}(4n + 1, q)$

In this paper we prove the existence of a complete cap of ${\rm PG}(4n+1, q)$ of size $2(q^{2n+1}-1)/(q-1)$, for each prime power $q>2$. It is obtained by projecting two disjoint Veronese varieties of ${\rm PG}(2n^2+3n, q)$ from a suitable $(2n^2-n-2)$-dimensional projective space. This shows that the trivial lower bound for the size of the smallest complete cap of ${\rm PG}(4n+1, q)$ is essentially sharp.

math.CO↗

Evasive subspaces

Let $V$ denote an $r$-dimensional vector space over $\mathbb{F}_{q^n}$, the finite field of $q^n$ elements. Then $V$ is also an $rn$-dimension vector space over $\mathbb{F}_q$. An $\mathbb{F}_q$-subspace $U$ of $V$ is $(h,k)_q$-evasive if it meets the $h$-dimensional $\mathbb{F}_{q^n}$-subspaces of $V$ in $\mathbb{F}_q$-subspaces of dimension at most $k$. The $(1,1)_q$-evasive subspaces are known as scattered and they have been intensively studied in finite geometry, their maximum size has been proved to be $\lfloor rn/2 \rfloor$ when $rn$ is even or $n=3$. We investigate the maximum size of $(h,k)_q$-evasive subspaces, study two duality relations among them and provide various constructions. In particular, we present the first examples, for infinitely many values of $q$, of maximum scattered subspaces when $r=3$ and $n=5$. We obtain these examples in characteristics $2$, $3$ and $5$.

math.CO↗

MRD codes with maximum idealizers

Left and right idealizers are important invariants of linear rank-distance codes. In the case of maximum rank-distance (MRD for short) codes in $\mathbb{F}_q^{n\times n}$ the idealizers have been proved to be isomorphic to finite fields of size at most $q^n$. Up to now, the only known MRD codes with maximum left and right idealizers are generalized Gabidulin codes, which were first constructed in 1978 by Delsarte and later generalized by Kshevetskiy and Gabidulin in 2005. In this paper we classify MRD codes in $\mathbb{F}_q^{n\times n}$ for $n\leq 9$ with maximum left and right idealizers and connect them to Moore-type matrices. Apart from generalized Gabidulin codes, it turns out that there is a further family of rank-distance codes providing MRD ones with maximum idealizers for $n=7$, $q$ odd and for $n=8$, $q\equiv 1 \pmod 3$. These codes are not equivalent to any previously known MRD code. Moreover, we show that this family of rank-distance codes does not provide any further examples for $n\geq 9$.

math.CO↗

Generalizing Korchmáros--Mazzocca arcs

In this paper, we generalize the so called Korchmáros--Mazzocca arcs, that is, point sets of size $q+t$ intersecting each line in $0, 2$ or $t$ points in a finite projective plane of order $q$. For $t\neq 2$, this means that each point of the point set is incident with exactly one line meeting the point set in $t$ points. In $\mathrm{PG}(2,p^n)$, we change $2$ in the definition above to any integer $m$ and describe all examples when $m$ or $t$ is not divisible by $p$. We also study mod $p$ variants of these objects, give examples and under some conditions we prove the existence of a nucleus.

math.CO↗

Generalising the scattered property of subspaces

Let $V$ be an $r$-dimensional $\mathbb{F}_{q^n}$-vector space. We call an $\mathbb{F}_q$-subspace $U$ of $V$ $h$-scattered if $U$ meets the $h$-dimensional $\mathbb{F}_{q^n}$-subspaces of $V$ in $\mathbb{F}_q$-subspaces of dimension at most $h$. In 2000 Blokhuis and Lavrauw proved that $\dim_{\mathbb{F}_q} U \leq rn/2$ when $U$ is $1$-scattered. Subspaces attaining this bound have been investigated intensively because of their relations with projective two-weight codes and strongly regular graphs. MRD-codes with a maximum idealiser have also been linked to $rn/2$-dimensional $1$-scattered subspaces and to $n$-dimensional $(r-1)$-scattered subspaces. In this paper we prove the upper bound $rn/(h+1)$ for the dimension of $h$-scattered subspaces, $h>1$, and construct examples with this dimension. We study their intersection numbers with hyperplanes, introduce a duality relation among them, and study the equivalence problem of the corresponding linear sets.

math.CO↗

Scalar $q$-subresultants and Dickson matrices

Following the ideas of Ore and Li we study $q$-analogues of scalar subresultants and show how these results can be applied to determine the rank of an $\mathbb{F}_q$-linear transformation $f$ of $\mathbb{F}_{q^n}$. As an application we show how certain minors of the Dickson matrix $D(f)$, associated with $f$, determine the rank of $D(f)$ and hence the rank of $f$.

math.CO↗

On sets of points with few odd secants

We prove that, for $q$ odd, a set of $q+2$ points in the projective plane over the field with $q$ elements has at least $2q-c$ odd secants, where $c$ is a constant and an odd secant is a line incident with an odd number of points of the set.

math.CO↗