Related papers: Measure-Theoretically Mixing Subshifts with Low Co…
In this article, we study countable sofic shifts of Cantor-Bendixson rank at most 2. We prove that their conjugacy problem is complete for GI, the complexity class of graph isomorphism, and that the existence problems of block maps, factor…
The height of a piecewise-testable language $L$ is the maximum length of the words needed to define $L$ by excluding and requiring given subwords. The height of $L$ is an important descriptive complexity measure that has not yet been…
This paper continues the investigation of staircases in the family of Hirzebruch surfaces formed by blowing up the projective plane with weight b, that was started in Bertozzi, Holm et al. in arXiv:2010.08567. We explain the symmetries…
We study the parametrized complexity of fundamental relations between multidimensional subshifts, such as equality, conjugacy, inclusion, and embedding, for subshifts of finite type (SFTs) and effective subshifts. We build on previous work…
We study non-trivial translation-invariant probability measures on the space of entire functions of one complex variable. The existence (and even an abundance) of such measures was proven by Benjamin Weiss. Answering Weiss question, we find…
The degree of mixing is a fundamental property of a dynamical system. General multi-dimensional shifts cannot be systematically determined. This work introduces constructive and systematic methods for verifying the degree of mixing, from…
This paper considers two commuting smooth transformations on a Banach space, and proves the sub-additivity of the measure theoretic entropies under mild conditions. Furthermore, some additional conditions are given for the equality of the…
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
Sampling permutations from S_n is a fundamental problem from probability theory. The nearest neighbor transposition chain \cal{M}}_{nn} is known to converge in time \Theta(n^3 \log n) in the uniform case and time \Theta(n^2) in the constant…
We study the difficulty of computing topological entropy of subshifts subjected to mixing restrictions. This problem is well-studied for multidimensional subshifts of finite type : there exists a threshold in the irreducibility rate where…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…
The reconstruction of high-dimensional sparse signals is a challenging task in a wide range of applications. In order to deal with high-dimensional problems, efficient sparse fast Fourier transform algorithms are essential tools. The second…
Lifted inference reduces the complexity of inference in relational probabilistic models by identifying groups of constants (or atoms) which behave symmetric to each other. A number of techniques have been proposed in the literature for…
In this note we give simple examples of a one-dimensional mixing subshift with positive topological entropy which have two distinct measures of maximal entropy. We also give examples of subshifts which have two mutually singular equilibrium…
Using techniques developed in \cite{KLR}, we verify Sarnak's conjecture for two classes of rank-one subshifts with unbounded cutting parameters. The first class of rank-one subshifts we consider are called {\em almost complete congruency…
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…
Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory,…
In the simplest compactification, we discuss the intermediate unification in M-theory on $S^1/Z_2$, and point out that we can push the eleven dimension Planck scale to the TeV range if the gauge coupling in the hidden sector is super weak,…