Related papers: Sarnak's conjecture for rank-one subshifts

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…

Based on previous work of the authors, to any $S$-adic development of a subshift $X$ a "directive sequence" of commutative diagrams is associated, which consists at every level $n \geq 0$ of the measure cone and the letter frequency cone of…

Motivated by Sarnak's conjecture on M\"obius orthogonality, we investigate the general problem of orthogonality for a bounded sequence to topological models of characteristic classes of measure-preserving automorphisms. Our main observation…

We consider an analogue of the Kac random walk on the special orthogonal group $SO(N)$, in which at each step a random rotation is performed in a randomly chosen 2-plane of $\bR^N$. We obtain sharp asymptotics for the rate of convergence in…

We study topological mixing properties and the maximal equicontinuous factor of rank-one subshifts as topological dynamical systems. We show that the maximal equicontinuous factor of a rank-one subshift is finite. We also determine all the…

We study partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. These permutations are the linear…

The Katz-Sarnak density conjecture states that the scaling limits of the distributions of zeros of families of automorphic $L$-functions agree with the scaling limits of eigenvalue distributions of classical subgroups of the unitary groups…

This paper studies the inference about linear functionals of high-dimensional low-rank matrices. While most existing inference methods would require consistent estimation of the true rank, our procedure is robust to rank misspecification,…

The 1-2-3 Conjecture, posed in 2004 by Karonski, Luczak, and Thomason, is as follows: "If G is a graph with no connected component having exactly 2 vertices, then the edges of G may be assigned weights from the set {1,2,3} so that, for any…

The constant rank constraint qualification, introduced by Janin in 1984 for nonlinear programming, has been extensively used for sensitivity analysis, global convergence of first- and second-order algorithms, and for computing the…

We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…

We prove the Categorified Wrapping Number Conjecture for large classes of annular links, including alternating annular links and tangle closures exhibiting plumbed link phenomena. We do so by characterizing when a resolution is sufficient…

In this work, we discuss completeness for the lattice orders of first and second order stochastic dominance. The main results state that, both, first and second order stochastic dominance induce Dedekind super complete lattices,…

We propose a single-step non-generational conjecture of all first class constraints,(involving only variables compatible with canonical Poisson brackets), for a realistic gauge singular field theory. We verify our proposal for the free…

'Generalized del Junco-Rudolph's map', a sub-family of generalized Chacon's map (\cite{FER1}), is introduced. A skew product related to the structure of the Generalized del Junco-Rudolph's map is introduced. A Relative Prime Relation,…

We propose modified action which is equivalent to N=1 Green-Schwarz superstring and which allows one to realize the supplementation trick [26]. Fermionic first and second class constraints are covariantly separated, the first class…

We consider the problem of recovering low-rank matrices from random rank-one measurements, which spans numerous applications including covariance sketching, phase retrieval, quantum state tomography, and learning shallow polynomial neural…

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

A common method for deriving non-parametric tests is to reformulate a parametric test in terms of sample ranks. Despite being distribution free (even in finite samples), the resulting tests often display remarkable asymptotic power…

Rudyak's conjecture states that for any degree one map $f:M\to N$ between oriented closed manifolds there is the inequality $\cat (M)\ge \cat(N)$ for the Lusternik-Shnirelmann category. We prove the Rudyak's conjecture for $ n$-dimensional…