Related papers: Finitary codings for the random-cluster model and …
For a subshift $(X, \sigma_X)$ and a subadditive sequence $\mathcal{F}=\{\log f_n\}_{n=1}^{\infty}$ on $X$, we study equivalent conditions for the existence of $h\in C(X)$ such that $\lim_{n\rightarrow\infty}(1/{n})\int \log f_n d \mu=\int…
Given a weakly almost additive sequence of continuous functions with bounded variation $\mathcal{F}=\{\log f_n\}_{n=1}^{\infty}$ on a subshift $X$ over finitely many symbols, we study properties of a function $f$ on $X$ such that…
We prove sharpness of the phase transition for the random-cluster model with $q \geq 1$ on graphs of the form $\mathcal{S} := \mathcal{G} \times S$, where $\mathcal{G}$ is a planar lattice with mild symmetry assumptions, and $S$ a finite…
We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…
This paper is centered on covariant dynamics on unimodular random graphs and random networks, namely maps from the set of vertices to itself which are preserved by graph or network isomorphisms. Such dynamics are referred to as…
Let $f:\hat{C}\to\hat{C}$ be a subhyperbolic rational map of degree $d$. We construct a set of coding maps $Cod(f)=\{\pi_r:\Sigma\to J\}_r$ of the Julia set $J$ by geometric coding trees, where the parameter $r$ ranges over mappings from a…
Noncatastrophic encoders are an important class of polynomial generator matrices of convolutional codes. When these polynomials have coefficients in a finite field, these encoders have been characterized are being polynomial left prime…
The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…
We consider the Potts model in a magnetic field on an arbitrary graph $G$. Using a formula of F. Y. Wu for the partition function $Z$ of this model as a sum over spanning subgraphs of $G$, we prove some properties of $Z$ concerning…
Let $H$ be a Krull monoid with infinite cyclic class group $G$ and let $G_P \subset G$ denote the set of classes containing prime divisors. We study under which conditions on $G_P$ some of the main finiteness properties of factorization…
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…
We give an FPTAS and an efficient sampling algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander graphs and the low-temperature ferromagnetic Potts model on bounded-degree expander graphs. The results apply,…
Consider an ergodic unimodular random one-ended planar graph $\G$ of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally…
We show that an arbitrary factor map $\pi:X \to Y$ on an irreducible subshift of finite type is a composition of a finite-to-one factor code and a class degree one factor code. Using this structure theorem on infinite-to-one factor codes,…
Given a simple, finite graph with vertex set $V(G)$, we define a zero forcing set of $G$ as follows. Choose $S\subseteq V(G)$ and color all vertices of $S$ blue and all vertices in $V(G) - S$ white. The color change rule is if $w$ is the…
Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…
We study measures on $\mathbb{R}^d$ which are induced by a class of infinite and recursive iterations in symbolic dynamics. Beginning with a finite set of data, we analyze prescribed recursive iteration systems, each involving subdivisions.…
We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings. We study the relations with…
We investigate infinite dimensional modules for an affine group scheme $\mathbb G$ of finite type over a field of positive characteristic $p$. For any subspace $X \subset \mathcal O(\mathbb G)$ of the coordinate algebra of $\mathbb G$, we…
Local samplers are algorithms that generate random samples based on local queries to high-dimensional distributions, ensuring the samples follow the correct induced distributions while maintaining time complexity that scales locally with…