Related papers: On the polynomial depth of various sets of random …

We obtain polylogarithmic bounds in the polynomial Szemer\'{e}di theorem when the polynomials have distinct degrees and zero constant terms. Specifically, let $P_1, \dots, P_m \in \mathbb Z[y]$ be polynomials with distinct degrees, each…

The word "complexity" is most often used as a meta--linguistic expression referring to certain intuitive characteristics of a natural system and/or its scientific description. These characteristics may include: sheer amount of data that…

The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…

The ratio monotonicity of a polynomial is a stronger property than log-concavity. Let P(x) be a polynomial with nonnegative and nondecreasing coefficients. We prove the ratio monotone property of P(x+1), which leads to the log-concavity of…

We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a $p$-isomorphism-invariant condition satisfied by all paddable…

While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between an individual data sample and an individual model summarizing…

We study the possible growth rates of the Kolmogorov complexity of initial segments of sequences that are random with respect to some computable measure on $2^\omega$, the so-called proper sequences. Our main results are as follows: (1) We…

We argue that apart from the standard closed and open strings one may consider a third possibility that we call monodromic strings. The monodromic string propagating on a target looks like an ordinary open string (a mapping from a segment…

Any positive word comprised of random sequence of tokens form a finite alphabet can be reduced (without change of length) using an appropriate size Braid group relationships. Surprisingly the Braid relations dramatically reduce the…

Assume that for some $\alpha<1$ and for all nutural $n$ a set $F_n$ of at most $2^{\alpha n}$ "forbidden" binary strings of length $n$ is fixed. Then there exists an infinite binary sequence $\omega$ that does not have (long) forbidden…

There is a parallelism between Shannon information theory and algorithmic information theory. In particular, the same linear inequalities are true for Shannon entropies of tuples of random variables and Kolmogorov complexities of tuples of…

Motivated by a problem in complex dynamics, we examine the block structure of the natural action of monodromy groups on the tree of preimages of a generic point. We show that in many cases, including when the polynomial has prime power…

In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Martin-Loef randomness and computable randomness. The latter…

A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the theory of individual random sequences. This constructive…

Volume polynomials form a distinguished class of log-concave polynomials with remarkable analytic and combinatorial properties. I will survey realization problems related to them, review fundamental inequalities they satisfy, and discuss…

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

This paper uses inspiration from Integral Geometry to connect Tame Geometry with Nonstandard Analysis. We omit binomial coefficients from the Steiner polynomial to define the \textit{intrinsic volume polynomial} $\Phi$, a valuation defined…

The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…

It has been shown by Ibragimov and Zaporozhets [In Prokhorov and Contemporary Probability Theory (2013) Springer] that the complex roots of a random polynomial $G_n(z)=\sum_{k=0}^n\xi_kz^k$ with i.i.d. coefficients $\xi_0,\ldots,\xi_n$…

For classical dynamical systems, the polynomial entropy serves as a refined invariant of the topological entropy. In the setting of categorical dynamical systems, that is, triangulated categories endowed with an endofunctor, we develop the…