Related papers: Low Complexity Subshifts have Discrete Spectrum

We prove the relative index conjecture, which in turn implies that the set of embeddable deformations of a strictly pseudoconvex CR-structure on a compact 3-manifold is closed in the C\infty-topology.

The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P or is NP-complete (Feder-Vardi, 1993). It has been verified for conservative problems (also known as list homomorphism problems) by A.…

There is a long standing conjecture that there are at least $n$ closed characteristics for any compact convex hypersurface $\Sigma$ in $\mathbb{R}^{2n}$, and the symmetric case, i.e. $\Sigma=-\Sigma$, has already been proved by C. Liu, Y.…

We present a streamlined proof of a result essentially present in previous work of the author, namely that for every set $S = \{s_1, s_2, \ldots\} \subset \mathbb{N}$ of zero Banach density and finite set $A$, there exists a minimal…

We prove several cases of Zimmer's conjecture for actions of higher-rank cocompact lattices on low dimensional manifolds. For example, if $\Gamma$ is a cocompact lattice in $\mathrm{Sl}(n, \mathbb R)$, $M$ is a compact manifold, and…

Special scattered subwords, in which the gaps are of length from a given set, are defined. The scattered subword complexity, which is the number of such scattered subwords, is computed for rainbow words.

Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

In this paper we show a characterization of the joint spectral radius of a set of matrices as the limit of the $p$-radius of an associated probability distribution when $p$ tends to $\infty$. Allowing the set to have infinitely many…

The idea that many important classes of signals can be well-represented by linear combinations of a small set of atoms selected from a given dictionary has had dramatic impact on the theory and practice of signal processing. For practical…

We characterize the minimum-length sequences of independent lazy simple transpositions whose composition is a uniformly random permutation. For every reduced word of the reverse permutation there is exactly one valid way to assign…

We introduce a class of rank-one transformations, which we call extremely elevated staircase transformations. We prove that they are measure-theoretically mixing and, for any $f : \mathbb{N} \to \mathbb{N}$ with $f(n)/n$ increasing and…

The subword complexity of a finite word $w$ of length $N$ is a function which associates to each $n\le N$ the number of all distinct subwords of $w$ having the length $n$. We define the \emph{maximal complexity} C(w) as the maximum of the…

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

Lipschitz constants of neural networks allow for guarantees of robustness in image classification, safety in controller design, and generalizability beyond the training data. As calculating Lipschitz constants is NP-hard, techniques for…

Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…

The discrete spectrum of complex banded matrices which are compact perturbations of the standard banded matrix of order $p$ is under consideration. The rate of stabilization for the matrix entries sharp in the sense of order which provides…

From the output produced by a memoryless deletion channel from a uniformly random input of known length $n$, one obtains a posterior distribution on the channel input. The difference between the Shannon entropy of this distribution and that…

We show that the de Rham Hilbert complex with mixed boundary conditions on bounded strong Lipschitz domains is closed and compact. The crucial results are compact embeddings which follow by abstract arguments using functional analysis…

We establish vanishing results for limits of characters in various discrete groups, most notably irreducible lattices in higher rank semisimple Lie groups. As an application, we show that any sequence of finite-dimensional representations…