Related papers: True complexity and iterated Cauchy--Schwarz
We show how to extract a monotonic learning algorithm from a classical proof of a geometric statement by interpreting the proof by means of interactive realizability, a realizability sematics for classical logic. The statement is about the…
The arithmetic complexity counts the number of algebraically independent entries in the periodic continued fraction $\theta=[b_1,\dots, b_N, \overline{a_1,\dots,a_k}]$. If $\mathscr{A}_{\theta}$ is a noncommutative torus corresponding to…
In this paper, we consider the so-called "Furstenberg set problem" in high dimensions. First, following Wolff's work on the two dimensional real case, we provide "reasonable" upper bounds for the problem for $\mathbb{R}$ or $\mathbb{F}_p$.…
Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…
We proved the so called complex bounds for multimodal, infinitely renormalizable analytic maps with bounded combinatorics: deep renormalizations have polynomial-like extensions with definite modulus. The complex bounds is the first step to…
We prove a general inequality for more than two sequences mirroring that of the discrete two-sequence Cauchy-Schwarz.
The Chow groups of codimension-p algebraic cycles modulo rational equivalence on a smooth algebraic variety X have steadfastly resisted the efforts of algebraic geometers to fathom their structure. This book explores a "linearization"…
Polylogarithms are those multiple polylogarithms that factor through a certain quotient of the de Rham fundamental group of the thrice punctured line known as the polylogarithmic quotient. Building on work of Dan-Cohen, Wewers, and Brown,…
The necessity of complex numbers in quantum mechanics has long been debated. This paper develops a real Kahler space formulation of quantum mechanics [19], asserting equivalence to the standard complex Hilbert space framework. By mapping…
By Kolmogorov Complexity,two number-theoretic problems are solved in different way than before,one problem is Maxim Kontsevich and Don Bernard Zagier's Problem 3 \emph{Exhibit at least one number which does not belong to} $ \mathcal{P}$…
We study consequences and applications of the folklore statement that every double complex over a field decomposes into so-called squares and zigzags. This result makes questions about the associated cohomology groups and spectral sequences…
We study the computational complexity of a very basic problem, namely that of finding solutions to a very large set of random linear equations in a finite Galois Field modulo q. Using tools from statistical mechanics we are able to identify…
Uniform one-dimensional fragment UF1^= is a formalism obtained from first-order logic by limiting quantification to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in the quantified…
Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been…
Multiway data analysis aims to uncover patterns in data structured as multi-indexed arrays, with multiway covariance playing a crucial role in many applications. However, the high dimensionality of multiway covariance presents significant…
We prove new lower and upper bounds on the higher gonalities of finite graphs. These bounds are generalizations of known upper and lower bounds for first gonality to higher gonalities, including upper bounds on gonality involving…
Some representation-theoretic multiplicities, such as the Kostka and the Littlewood-Richardson coefficients, admit a combinatorial interpretation that places their computation in the complexity class #P. Whether this holds more generally is…
We prove under the Bombieri-Lang conjecture for surfaces that there is an absolute bound on the length of sequences of integer squares with constant second differences, for sequences which are not formed by the squares of integers in…
We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…
The Welschinger numbers, a kind of a real analog of the Gromov-Witten numbers which count the complex rational curves through a given generic collection of points, bound from below the number of real rational curves for any real generic…