Related papers: On the polynomial depth of various sets of random …
In a $d$-dimensional convex body $K$ random points $X_0, \dots, X_d$ are chosen. Their convex hull is a random simplex. The expected volume of a random simplex is monotone under set inclusion, if $K \subset L$ implies that the expected…
We study the number of real roots of a Kostlan random polynomial of degree $d$ in one variable. More generally, we are interested in the distribution of the counting measure of the set of real roots of such a polynomial. We compute the…
A practical measure for the complexity of sequences of symbols (``strings'') is introduced that is rooted in automata theory but avoids the problems of Kolmogorov-Chaitin complexity. This physical complexity can be estimated for ensembles…
We prove that random low-degree polynomials (over $\mathbb{F}_2$) are unbiased, in an extremely general sense. That is, we show that random low-degree polynomials are good randomness extractors for a wide class of distributions. Prior to…
Approximation of the optimal two-part MDL code for given data, through successive monotonically length-decreasing two-part MDL codes, has the following properties: (i) computation of each step may take arbitrarily long; (ii) we may not know…
The main subject of the paper is everywhere complex sequences. An everywhere complex sequence is a sequence that does not contain substrings of Kolmogorov complexity less than $\alpha n-O(1)$ where $n$ is the length of substring and…
We present a complexity measure for any finite time series. This measure has invariance under any monotonic transformation of the time series, has a degree of robustness against noise, and has the adaptability of satisfying almost all the…
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…
The purpose of this note is to revive in $L^p$ spaces the original A. Markov ideas to study monotonicity of zeros of orthogonal polynomials. This allows us to prove and improve in a simple and unified way our previous result [Electron.…
In this note, we study monotone dynamical systems with respect to polyhedral cones. Using the half-space representation and the vertex representation, we propose three equivalent conditions to certify monotonicity of a dynamical system with…
We prove a conjecture of Goncharov, which says that any multiple polylogarithm can be expressed via polylogarithms of depth at most half of the weight. We give an explicit formula for this presentation, involving a summation over trees that…
We show that for any polynomial $f$ from the integers to the integers, with positive leading coefficient and irreducible over the rationals, if $x$ is large enough then there is a string of $(\log x)(\log\log x)^{1/835}$ consecutive…
We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are…
The generalized Kostka polynomials are the Poincare polynomials of isotypic components of certain graded GL(n)-modules. The former satisfy a monotonicity property arising from natural surjections of the corresponding modules. This…
Given arbitrary homogeneous ideals $I$ and $J$ in polynomial rings $A$ and $B$ over a field $k$, we investigate the depth and the Castelnuovo-Mumford regularity of powers of the sum $I+J$ in $A \otimes_k B$ in terms of those of $I$ and $J$.…
We provide a refined characterization of the super-Turing computational power of analog, evolving, and stochastic neural networks based on the Kolmogorov complexity of their real weights, evolving weights, and real probabilities,…
This paper demonstrates a duality between the non-robustness of polynomial time dimension and the existence of one-way functions. Polynomial-time dimension (denoted $\mathrm{cdim}_\mathrm{P}$) quantifies the density of information of…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
Let $(X_t)_{t\ge0}$ denote a non-commutative monotone L\'evy process. Let $\omega=(\omega(t))_{t\ge0}$ denote the corresponding monotone L\'evy noise.. A continuous polynomial of $\omega$ is an element of the corresponding non-commutative…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.