English
Related papers

Related papers: Large line-free sets and their applications

200 papers

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

Number Theory · Mathematics 2019-11-04 Patrick Letendre

In this paper we study sum-free sets of order $m$ in finite Abelian groups. We prove a general theorem on 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting.…

Combinatorics · Mathematics 2012-02-01 Noga Alon , József Balogh , Robert Morris , Wojciech Samotij

This paper has three aims. First, for $n \geq 1$ we construct a family of real-rooted trigonometric polynomial maps $P : \mathbb C^n \mapsto \mathbb C^n$ whose divisors are Fourier Quasicrystals (FQ). For $n = 1$ these divisors include the…

Algebraic Geometry · Mathematics 2025-01-08 Wayne M Lawton , August K. Tsikh

There is a large literature on cover-free families of finite sets, because of their many applications in combinatorial group testing, cryptographic and communications. This work studies the generalization of cover-free families from sets to…

Combinatorics · Mathematics 2024-07-31 Yunjing Shan , Junling Zhou

Let $F_q$ be the finite field with $q$ elements and $F_q[x_1,\ldots, x_n]$ the ring of polynomials in $n$ variables over $F_q$. In this paper we consider permutation polynomials and local permutation polynomials over $F_q[x_1,\ldots, x_n]$,…

Combinatorics · Mathematics 2023-08-30 Jaime Gutierrez , Jorge Jimenez Urroz

We show that subsets of $\mathbb{R}^n$ of large enough Hausdorff and Fourier dimension contain polynomial patterns of the form \begin{align*} ( x ,\, x + A_1 y ,\, \dots,\, x + A_{k-1} y ,\, x + A_k y + Q(y) e_n ), \quad x \in…

Classical Analysis and ODEs · Mathematics 2016-08-03 Kevin Henriot , Izabella Laba , Malabika Pramanik

As a homomorphic image of the hyperalgebra $U_{q,R}(m|n)$ associated with the quantum linear supergroup $U_\upsilon(\mathfrak{gl}_{m|n})$, we first give a presentation for the $q$-Schur superalgebra $S_{q,R}(m|n,r)$ over a commutative ring…

Representation Theory · Mathematics 2018-05-29 Jie Du , Yanan Lin , Zhongguo Zhou

Let $q$ be a prime power and $k$ be a natural number. What are the possible cardinalities of point sets ${S}$ in a projective plane of order $q$, which do not intersect any line at exactly $k$ points? This problem and its variants have been…

Combinatorics · Mathematics 2024-09-24 Tamás Héger , Zoltán Lóránt Nagy

Denote the collection of all $k$-flats in $AG(n,\mathbb{F}_q)$ by $\mathscr{M}(k,n)$. Let $\mathscr{F}_1\subset\mathscr{M}(k_1,n)$ and $\mathscr{F}_2\subset\mathscr{M}(k_2,n)$ satisfy $\dim(F_1\cap F_2)\ge t$ for any $F_1\in\mathscr{F}_1$…

Combinatorics · Mathematics 2022-02-16 Tian Yao , Kaishun Wang

One powerful method for upper-bounding the largest independent set in a graph is the Hoffman bound, which gives an upper bound on the largest independent set of a graph in terms of its eigenvalues. It is easily seen that the Hoffman bound…

Combinatorics · Mathematics 2019-11-07 Yuval Filmus , Konstantin Golubev , Noam Lifshitz

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

Combinatorics · Mathematics 2026-01-01 Norbert Hegyvari , Janos Pach , Thang Pham

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…

Combinatorics · Mathematics 2024-01-08 Angela Aguglia , Bence Csajbók , Luca Giuzzi

We study number theoretic properties of the map $x \mapsto x^{x} \mod{p}$, where $x \in \{1,2,\ldots,p-1\}$, and improve on some recent upper bounds, due to Kurlberg, Luca, and Shparlinski, on the number of primes $p < N$ for which the map…

Number Theory · Mathematics 2017-07-05 Adam Tyler Felix , Pär Kurlberg

Following the approach by R. K\"otter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space F_q^n, q being a prime power and F_q the finite field with q elements. In particular,…

Information Theory · Computer Science 2013-06-25 Elisa Gorla , Alberto Ravagnani

We consider the number \bar N(q) of points in the projective complement of graph hypersurfaces over \F_q and show that the smallest graphs with non-polynomial \bar N(q) have 14 edges. We give six examples which fall into two classes. One…

Combinatorics · Mathematics 2015-03-13 Oliver Schnetz

In this paper we discuss the permutational property of polynomials of the form $f(L(x))+k(L(x))\cdot M(x)\in \mathbb F_{q^n}[x]$ over the finite field $\mathbb F_{q^n}$, where $L, M\in \mathbb F_q[x]$ are $q$-linearized polynomials. The…

Number Theory · Mathematics 2021-04-28 Lucas Reis , Qiang Wang

We tackle several problems related to a finite irreducible crystallographic root system $\Phi$ in the real vector space $\mathbb E$. In particular, we study the combinatorial structure of the subsets of $\Phi$ cut by affine subspaces of…

Combinatorics · Mathematics 2021-09-03 Paola Cellini , Mario Marietti

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

Probability · Mathematics 2015-03-20 Kari Eloranta

It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…

Combinatorics · Mathematics 2016-03-18 Roland Bacher

Let P_G(q) denote the number of proper q-colorings of a graph G. This function, called the chromatic polynomial of G, was introduced by Birkhoff in 1912, who sought to attack the famous four-color problem by minimizing P_G(4) over all…

Combinatorics · Mathematics 2015-03-13 Po-Shen Loh , Oleg Pikhurko , Benny Sudakov