Related papers: Counting independent sets in amenable groups

This paper gives a new explicit construction of the $\mathbb{Q}$-algebraic hull for virtually solvable groups $\Gamma$ of finite abelian ranks, taking into account the spectrum $S$ of the group $\Gamma$. As an application, we make a…

An independent set in a graph is a set of pairwise non-adjacent vertices. Let $\alpha(G)$ denote the cardinality of a maximum independent set in the graph $G = (V, E)$. Gutman and Harary defined the independence polynomial of $G$ \[ I(G;x)…

The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing…

Given a family $\mathcal{H}$ of graphs, we say that a graph $G$ is $\mathcal{H}$-free if no induced subgraph of $G$ is isomorphic to a member of $\mathcal{H}$. Let $S_{t,t,t}$ be the graph obtained from $K_{1,3}$ by subdividing each edge…

For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…

We extend some properties of random walks on hyperbolic groups to random walks on convergence groups. In particular we prove that if a convergence group $G$ acts on a compact metrizable space $M$ with the convergence property then we can…

We introduce the vertex-arboricity of group-labelled graphs. For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose edges are labelled by elements of $\Gamma$. For an abelian group $\Gamma$ and $A\subseteq \Gamma$, the…

Let G be the automorphism group of a regular right-angled building X. The "standard uniform lattice" \Gamma_0 in G is a canonical graph product of finite groups, which acts discretely on X with quotient a chamber. We prove that the…

A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…

Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite…

We bound the performance guarantees that follow from Tur\'an-like bounds for unweighted and weighted independent sets in bounded-degree graphs. In particular, a randomized approach of Boppana forms a simple 1-round distributed algorithm, as…

We introduce a classical algorithm to approximate the free energy of local, translation-invariant, one-dimensional quantum systems in the thermodynamic limit of infinite chain size. While the ground state problem (i.e., the free energy at…

We study a function $\mathcal{L}_{\Gamma}$ which quantifies the LEF (local embeddability into finite groups) property for a finitely generated group $\Gamma$. We compute this "LEF growth" function in some examples, including certain wreath…

We give an FPTAS for approximating the partition function of the hard-core model for bipartite graphs when there is sufficient imbalance in the degrees or fugacities between the sides $(L,R)$ of the bipartition. This includes, among others,…

We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.

Let $G$ be a locally compact group. If $G$ is finite then the amenability constant of its Fourier algebra, denoted by ${\rm AM}({\rm A}(G))$, admits an explicit formula [Johnson, JLMS 1994]; if $G$ is infinite then no such formula for ${\rm…

We show that every word hyperbolic, surface-by-(noncyclic) free group Gamma is as rigid as possible: the quasi-isometry group of Gamma equals the abstract commensurator group Comm(Gamma), which in turn contains Gamma as a finite index…

This note describes the first example of a group that is amenable, but cannot be obtained by subgroups, quotients, extensions and direct limits from the class of groups locally of subexponential growth. It has a balanced presentation…