Related papers: True complexity of polynomial progressions in fini…
We establish a number of "concatenation theorems" that assert, roughly speaking, that if a function exhibits "polynomial" (or "Gowers anti-uniform", "uniformly almost periodic", or "nilsequence") behaviour in two different directions…
Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…
One of the central problems in additive combinatorics is to determine how large a subset of the first $N$ integers can be before it is forced to contain $k$ elements forming an arithmetic progression. Around 25 years ago, Gowers proved the…
Consider any nonzero univariate polynomial with rational coefficients, presented as an elementary algebraic expression (using only integer exponents). Letting sigma(f) denotes the additive complexity of f, we show that the number of…
Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
It is known that the weight (that is, the number of nonzero coefficients) of a univariate polynomial over a field of characteristic zero is larger than the multiplicity of any of its nonzero roots. We extend this result to an appropriate…
There is a natural relationship between Jones polynomials and quantum computation. We use this relationship to show that the complexity of evaluating relative-error approximations of Jones polynomials can be used to bound the classical…
The degree of a polynomial representing (or approximating) a function f is a lower bound for the number of quantum queries needed to compute f. This observation has been a source of many lower bounds on quantum algorithms. It has been an…
The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…
We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of…
We study the arithmetic (geometric) progressions in the $x$-coordinates of quadratic points on smooth projective planar curves defined over a number field $k$. Unless the curve is hyperelliptic, we prove that these progressions must be…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…
We prove a version of Tao's algebraic regularity lemma for asymptotic classes in the context of graphons. We apply it to study expander difference polynomials over fields with powers of Frobenius.
In order to make a case for or against a trend in the evolution of complexity in biological evolution, complexity needs to be both rigorously defined and measurable. A recent information-theoretic (but intuitively evident) definition…
Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-\kappa}$ and $r$ an arbitrarily fixed positive integer. Assuming $\kappa=\kappa(r)>0$ and $p$ large enough, it is shown that any proportional subset…
Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…
A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…
We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…