English
Related papers

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

200 papers

Let $P_k$ be the subgroup generated by $k$th powers of primitive elements in $F_r$, the free group of rank $r$. We show that $F_2/P_k$ is finite if and only if $k$ is $1$, $2$, or $3$. We also fully characterize $F_2/P_k$ for $k = 2,3,4$.…

Group Theory · Mathematics 2021-01-06 Khalid Bou-Rabee , W. Patrick Hooper

Let $p$ denote the characteristic of ${\mathbb F}_q$, the finite field with $q$ elements. We prove that if $q$ is odd then an arc of size $q+2-t$ in the projective plane over ${\mathbb F}_q$, which is not contained in a conic, is contained…

Combinatorics · Mathematics 2018-04-05 Simeon Ball , Michel Lavrauw

We study a subset of permutations, where entries are restricted to having the same remainder as the index, modulo some integer $k \geq 2$. We show that when also imposing the classical 132- or 213-avoidance restriction on the permutations,…

Combinatorics · Mathematics 2023-10-04 Per Alexandersson , Samuel Asefa Fufa , Frether Getachew , Dun Qiu

We consider problems where the input is a set of points in the plane and an integer $k$, and the task is to find a subset $S$ of the input points of size $k$ such that $S$ satisfies some property. We focus on properties that depend only on…

Computational Geometry · Computer Science 2018-08-08 David Eppstein , Daniel Lokshtanov

We completely classify the asymptotic behavior of the number of alternating sign matrices classically avoiding a single permutation pattern, in the sense of [Johansson and Linusson 2007]. In particular, we give a uniform proof of an…

Combinatorics · Mathematics 2025-09-15 Mathilde Bouvel , Eric S. Egge , Rebecca N. Smith , Jessica Striker , Justin M. Troyka

We prove that for any fixed $n$, and for most permutation patterns $q$, the number $\textup{Av}_{n,\ell}(q)$ of $q$-avoiding permutations of length $n$ that consist of $\ell$ skew blocks is a monotone decreasing function of $\ell$. We then…

Combinatorics · Mathematics 2019-06-04 Miklós Bóna

Let $a_{i1}x_1+\cdots+a_{ik}x_k=0$, $i\in[m]$ be a balanced homogeneous system of linear equations with coefficients $a_{ij}$ from a finite field $\mathbb{F}_q$. We say that a solution $x=(x_1,\ldots, x_k)$ with $x_1,\ldots, x_k\in…

Combinatorics · Mathematics 2023-12-19 Dion Gijswijt

Let $F_1,\dotsc,F_R$ be quadratic forms with integer coefficients in $n$ variables. When $n\geq 9R$ and the variety $V(F_1,\dotsc,F_R)$ is a smooth complete intersection, we prove an asymptotic formula for the number of integer points in an…

Number Theory · Mathematics 2022-06-22 Simon L. Rydin Myerson

Let $K$ be a compact convex set in $\mathbb{R}^2$ and let $\mathcal{F}_1, \mathcal{F}_2, \mathcal{F}_3$ be finite families of translates of $K$ such that $A \cap B \neq \emptyset$ for every $A \in \mathcal{F}_i$ and $B \in \mathcal{F}_j$…

Combinatorics · Mathematics 2023-06-21 Cuauhtemoc Gomez-Navarro , Edgardo Roldán-Pensado

Permutations avoiding all patterns of a given shape (in the sense of Robinson-Schensted-Knuth) are considered. We show that the shapes of all such permutations are contained in a suitable thick hook, and deduce an exponential growth rate…

Combinatorics · Mathematics 2007-05-23 Ron M. Adin , Yuval Roichman

The aim of this paper is to prove that if a planar set $A$ has a difference set $\Delta(A)$ satisfying $\Delta(A)\subset \Z^++s$ for suitable $s$ than $A$ has at most 3 elements. This result is motivated by the conjecture that the disk has…

Classical Analysis and ODEs · Mathematics 2009-09-02 Alex Iosevich , Philippe Jaming

Recently, B\'ona and Smith defined strong pattern avoidance, saying that a permutation $\pi$ strongly avoids a pattern $\tau$ if $\pi$ and $\pi^2$ both avoid $\tau$. They conjectured that for every positive integer $k$, there is a…

Combinatorics · Mathematics 2020-06-02 Amanda Burcroff , Colin Defant

Let $(x(t),y(t))^\top$ be a solution of a Fuchsian system of order two with three singular points. The vector space of functions of the form $P(t)x(t)+Q(t)y(t)$, where $P,Q$ are real polynomials, has a natural filtration of vector spaces,…

Dynamical Systems · Mathematics 2008-05-31 Lubomir Gavrilov , Iliya D. Iliev

Consider a system of $m$ balanced linear equations in $k$ variables with coefficients in $\mathbb{F}_q$. If $k \geq 2m + 1$, then a routine application of the slice rank method shows that there are constants $\beta,\gamma \geq 1$ with…

Combinatorics · Mathematics 2023-09-25 Josse van Dobben de Bruyn , Dion Gijswijt

Suppose $c_1,\ldots,c_{n+k}$ are real numbers, $\{a_1,\ldots,a_{n+k}\}\!\subset\!\mathbb{R}^n$ is a set of points not all lying in the same affine hyperplane, $y\!\in\!\mathbb{R}^n$, $a_j\cdot y$ denotes the standard real inner product of…

Algebraic Geometry · Mathematics 2017-10-31 Jens Forsgård , Mounir Nisse , J. Maurice Rojas

Suppose that f : F_p^n -> [0,1] has expected value t in [p^(-n/9),1] (so, the density t can be quite low!). Furthermore, suppose that support(f) has no three-term arithmetic progressions. Then, we develop non-trivial lower bounds for f_j,…

Combinatorics · Mathematics 2007-07-11 Ernie Croot

Let us fix a prime $p$ and a homogeneous system of $m$ linear equations $a_{j,1}x_1+\dots+a_{j,k}x_k=0$ for $j=1,\dots,m$ with coefficients $a_{j,i}\in\mathbb{F}_p$. Suppose that $k\geq 3m$, that $a_{j,1}+\dots+a_{j,k}=0$ for $j=1,\dots,m$…

Combinatorics · Mathematics 2021-05-17 Lisa Sauermann

For any finite field k of characteristic exceeding 3, the Hasse principle and weak approximation is established for non-singular cubic hypersurfaces X over the function field k(t), provided that X has dimension at least 6.

Number Theory · Mathematics 2015-04-06 Tim Browning , Pankaj Vishe

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

Combinatorics · Mathematics 2024-01-24 Christian Elsholtz , Laura Proske , Lisa Sauermann

We obtain upper and lower bounds for running times of exponential time algorithms for the detection of weak backdoor sets of 3CNF formulas, considering various base classes. These results include (omitting polynomial factors), (i) a 4.54^k…

Data Structures and Algorithms · Computer Science 2013-07-16 Neeldhara Misra , Sebastian Ordyniak , Venkatesh Raman , Stefan Szeider