English
Related papers

Related papers: Large line-free sets and their applications

200 papers

Let A_{R,q} denote a family of covering codes, in which the covering radius R and the size q of the underlying Galois field are fixed, while the code length tends to infinity. In this paper, infinite sets of families A_{R,q}, where R is…

Combinatorics · Mathematics 2009-04-27 Alexander A. Davydov , Massimo Giulietti , Stefano Marcugini , Fernanda Pambianco

Let $p>3$ and consider a prime power $q=p^h$. We completely characterize permutation polynomials of $\mathbb{F}_{q^2}$ of the type $f_{a,b}(X) = X(1 + aX^{q(q-1)} + bX^{2(q-1)}) \in \mathbb{F}_{q^2}[X]$. In particular, using connections…

Combinatorics · Mathematics 2019-11-22 Daniele Bartoli , Marco Timpanella

We study the polynomials $x^n + (1-x)^n + a^n, a \in\mathbb{Q}$, whose rational roots would yield counterexamples to Fermat's Last Theorem. We investigate their factorization over $\mathbb{Q}$. In the case $a \notin \{0, \pm 1\}$, we ask…

Number Theory · Mathematics 2026-04-06 Hayk Karapetyan , Ruben Hambardzumyan

Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…

Number Theory · Mathematics 2025-08-18 Robert Dougherty-Bliss , Mits Kobayashi , Natalya Ter-Saakov , Eugene Zima

For $B \subseteq \mathbb F_q^m$, the $n$-th affine extremal number of $B$ is the maximum cardinality of a set $A \subseteq \mathbb F_q^n$ with no subset which is affinely isomorphic to $B$. Furstenberg and Katznelson proved that for any $B…

Combinatorics · Mathematics 2023-08-28 Bryce Frederickson , Liana Yepremyan

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…

Combinatorics · Mathematics 2013-01-10 Philippe Cara , Sara Rottey , Geertrui Van de Voorde

Set systems with strongly restricted intersections, called $\alpha$-intersecting families for a vector $\alpha$, were introduced recently as a generalization of several well-studied intersecting families including the classical oddtown and…

Combinatorics · Mathematics 2024-04-15 Xin Wei , Xiande Zhang , Gennian Ge

In this paper, we present a linear algebraic approach to the study of permutation polynomials that arise from linear maps over a finite field $\mathbb{F}_{q^2}$. We study a particular class of permutation polynomials over…

Combinatorics · Mathematics 2022-12-09 Megha M. Kolhekar , Harish K. Pillai

We classify complete permutation polynomials of type $aX^{\frac{q^n-1}{q-1}+1}$ over the finite field with $q^n$ elements, for $n+1$ a prime and $n^4 < q$. For the case $n+1$ a power of the characteristic we study some known families. We…

Combinatorics · Mathematics 2017-02-20 Daniele Bartoli , Massimo Giulietti , Luciane Quoos , Giovanni Zini

Let $q$ be a power of a prime $p$, let $\mathbb F_q$ be the finite field with $q$ elements and, for each nonconstant polynomial $F\in \mathbb F_{q}[X]$ and each integer $n\ge 1$, let $s_F(n)$ be the degree of the splitting field (over…

Number Theory · Mathematics 2025-08-13 Lucas Reis

Extremal problems on set systems with restricted intersections have been an important part of combinatorics in the last 70 year. In this paper, we study the following Ramsey version of these problems. Given a set $L\subseteq…

Combinatorics · Mathematics 2025-04-22 Barnabás Janzer , Zhihan Jin , Benny Sudakov , Kewen Wu

The Tur\'{a}n problem asks for the largest number of edges ex$(n,H)$ in an $n$-vertex graph not containing a fixed forbidden subgraph $H$, which is one of the most important problems in extremal graph theory. However the order of magnitude…

Combinatorics · Mathematics 2024-08-06 Tao Zhang , Zixiang Xu , Gennian Ge

In this paper we extend a previous investigation by us regarding an iterative construction of irreducible polynomials over finite fields of odd characteristic. In particular, we show how it is possible to iteratively construct irreducible…

Dynamical Systems · Mathematics 2015-03-31 Simone Ugolini

It is well known that a polynomial $\phi(X)\in \mathbb{Z}[X]$ of given degree $d$ factors into at most $d$ factors in $\mathbb{F}_p$ for any prime $p$. We prove in this paper the existence of infinitely many primes $q$ so that the given…

Number Theory · Mathematics 2023-05-22 Shubham Saha

We provide sufficient and necessary conditions for the coefficients of a $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ which ensure that the number of distinct roots of $f$ in $\mathbb{F}_{q^n}$ equals the degree of $f$. We say that these…

Combinatorics · Mathematics 2020-09-17 Bence Csajbók , Giuseppe Marino , Olga Polverino , Ferdinando Zullo

Using Okounkov's $q$-integral representation of Macdonald polynomials we construct an infinite sequence $\Omega_1,\Omega_2,\Omega_3,\dots$ of countable sets linked by transition probabilities from $\Omega_N$ to $\Omega_{N-1}$ for each…

Probability · Mathematics 2021-06-29 Grigori Olshanski

Let $f(x)$ be a monic polynomial over $\mathbb{Q}$ with complex roots $\alpha_1,\dots,\alpha_n$. Linear relations among them and $1$ over $\mathbb{Q}$ play an important role when we study the distribution of roots modulo a prime. We study…

Number Theory · Mathematics 2018-10-17 Yoshiyuki Kitaoka

We construct new families of groups with property (T) and infinitely many alternating group quotients. One of those consists of subgroups of $\mathrm{Aut}(\mathbf F_{p}[x_1, \dots, x_n])$ generated by a suitable set of tame automorphisms.…

Group Theory · Mathematics 2023-05-29 Pierre-Emmanuel Caprace , Martin Kassabov

A strong $s$-blocking set in a projective space is a set of points that intersects each codimension-$s$ subspace in a spanning set of the subspace. We present an explicit construction of such sets in a $(k - 1)$-dimensional projective space…

Combinatorics · Mathematics 2026-05-11 Anurag Bishnoi , István Tomon

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

Combinatorics · Mathematics 2017-05-04 Oliver Roche-Newton , Ilya D. Shkredov , Arne Winterhof