Related papers: Sarnak's conjecture for rank-one subshifts
While Random Matrix Theory has successfully modeled many quantities of families of L-functions, it frequently cannot see the family's arithmetic. In some situations this requires an extended theory that inserts arithmetic factors depending…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
We prove a conjecture of Kleinbock which gives a clear-cut classification of all extremal affine subspaces of $\mathbb{R}^n$. We also give an essentially complete classification of all Khintchine type affine subspaces, except for some…
The Scott rank of a countable structure is a measure, coming from the proof of Scott's isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of $\mathcal{L}_{\omega_1 \omega}$)…
In this paper we show error bounds for randomly subsampled rank-1 lattices. We pay particular attention to the ratio of the size of the subset to the size of the initial lattice, which is decisive for the computational complexity. In the…
We consider topological groupoids in finite and also in a compact settings. In the initial sections, we introduce definitions of typical observables and we studied them in the context of statistical mechanics and quantum mechanics. We…
The class of normal subshifts includes irreducible infinite topological Markov shifts, irreducible infinite sofic shifts, synchronized systems, Dyck shifts, $\beta$-shifts, substitution minimal shifts, and so on. We will characterize…
We introduce a new tool to study the spectral type of rank one transformations using the method of central limit theorem for trigonometric sums. We get some new applications.
We study the Hausdorff dimension of self-similar sets and measures on the line. We show that if the dimension is smaller than the minimum of 1 and the similarity dimension, then at small scales there are super-exponentially close cylinders.…
A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…
We investigate the notion of a semi-retraction between two first order structures (in typically different signatures) that was introduced by the second author as a link between the Ramsey property and generalized indiscernible sequences. We…
Spaces of quasi-invariant measures supplied with different topologies are studied. Their embeddings, projective decompositions, conditions for their metrizability are investigated. Theorems about convergence of nets of quasi-invariant…
Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…
We extend the Razumov-Stroganov conjecture relating the groundstate of the O(1) spin chain to alternating sign matrices, by relating the groundstate of the monodromy matrix of the O(1) model to the so-called refined alternating sign…
We define an infinite graded graph of ordered pairs and a~canonical action of the group $\mathbb{Z}$ (the adic action) and of the infinite sum of groups of order two~$\mathcal{D}=\sum_1^{\infty} \mathbb{Z}/2\mathbb{Z}$ on the path space of…
We study the sequence entropy of rank one measure-preserving systems along subexponential sequences. We prove that the sequence entropy along a large class of sequences can be infinite using Ornstein's probabilistic constructions. Moreover,…
An infinite real sequence $\{a_n\}$ is called an invariant sequence of the first (resp., second) kind if $a_n=\sum_{k=0}^n {n \choose k} (-1)^k a_k$ (resp., $a_n=\sum_{k=n}^{\infty} {k \choose n} (-1)^k a_k$). We review and investigate…
We prove a rank-one theorem \`a la G. Alberti for the derivatives of vector-valued maps with bounded variation in a class of Carnot groups that includes Heisenberg groups $\mathbb H^n$ for $n\geq 2$. The main tools are properties relating…
Shape constrained densities are encountered in many nonparametric estimation problems. The classes of monotone or convex (and monotone) densities can be viewed as special cases of the classes of k-monotone densities. A density g is said to…
For a given finite graph $G$ of minimum degree at least $k$, let $G_{p}$ be a random subgraph of $G$ obtained by taking each edge independently with probability $p$. We prove that (i) if $p \ge \omega/k$ for a function $\omega=\omega(k)$…