Related papers: Measure-Theoretically Mixing Subshifts with Low Co…
We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…
Freire, Lopes and Mane proved that for any rational map f there exists a natural invariant measure \mu_f [5]. Mane showed there exists an n>0 such that (f^n, \mu_f) is measurably conjugate to the one-sided $d^n$-shift, with Bernoulli…
We slightly extend the convex integration via staircase laminate toolbox recently developed by Kleiner, M\"uller, Sz\'{e}kelyhidi, and Xie. As an example we revisit the proof by Astala-Faraco-Sz\'{e}kelyhidi on optimal Meyers' regularity…
In this paper, we prove a criterion for existence of continuous non constant eigenfunctions for interval exchange transformations, that is for non topologically weak mixing. We first construct, for any m>3, uniquely ergodic interval…
We initiate a program of parameterized proof complexity that aims to provide evidence that FPT is different from W[1]. A similar program already exists for the classes W[2] and W[SAT]. We contrast these programs and prove upper and lower…
We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…
We present the Fast Newton Transform (FNT), an algorithm for performing $m$-variate Newton interpolation in downward closed polynomial spaces with time complexity $\mathcal{O}(|A|m\overline{n})$. Here, $A$ is a downward closed set of…
The paper deals with continuous and compact mappings generated by the Fourier transform between distinguished function spaces on $\mathbb{R}^n$. The degree of compactness will be measured in terms of related entropy numbers. We are more…
We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in $\mathbb{Q}$-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to…
We construct a rank one infinite measure preserving transformation $T$ such that for all sequences of nonzero integers $\{k_{1},..., k_{r}\}$, $T^{k_{1}}\times...\times T^{k_{r}}$ is ergodic.
We find the two-variables generating function for the statistic which counts the number of variations in a word bounded by $1$. Thus, we refine and extend previous results concerning staircase words, which are words in which the variation…
In recent years, saliency ranking has emerged as a challenging task focusing on assessing the degree of saliency at instance-level. Being subjective, even humans struggle to identify the precise order of all salient instances. Previous…
We introduce a new hierarchy over monotone set functions, that we refer to as $\mathcal{MPH}$ (Maximum over Positive Hypergraphs). Levels of the hierarchy correspond to the degree of complementarity in a given function. The highest level of…
We consider the problem of inverting the transformation which consists in replacing a word by the sequence of its blocks of length N, i.e. its so-called N-block presentation. It was previously shown that among all the possible preimages of…
We construct, over some minimal translations of the two torus, special flows under a differentiable ceiling function that combine the properties of mixing and rank one.
We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either $\Theta(n^{1+1/k})$ for some $k\in\mathbb N$, or is $O(n \log n)$.
Let M be a random (alpha n) x n matrix of rank r<<n, and assume that a uniformly random subset E of its entries is observed. We describe an efficient algorithm that reconstructs M from |E| = O(rn) observed entries with relative root mean…
Many natural optimization problems derived from $\sf NP$ admit bilevel and multilevel extensions in which decisions are made sequentially by multiple players with conflicting objectives, as in interdiction, adversarial selection, and…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…
Let $E\subset\rr$ be a closed set of Hausdorff dimension $\alpha$. We prove that if $\alpha$ is sufficiently close to 1, and if $E$ supports a probabilistic measure obeying appropriate dimensionality and Fourier decay conditions, then $E$…