Related papers: A refinement of Cauchy-Schwarz complexity

We prove a polynomial bound in the "true complexity" problem of Gowers and Wolf. The proof uses only repeated applications of the Cauchy--Schwarz inequality, answering negatively a question posed by Gowers and Wolf. To choose and reason…

Let $\Phi = (\phi_1,\dots,\phi_6)$ be a system of $6$ linear forms in $3$ variables, i.e. $\phi_i \colon \mathbb{Z}^3 \to \mathbb{Z}$ for each $i$. Suppose also that $\Phi$ has Cauchy--Schwarz complexity $2$ and true complexity $1$, in the…

The true complexity of a polynomial progression in finite fields corresponds to the smallest-degree Gowers norm that controls the counting operator of the progression over finite fields of large characteristic. We give a conjecture that…

We study a system of equations on a compact complex manifold, that couples the scalar curvature of a Kaehler metric with a spectral function of a first-order deformation of the complex structure. The system comes from an…

In [GW09a] we conjectured that uniformity of degree $k-1$ is sufficient to control an average over a family of linear forms if and only if the $k$th powers of these linear forms are linearly independent. In this paper we prove this…

We consider the Cauchy problem for homogeneous linear $q$-difference-differential equations with constant coefficients. We characterise convergent, $k$-summable and multisummable formal power series solutions in terms of analytic…

In this paper, we investigate generalizations of the Mahler-Popkens complexity of integers. Specifically, we generalize to $k$-th roots of unity, polynomials over the naturals, and the integers mod $m$. In cyclotomic rings, we establish…

We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…

We prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…

In 2002, Kamae and Zamboni introduced maximal pattern complexity and determined that any aperiodic sequence must have maximal pattern complexity at least $2k$. In 2006, Kamae and Rao examined the maximal pattern complexity of sequences over…

We point out to a connection between a problem of invariance of power series families of probability distributions under binomial thinning and functional equations which generalize both the Cauchy and an additive form of the…

We consider a solution to a parametric family of the Cauchy problems for $m$th-order linear differential equations with constant coefficients. Parameters of the family are the coefficients of the differential equation and the initial values…

The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…

The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods. In this paper, we consider polynomial systems that are…

S\'ark\"ozy proved that dense sets of integers contain two elements differing by a $k$th power. The bounds in quantitative versions of this theorem are rather weak compared to what is expected. We prove a version of S\'ark\"ozy's theorem…

The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…

We introduce complex singularity exponents of plurisubharmonic functions and prove a general semi-continuity result for them. This concept contains as a special case several similar concepts which have been considered e.g. by Arnold and…

In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

It is well-known that if a subset A of a finite Abelian group G satisfies a quasirandomness property called uniformity of degree k, then it contains roughly the expected number of arithmetic progressions of length k, that is, the number of…