Related papers: Finitary codings for the random-cluster model and …
We consider random sampling in finitely generated shift-invariant spaces $V(\Phi) \subset {\rm L}^2(\mathbb{R}^n)$ generated by a vector $\Phi = (\varphi_1,\ldots,\varphi_r) \in {\rm L}^2(\mathbb{R}^n)^r$. Following the approach introduced…
It is shown by constructing Rohlins canonical measures that for a strictly stationary, d-dimensional vector-valued process X there exists another strictly stationary d-dimensional process U with uniform one-dimensional marginals and with…
We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…
Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the…
Term Coding asks: given a finite system of term identities $\Gamma$ in $v$ variables, how large can its solution set be on an $n$--element alphabet, when we are free to choose the interpretations of the function symbols? This turns familiar…
Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs…
Treating neural network inputs and outputs as random variables, we characterize the structure of neural networks that can be used to model data that are invariant or equivariant under the action of a compact group. Much recent research has…
We study the existence of periodic colorings and orientations in locally finite graphs. A coloring or orientation of a graph $G$ is periodic if the resulting colored or oriented graph is quasi-transitive, meaning that $V(G)$ has finitely…
We prove that the Loop O(1) model, a well-known graphical expansion of the Ising model, is a factor of i.i.d. on unimodular random rooted graphs under various conditions, including in the presence of a non-negative external field. As an…
It is well known that the ring of polynomial invariants of a reductive group is finitely generated. However, it is difficult to give strong upper bounds on the degrees of the generators, especially over fields of positive characteristic. In…
This report presents some fundamental mathematical results towards elucidating the information-geometric underpinnings of evolutionary modelling schemes for (quasi-)stationary discrete stochastic processes. The model class under…
The random interlacement point process (introduced by Sznitman, generalized by Teixeira) is a Poisson point process on the space of labeled doubly infinite nearest neighbour trajectories modulo time-shift on a transient graph $G$. We show…
A curve X over the field Q of rational numbers is modular if it is dominated by X_1(N) for some N; if in addition the image of its jacobian in J_1(N) is contained in the new subvariety of J_1(N), then X is called a new modular curve. We…
Consider a unimodular random graph, or just a finitely generated Cayley graph. When does its cycle space have an invariant random generating set of cycles such that every edge is contained in finitely many of the cycles? Generating the free…
In this paper, a G-shift of finite type (G-SFT) is a shift of finite type together with a free continuous shift-commuting action by a finite group G. We reduce the classification of G-SFTs up to equivariant flow equivalence to an algebraic…
We prove the following result: Let $(X,g_0)$ be a complete, connected 4-manifold with uniformly positive isotropic curvature and with bounded geometry. Then there is a finite collection $\mathcal{F}$ of manifolds of the form $\mathbb{S}^3…
It is well known that if G is a finite group then the group of endotrivial modules is finitely generated. In this paper we investigate endotrivial modules over arbitrary finite group schemes. Our results can be applied to computing the…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
For spin systems, such as the $q$-colorings and independent-set models, approximating the partition function in the so-called non-uniqueness region, where the model exhibits long-range correlations, is typically computationally hard for…
In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…