English
Related papers

Related papers: On the size of Nikodym sets in finite fields

200 papers

Let $\mathbb{F}_q$ be the finite field with $q$ elements, and $T$ a positive integer. In this article we find a sharp estimative of the total number of monic irreducible binomials in $\mathbb F_q[x]$ of degree less or equal to $T$, when $T$…

Let $E \subseteq \mathbb{F}_q^2$ be a set in the 2-dimensional vector space over a finite field with $q$ elements, which satisfies $|E| > q$. There exist $x,y \in E$ such that $|E \cdot (y-x)| > q/2.$ In particular, $(E+E) \cdot (E-E) =…

Combinatorics · Mathematics 2017-06-20 Giorgis Petridis

The $\lambda$-quiddities of size $n$ are $n$-tuples of elements of a fixed set, solutions of a matrix equation appearing in the study of Coxeter's friezes. These can be considered on various sets with very different structures from one set…

Combinatorics · Mathematics 2025-04-04 Michael Cuntz , Flavien Mabilat

In this work, we classify all finite groups such that for every field extension F of \mathbb{Q}, F is the field of values of at most 3 irreducible characters.

Group Theory · Mathematics 2023-01-02 Juan Martínez

For each natural number $d$, we introduce the concept of a $d$-cap in $\mathbb{F}_3^n$. A subset of $\mathbb{F}_3^n$ is called a $d$-cap if, for each $k = 1, 2, \dots, d$, no $k+2$ of the points lie on a $k$-dimensional flat. This…

Combinatorics · Mathematics 2020-10-14 Yixuan Huang , Michael Tait , Robert Won

We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, $\mathbb{F}_{q^n}$, small $q$ and large $n$, we show that the set of all low degree polynomials…

Number Theory · Mathematics 2014-12-24 Abhishek Bhowmick , Thái Hoàng Lê

A $\lambda$-quiddity of size $n$ is an $n$-tuple of elements from a fixed set, which is a solution to a matrix equation that arises in the study of Coxeter's friezes. The study of these solutions involves in particular the use of a notion…

Combinatorics · Mathematics 2025-03-10 Flavien Mabilat

We construct explicitly in any finite field of the form Fq[x]/(x^m-a) elements with multiplicative order at least 2^{(2m)^(1/2)}

Number Theory · Mathematics 2026-02-27 Roman Popovych

In this paper, we investigate a problem concerning quartets, which are a particular type of tree on four leaves. Loosely speaking, a set of quartets is said to be `definitive' if it completely encapsulates the structure of some larger tree,…

Combinatorics · Mathematics 2011-01-28 Chris Dowden

A Sidon set is a subset of an Abelian group with the property that each sum of two distinct elements is distinct. We construct a small maximal Sidon set of size $O((n \cdot 2^n)^{1/3})$ in the group $\mathbb{Z}_2^n$, generalizing a result…

Combinatorics · Mathematics 2022-04-12 Maximus Redman , Lauren Rose , Raphael Walker

In this article, we count the quantity of minimal cyclic codes of length $n$ and dimension $k$ over a finite field $\mathbb F_q$, in the case when the prime factors of $n$ satisfy a special condition. This problem is equivalent to count the…

Information Theory · Computer Science 2014-06-18 F. E. Brochero Martínez

We consider the linear vector space formed by the elements of the finite fields $\mathbb{F}_q$ with $q=p^r$ over $\mathbb{F}_p$. Let ${a_1,\ldots,a_r}$ be a basis of this space. Then the elements $x$ of $\mathbb{F}_q$ have a unique…

Number Theory · Mathematics 2016-02-23 Mikhail Gabdullin

A family $\mathcal{F}\subset 2^G$ of subsets of an abelian group $G$ is a Sidon system if the sumsets $A+B$ with $A,B\in \mathcal{F}$ are pairwise distinct. Cilleruelo, Serra and the author previously proved that the maximum size $F_k(n)$…

Combinatorics · Mathematics 2024-02-20 Maximilian Wötzel

A cap set is a subset of $\mathbb{F}_3^n$ with no solutions to $x+y+z=0$ other than when $x=y=z$. In this paper, we provide a new lower bound on the size of a maximal cap set. Building on a construction of Edel, we use improved…

Combinatorics · Mathematics 2023-12-13 Fred Tyrrell

We study subsets of the $n$-dimensional vector space over the finite field $\mathbb{F}_q$, for odd $q$, which contain either a sphere for each radius or a sphere for each first coordinate of the center. We call such sets radii spherical…

Combinatorics · Mathematics 2020-04-03 Mehdi Makhul , Audie Warren , Arne Winterhof

We find the exact size of a maximal non-commuting set in unipotent uppertriangular linear group $UU_4(\mathbb{F}_q)$ in terms of a non-commuting geometric structure (Refer Definition [10]), where $\mathbb{F}_q$ is the finite field with $q$…

Number Theory · Mathematics 2017-02-08 C. P. Anil Kumar , S. K. Prajapati

In this paper, we introduce several notions of "dimension" of a finite group, involving sizes of generating sets and certain configurations of maximal subgroups. We focus on the inequality $m(G) \leq \mathrm{MaxDim}(G)$, giving a family of…

Group Theory · Mathematics 2015-02-03 Ravi Fernando

A Sidon set is a set A of integers such that no integer has two essentially distinct representations as the sum of two elements of A. More generally, for every positive integer g, a B_2[g]-set is a set A of integers such that no integer has…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

A finite set $ S \subset \mathbb{R} $ is called a Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x \le y $ are distinct, and a weak Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x < y $ are distinct. For a finite set $ A…

Combinatorics · Mathematics 2026-03-09 Jie Ma , Quanyu Tang

A family $\mbox{$\cal F$}=\{F_1,\ldots,F_m\}$ of subsets of $[n]$ is said to be ordered, if there exists an $1\leq r\leq m$ index such that $n\in F_i$ for each $1\leq i\leq r$, $n\notin F_i$ for each $i>r$ and $|F_i|\leq |F_j|$ for each…

Combinatorics · Mathematics 2024-11-08 Gábor Hegedüs