Related papers: Finitary codings for the random-cluster model and …
The convex closure of entropy vectors for quasi-uniform random vectors is the same as the closure of the entropy region. Thus, quasi-uniform random vectors constitute an important class of random vectors for characterizing the entropy…
Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…
We show that any separated essentially finite-type map $f$ of noetherian schemes globally factors as $f = hi$ where $i$ is an injective localization map and $h$ a separated finite-type map. In particular, via Nagata's compactification…
Gcd-graphs over the ring of integers modulo $n$ are a simple and elegant class of integral graphs. The study of these graphs connects multiple areas of mathematics, including graph theory, number theory, and ring theory. In a recent work,…
We present an algorithm that, given finite simplicial sets $X$, $A$, $Y$ with an action of a finite group $G$, computes the set $[X,Y]^A_G$ of homotopy classes of equivariant maps $\ell \colon X \to Y$ extending a given equivariant map $f…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
Inspired by group cohomology, we define several coarse topological invariants of metric spaces. We define the coarse cohomological dimension of a metric space, and demonstrate that if G is a countable group, then the coarse cohomological…
We study simplified bootstrap problems for probability distributions on the infinite line and the circle. We show that the rapid convergence of the bootstrap method for problems on the infinite line is related to the fact that the smallest…
We consider a general class of spin systems with potentially unbounded real-valued spins, defined via a single-site potential with super-Gaussian tails on general graphs, allowing for both short- and long-range interactions. This class…
For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information above which a given compact subset of the state space can be…
The estimation of categorical distributions under marginal constraints summarizing some sample from a population in the most-generalizable way is key for many machine-learning and data-driven approaches. We provide a parameter-agnostic…
Let $\phi : S^1\times D^2\to S^1$ be the natural projection. An oriented knot $K\hookrightarrow V = S^1\times D^2$ is called an almost closed braid if the restriction of $\phi$ to K has exactly two (non-degenerate) critical points (and K is…
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…
We study an abstract setting for cutting planes for integer programming called the infinite group problem. In this abstraction, cutting planes are computed via cut generating function that act on the simplex tableau. In this function space,…
A finite group with a cyclic normal subgroup N such that G/N is cyclic is said to be metacyclic. A code over a finite field F is a metacyclic code if it is a left ideal in the group algebra FG for G a metacyclic group. Metacyclic codes are…
A systematic study of holomorphic gauge invariant operators in general $\mathcal{N}=1$ quiver gauge theories, with unitary gauge groups and bifundamental matter fields, was recently presented in [1]. For large ranks a simple counting…
A Schreier decoration is a combinatorial coding of an action of the free group $F_d$ on the vertex set of a $2d$-regular graph. We investigate whether a Schreier decoration exists on various countably infinite transitive graphs as a factor…
Let $\mathfrak{g}$ be a simple Lie algebra over $\mathbb{C}$. The KZ connection is a connection on the constant bundle associated to a set of $n$ finite dimensional irreducible representations of $\mathfrak{g}$ and a nonzero $\kappa \in…
In this paper we discuss gauging noninvertible zero-form symmetries in two dimensions. We specialize to certain gaugeable cases, specifically, fusion categories of the form Rep(H) for H a suitable Hopf algebra (which includes the special…
For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of…