Related papers: Computations on Sofic S-gap Shifts

In this paper, we study the arithmetic zeta function $$\mathscr{Z}_{\mathcal{X}}(s) = \prod_p \prod_{\substack{x \in \mathcal{X}_p \\ \text{closed}}} \Big( \frac{1}{1-|\kappa(x)|^{-s}} \Big)^{\mathfrak{m}_{p}(x)}$$ associated to a scheme…

Let $G$ be a sofic group, and let $\Sigma = (\sigma_n)_{n\geq 1}$ be a sofic approximation to it. For a probability-preserving $G$-system, a variant of the sofic entropy relative to $\Sigma$ has recently been defined in terms of sequences…

We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise…

We consider space functions $s(n)$ of finitely presented groups $G =< A\mid R> .$ (These functions have a natural geometric analog.) To define $s(n)$ we start with a word $w$ over $A$ of length at most $n$ equal to 1 in $G$ and use…

A key fact in the theory of Boolean functions $f : \{0,1\}^n \to \{0,1\}$ is that they often undergo sharp thresholds. For example: if the function $f : \{0,1\}^n \to \{0,1\}$ is monotone and symmetric under a transitive action with…

We classify certain sofic shifts (the irreducible Point Extension Type, or PET, sofic shifts) up to flow equivalence, using invariants of the canonical Fischer cover. There are two main ingredients: (1) An extension theorem, for extending…

Sofic groups were defined implicitly by Gromov in [Gr99] and explicitly by Weiss in [We00]. All residually finite groups (and hence every linear group) is sofic. The purpose of this paper is to introduce, for every countable sofic group…

The Fischer, Krieger, and fiber product covers of sofic beta-shifts are constructed and used to show that every strictly sofic beta-shift is $2$-sofic. Flow invariants based on the covers are computed, and shown to only depend on an single…

We study dynamical and computational properties of the set of bi-infinite self-avoiding walks on Cayley graphs, as well as ways to compute, approximate and bound their connective constant. To do this, we introduce the skeleton $X_{G,S}$ of…

Building on the recent work of Johnson (2007) and Yu (2008), we prove that entropy is a concave function with respect to the thinning operation T_a. That is, if X and Y are independent random variables on Z_+ with ultra-log-concave…

Let A be a finite alphabet and f: A^* --> A^* be a morphism with an iterative fixed point f^\omega(\alpha), where \alpha{} is in A. Consider the subshift (X, T), where X is the shift orbit closure of f^\omega(\alpha) and T: X --> X is the…

Sofic entropy is an invariant for probability-preserving actions of sofic groups. It was introduced a few years ago by Lewis Bowen, and shown to extend the classical Kolmogorov-Sinai entropy from the setting of amenable groups. Some parts…

We investigate the computability (in the sense of computable analysis) of the topological pressure $P_{\rm top}(\phi)$ on compact shift spaces $X$ for continuous potentials $\phi:X\to {\mathbb R}$. This question has recently been studied…

In this expository paper we describe an unifying approach for many known entropies in Mathematics. First we recall the notion of semigroup entropy h_S in the category S of normed semigroups and contractive homomorphisms, recalling also its…

Let $G$ be a countable discrete sofic group. We define a concept of uniform mixing for measure-preserving $G$-actions and show that it implies completely positive sofic entropy. When $G$ contains an element of infinite order, we use this to…

We report on some properties of the $\xi(s)$ function and its value on the critical line, $\Xi(t)=\xi\left(\tfrac{1}{2}+it\right)$. First, we present some identities that hold for the log derivatives of a holomorphic function. We then…

We prove that if a free ergodic action of a countably infinite group has positive Rokhlin entropy (or, less generally, positive sofic entropy) then it factors onto all Bernoulli shifts of lesser or equal entropy. This extends to all…

Given a factor code between sofic shifts X and Y, there is a family of decompositions of the original code into factor codes such that the entropies of the intermediate subshifts arising from the decompositions are dense in the interval…

An information theoretic approach to bounds in superconformal field theories is proposed. It is proved that the supersymmetric R\'enyi entropy $\bar S_\alpha$ is a monotonically decreasing function of $\alpha$ and $(\alpha-1)\bar S_\alpha$…

We introduce the class of strongly sofic monoids. This class of monoids strictly contains the class of sofic groups and is a proper subclass of the class of sofic monoids. We define and investigate sofic topological entropy for actions of…