Related papers: Counting independent sets in amenable groups

We have developed polynomial-time algorithms to generate terms of the cogrowth series for groups $\mathbb{Z}\wr \mathbb{Z},$ the lamplighter group, $(\mathbb{Z}\wr \mathbb{Z})\wr \mathbb{Z}$ and the Navas-Brin group $B.$ We have also given…

We show that, given a finitely generated group $G$ as the coordinate group of a finite system of equations over a torsion-free hyperbolic group $\Gamma$, there is an algorithm which constructs a cover of a canonical solution diagram. The…

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

For a cardinal $\kappa$, denote by $\mathbf{H}^\kappa$ the algebraic real hyperbolic space of dimension $\kappa$. For a topological group $\Gamma$, we study the set of continuous representations $\Gamma \to…

Let $\Gamma$ be a hyperbolic group and G be the isometry group of a Gromov-hyperbolic, properand geodesic metric space. We study the action of the outer automorphism group Out($\Gamma$) onthe set X($\Gamma$,G) of conjugacy classes of…

A group is called $\Lambda$-free if it has a free Lyndon length function in an ordered abelian group $\Lambda$, which is equivalent to having a free isometric action on a $\Lambda$-tree. A group has a regular free length function in…

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…

Let $\Gamma$ be a finitely generated group and $X$ be a minimal compact $\Gamma$-space. We assume that the $\Gamma$-action is micro-supported, i.e. for every non-empty open subset $U \subseteq X$, there is an element of $\Gamma$ acting…

Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…

Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…

We present an algorithm that takes as input a graph $G$ with weights on the vertices, and computes a maximum weight independent set $S$ of $G$. If the input graph $G$ excludes a path $P_k$ on $k$ vertices as an induced subgraph, the…

Centrality measures characterize important nodes in networks. Efficiently computing such nodes has received a lot of attention. When considering the generalization of computing central groups of nodes, challenging optimization problems…

We obtain a compactness result for $\Gamma$-convergence of integral functionals defined on $\mathcal{A}$-free vector fields. This is used to study homogenization problems for these functionals without periodicity assumptions. More…

In this article, we show super-rigidity of Gromov's random monster group. We prove that any morphism $\phi_\alpha$ from Gromov's random monster group $\Gamma_\alpha$ to the group $G$ has finite image for almost all $\alpha$, where $G$ is…

In this paper we study the approximability of (Finite-)Valued Constraint Satisfaction Problems (VCSPs) with a fixed finite constraint language {\Gamma} consisting of finitary functions on a fixed finite domain. An instance of VCSP is given…

Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is \emph{symmetric with respect to $F_G(P)$} if the uniform distribution on $V(G)$ maximizes $F_G(P)$.…

We study the intersection of finitely generated subgroups of free groups by utilizing the method of linear programming. We prove that if $H_1$ is a finitely generated subgroup of a free group $F$, then the WN-coefficient $\sigma(H_1)$ of…

Consider a free ergodic measure preserving profinite action $\Gamma\curvearrowright X$ (i.e. an inverse limit of actions $\Gamma\curvearrowright X_n$, with $X_n$ finite) of a countable property (T) group $\Gamma$ (more generally of a group…

Classical ergodic theory for integer-group actions uses entropy as a complete invariant for isomorphism of IID (independent, identically distributed) processes (a.k.a. product measures). This theory holds for amenable groups as well.…

By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number of independent sets in bipartite graphs. Our first algorithm applies to $d$-regular, bipartite graphs…