Related papers: Counting independent sets in amenable groups

An \textit{algebraic} action of a discrete group $\Gamma $ is a homomorphism from $\Gamma $ to the group of continuous automorphisms of a compact abelian group $X$. By duality, such an action of $\Gamma $ is determined by a module…

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

There has been substantial interest in estimating the value of a graph parameter, i.e., of a real-valued function defined on the set of finite graphs, by querying a randomly sampled substructure whose size is independent of the size of the…

Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…

Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…

A discrete group $\Gamma$ is called exact if the reduced group C*-algebra ${C_{\lambda}}^{*}(\Gamma)$ is exact as C*-algebras, and a discrete group $\Lambda$ is called residually exact if every nonunital element $g \in \Lambda$ admits a…

We consider the problem of sampling from the Ising model when the underlying interaction matrix has eigenvalues lying within an interval of length $\gamma$. Recent work in this setting has shown various algorithmic results that apply…

This article is in the spirit of our work on the consequences of the Regge calculus, where some edge length scale arises as an optimal initial point of the perturbative expansion after functional integration over connection. Now consider…

Let $\Gamma$ be a finite connected graph and $G$ a vertex-transitive group of its automorphisms. The pair $(\Gamma, G)$ is said to be locally-$L$ if the permutation group induced by the action of the vertex-stabiliser $G_v$ on the set of…

Let G be a finite graph or an infinite graph on which Z^d acts with finite fundamental domain. If G is finite, let T be a random spanning tree chosen uniformly from all spanning trees of G; if G is infinite, known methods show that this…

In a previous article, we extended the notion of ergodic optimization to the setting of C*-dynamical systems of countable discrete groups. Among the key results of that paper was that given an action $G \stackrel{\Xi}{\curvearrowright}…

Suppose that $\tilde{G}$ is a connected reductive group defined over a field $k$, and $\Gamma$ is a finite group acting via $k$-automorphisms of $\tilde{G}$ satisfying a certain quasi-semisimplicity condition. Then the connected part of the…

We complement the characterization of the graph products of cyclic groups $G(\Gamma, \mathfrak{p})$ admitting a Polish group topology of [9] with the following result. Let $G = G(\Gamma, \mathfrak{p})$, then the following are equivalent:…

We consider the following situation: G is a finite directed graph, where to each vertex of G is assigned an element of a finite group Gamma. We consider all walks of length N on G, starting from v_i and ending at v_j To each such walk $w$…

Given a $p$-adic group $G$ equipped with an action of a finite group $\Gamma\subset\mathrm{Aut}_F(\mathbf{G})$, and a reductive fixed-point subgroup $G^\Gamma$, we establish a relationship between constructions of types for these two groups…

In the paper we completely describe characters (central positive-definite functions) of simple locally finite groups that can be represented as inductive limits of (products of) symmetric groups under block diagonal embeddings. Each such…

For a well-studied family of domination-type problems, in bounded-treewidth graphs, we investigate whether it is possible to find faster algorithms. For sets $\sigma,\rho$ of non-negative integers, a $(\sigma,\rho)$-set of a graph $G$ is a…

Symbolic dynamical theory plays an important role in the research of amenability with a countable group. Motivated by the deep results of Dougall and Sharp, we study the group extensions for topologically mixing random shifts of finite…

Let $G=NH$ be a Lie group where $N,H$ are closed connected subgroups of $G,$ and $N$ is an exponential solvable Lie group which is normal in $G.$ Suppose furthermore that $N$ admits a unitary character $\chi_{\lambda}$ corresponding to a…

Given a finitely generated group $\Gamma$, we study the space ${\rm Isom}(\Gamma,{\mathbb Q\mathbb U})$ of all actions of $\Gamma$ by isometries of the rational Urysohn metric space ${\mathbb Q\mathbb U}$, where ${\rm Isom}(\Gamma,{\mathbb…