English
Related papers

Related papers: Finding linear patterns of complexity one

200 papers

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

Discrete Mathematics · Computer Science 2016-05-20 Jarkko Kari , Michal Szabados

We introduce a nonparametric way to estimate the global probability density function for a random persistence diagram. Precisely, a kernel density function centered at a given persistence diagram and a given bandwidth is constructed. Our…

Statistics Theory · Mathematics 2018-03-14 Joshua Lee Mike , Vasileios Maroulas

This paper considers some different measures for how additively structured a convex set can be. The main result gives a construction of a convex set $A$ containing $\Omega(|A|^{3/2})$ three-term arithmetic progressions.

Combinatorics · Mathematics 2025-09-03 Thomas F. Bloom , Jakob Führer , Oliver Roche-Newton

The pattern avoidance problem seeks to construct a set $X\subset \mathbb{R}^d$ with large dimension that avoids a prescribed pattern. Examples of such patterns include three-term arithmetic progressions (solutions to $x_1 - 2x_2 + x_3 =…

Classical Analysis and ODEs · Mathematics 2019-04-05 Jacob Denson , Malabika Pramanik , Joshua Zahl

Let H stand for the set of homeomorphisms on [0,1]. We prove the following dichotomy for Borel subsets A of [0,1]: either there exists a homeomorphism f in H such that the image f(A) contains no 3-term arithmetic progressions; or, for every…

Dynamical Systems · Mathematics 2013-03-20 Michael Boshernitzan , Jon Chaika

Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of…

Number Theory · Mathematics 2020-02-26 Lukas Spiegelhofer , Thomas Stoll

We consider sets of positive integers containing no sum of two elements in the set and also no product of two elements. We show that the upper density of such a set is strictly smaller than 1/2 and that this is best possible. Further, we…

Number Theory · Mathematics 2013-09-10 Par Kurlberg , Jeffrey C. Lagarias , Carl Pomerance

Non-trivial extensions of the three dimensional Poincar\'e algebra, beyond the supersymmetric one, are explicitly constructed. These algebraic structures are the natural three dimensional generalizations of fractional supersymmetry of order…

High Energy Physics - Theory · Physics 2008-11-26 M. Rausch de Traubenberg , M. J. Slupinski

We describe a general formalism based on the partial-wave decomposition to compute the iterative $s$-channel discontinuity of four-point amplitudes at any loop order. As an application, we focus on the low-energy expansions of type I and II…

High Energy Physics - Theory · Physics 2024-11-25 Yu-tin Huang , Hynek Paul , Michele Santagata

For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…

Number Theory · Mathematics 2020-05-19 Arne Winterhof , Zibi Xiao

Let A be any set of positive integers and n a positive integer. A composition of n with parts in A is an ordered collection of one or more elements in A whose sum is n. We derive generating functions for the number of compositions of n with…

Combinatorics · Mathematics 2007-05-23 S. Heubach , T. Mansour

Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in fact any subset of the primes of relative density tending to…

Number Theory · Mathematics 2019-06-14 Luka Rimanic , Julia Wolf

The real cohomology of the space of imbeddings of S^1 into R^n, n>3, is studied by using configuration space integrals. Nontrivial classes are explicitly constructed. As a by-product, we prove the nontriviality of certain cycles of…

Geometric Topology · Mathematics 2014-10-01 Alberto S. Cattaneo , Paolo Cotta-Ramusino , Riccardo Longoni

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen

Suppose that $d \geq 2$, and that $A \subset [0,1]$ has sufficiently large dimension, $1 - \epsilon_d < \dim_H(A) < 1$. Then for any polynomial $P$ of degree $d$ with no constant term, there exists a point configuration $\{ x, x-t,x-P(t) \}…

Classical Analysis and ODEs · Mathematics 2019-05-21 Ben Krause

Green used an arithmetic analogue of Szemer\'edi's celebrated regularity lemma to prove the following strengthening of Roth's theorem in vector spaces. For every $\alpha>0$, $\beta<\alpha^3$, and prime number $p$, there is a least positive…

Combinatorics · Mathematics 2019-11-22 Jacob Fox , Huy Tuan Pham

We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…

Logic in Computer Science · Computer Science 2013-08-14 Carlo A. Furia

Van der Waerden's classical theorem on arithmetic progressions states that for any positive integers k and r, there exists a least positive integer, w(k,r), such that any r-coloring of {1,2,...,w(k,r)} must contain a monochromatic k-term…

Combinatorics · Mathematics 2007-05-23 Bruce Landman , Aaron Robertson

The present paper considers extremal combinatorics questions in the language of matrices. An $s$-matrix is a matrix with entries in $\{0,1,\ldots, s-1\}$. An $s$-matrix is simple if it has no repeated columns. A matrix $F$ is a…

Combinatorics · Mathematics 2025-02-10 Wallace Peaslee , Attila Sali , Jun Yan

We study the realizability of simplicial complexes with a given pair of integer sequences, representing the node degree distribution and the facet size distribution, respectively. While the $s$-uniform variant of the problem is…

Social and Information Networks · Computer Science 2021-10-29 Tzu-Chi Yen