English
Related papers

Related papers: Sets Avoiding Full-Rank Three-Point Patterns in $(…

200 papers

In this paper, we first determine the minimum possible size of an Fq-linear set of rank k in PG(1, q^n). We obtain this result by relating it to the number of directions determined by a linearized polynomial whose domain is restricted to a…

Combinatorics · Mathematics 2018-04-23 Jan De Beule , Geertrui Van de Voorde

A small minimal k-blocking set B in PG(n, q), q = pt, p prime, is a set of less than 3(qk + 1)/2 points in PG(n, q), such that every (n - k)-dimensional space contains at least one point of B and such that no proper subset of B satisfies…

Combinatorics · Mathematics 2012-01-17 Geertrui Van de Voorde

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

Let $q$ be an odd prime power. Let $f\in \mathbb{F}_q[x]$ be a polynomial having degree at least $2$, $a\in \mathbb{F}_q$, and denote by $f^n$ the $n$-th iteration of $f$. Let $\chi$ be the quadratic character of $\mathbb{F}_q$, and…

Number Theory · Mathematics 2024-03-29 Vefa Goksel , Giacomo Micheli

A family $\mathcal{F}$ on ground set $\{1,2,\ldots, n\}$ is maximal $k$-wise intersecting if every collection of $k$ sets in $\mathcal{F}$ has non-empty intersection, and no other set can be added to $\mathcal{F}$ while maintaining this…

Combinatorics · Mathematics 2022-06-30 József Balogh , Ce Chen , Haoran Luo

We study the maximum size of a subset of the $n \times n$ integer grid that does not contain specific geometric configurations, a variation of the classical problems initiated by Erd\H{o}s and Purdy. While extremal problems for 3-point…

Combinatorics · Mathematics 2026-02-23 Máté Jánosik , Artúr Nádor , Zoltán Lóránt Nagy , László Bence Simon

We enumerate 132-avoiding permutations of order 3 in terms of the Catalan and Motzkin generating functions, answering a question of B\'{o}na and Smith from 2019. We also enumerate 231-avoiding permutations that are composed only of…

Combinatorics · Mathematics 2024-02-26 Kassie Archer , Robert P. Laudone

The pattern avoidance problem seeks to construct a set with large fractal dimension that avoids a prescribed pattern, such as three term arithmetic progressions, or more general patterns, such as finding a set whose Cartesian product avoids…

Classical Analysis and ODEs · Mathematics 2019-12-03 Jacob Denson

We study the set--theoretic combinatorics underlying the following two algebraic phenomena. (1) A subgroup G leq Z^omega exhibits the Specker phenomenon iff every homomorphism G to Z maps almost all unit vectors to 0. Let se be the size of…

Logic · Mathematics 2016-09-06 Jörg Brendle

Let $k \geq 2$, $q$ be an odd prime power, and $F \in \mathbb{F}_q[x_1, \ldots, x_k]$ be a polynomial. An $F$-Diophantine set over a finite field $\mathbb{F}_q$ is a set $A \subset \mathbb{F}_q^*$ such that $F(a_1, a_2, \ldots, a_k)$ is a…

Number Theory · Mathematics 2025-05-09 Chi Hoi Yip , Semin Yoo

Let $q$ be an odd prime and $k$ be a natural number. We show that a finite subset of integers $S$ that does not contain any perfect $q^{th}$ power, contains a $q^{th}$ power residue modulo almost every natural numbers $N$ with at most $k$…

Number Theory · Mathematics 2025-07-17 Bhawesh Mishra , Paolo Santonastaso

We prove that for an arbitrary subtree $T$ of $2^{<\omega}$ with each element extendable to a path, a given countable class $\mathcal{M}$ closed under disjoint union, and any set $A$, if none of the members of $\mathcal{M}$ strongly…

Logic · Mathematics 2016-02-12 Lu Liu

In this note we prove that almost cap sets $A \subset \mathbb{F}_q^n$, i.e., the subsets of $\mathbb{F}_q^n$ that do not contain too many arithmetic progressions of length three, satisfy that $|A| < c_q^n$ for some $c_q < q$. As a corollary…

Number Theory · Mathematics 2021-02-24 Alexander Fish , Dibyendu Roy

An arc is a subset of $\mathbb F_q^2$ which does not contain any collinear triples. Let $A(q,k)$ denote the number of arcs in $\mathbb F_q^2$ with cardinality $k$. This paper is primarily concerned with estimating the size of $A(q,k)$ when…

Combinatorics · Mathematics 2020-10-13 Oliver Roche-Newton , Audie Warren

We study fixed point biased involutions that avoid a pattern. For every pattern of length three we obtain limit theorems for the asymptotic distribution of the (appropriately centered and scaled) number of fixed points of a random fixed…

Probability · Mathematics 2026-01-01 Jungeun Park , Douglas Rizzolo

We prove that for all squarefree $m$ and any set $A\subset\mathbb{Z}_m$ such that $A-A$ does not contain non-zero squares the bound $|A|\leq m^{1/2}(3n)^{1.5n}$ holds, where $n$ denotes the number of odd prime divisors of $m$.

Number Theory · Mathematics 2016-10-18 Mikhail Gabdullin

In this paper, we derive a tight upper bound for the size of an intersecting $k$-Sperner family of subspaces of the $n$-dimensional vector space $\mathbb{F}_{q}^{n}$ over finite field $\mathbb{F}_{q}$ which gives a $q$-analogue of the…

Combinatorics · Mathematics 2024-05-01 Jiuqiang Liu , Guihai Yu , Lihua Feng , Yongtao Li

Let $F\in\mathbb{C}[x,y,s,t]$ be an irreducible constant-degree polynomial, and let $A,B,C,D\subset\mathbb{C}$ be finite sets of size $n$. We show that $F$ vanishes on at most $O(n^{8/3})$ points of the Cartesian product $A\times B\times…

Combinatorics · Mathematics 2016-11-03 Orit E. Raz , Micha Sharir , Frank de Zeeuw

A $(k,m)$-Furstenberg set is a subset $S \subset \mathbb{F}_q^n$ with the property that each $k$-dimensional subspace of $\mathbb{F}_q^n$ can be translated so that it intersects $S$ in at least $m$ points. Ellenberg and Erman proved that…

Combinatorics · Mathematics 2023-05-05 Manik Dhar , Zeev Dvir , Ben Lund

This article contains a proof of the MDS conjecture for $k \leq 2p-2$. That is, that if $S$ is a set of vectors of ${\mathbb F}_q^k$ in which every subset of $S$ of size $k$ is a basis, where $q=p^h$, $p$ is prime and $q$ is not and $k \leq…

Combinatorics · Mathematics 2012-01-31 Simeon Ball , Jan De Beule