Related papers: Membership Problem in groups acting freely on Z^n-…

In arXiv:1911.08172 we have studied the single-particle free energy of a class of Little String Theories of A-type, which are engineered by $N$ parallel M5-branes on a circle. To leading instanton order (from the perspective of the low…

Let $(M,\omega)$ be a connected symplectic manifold on which a connected Lie group $G$ acts properly and in a Hamiltonian fashion with moment map $\mu:M \lra \mf g^*$. Our purpose is investigate multiplicity-free actions, giving criteria to…

In this paper, we explore the properties of zeta functions associated with infinite graphs of groups that arise as quotients of cuspidal tree-lattices, including all non-uniform arithmetic quotients of the tree of rank one Lie groups over…

We consider the totally nonfree (TNF) action of a groups and the corresponding adjoint invariant (AD) measures on the lattices of the subgroups of the given group. The main result is the description of all adjoint-invariant and TNF-measures…

We prove that every unconditionally closed subset of a free group is algebraic, thereby answering affirmatively a 76 years old problem of Markov for free groups. In modern terminology, this means that Markov and Zariski topologies coincide…

Known and new results on free Boolean topological groups are collected. An account of properties which these groups share with free or free Abelian topological groups and properties specific of free Boolean groups is given. Special emphasis…

Given a group action on a finite set, we define the group-action model which consists of tensor network diagrams which are invariant under the group symmetry. In particular, group-action models can be realized as the even part of…

In this paper we study a sub-Finsler geometric problem on the free-nilpotent group of rank 2 and step 3. Such a group is also called Cartan group and has a natural structure of Carnot group, which we metrize considering the $\ell_\infty$…

We study a notion of deformation for simplicial trees with group actions (G-trees). Here G is a fixed, arbitrary group. Two G-trees are related by a deformation if there is a finite sequence of collapse and expansion moves joining them. We…

The object of this expository work is to try to unveil the topological/geometric intuition behind the theory of free groups and their automorphism and outer automorphism groups. The method we follow is to focus on a series of problems in…

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…

A $P_4$-free graph is called a cograph. In this paper we partially characterize finite groups whose power graph is a cograph. As we will see, this problem is a generalization of the determination of groups in which every element has prime…

In this work we obtain basis for the null space of unicyclic graphs. We extend the null decomposition of trees from [11] for unicyclic graphs. As an application, we obtain closed formulas for the independence and matching numbers of…

In a seminal paper, Stallings introduced folding of morphisms of graphs. One consequence of folding is the representation of finitely-generated subgroups of a finite-rank free group as immersions of finite graphs. Stallings's methods allow…

We consider a dynamic model for competition in a social network, where two strategic agents have fixed beliefs and the non-strategic/regular agents adjust their states according to a distributed consensus protocol. We suppose that one…

Suppose that $F$ is a free group and $k$ is a natural number. We show that the fully compressed membership problem for $k$-generated subgroups of $F$ is solvable in polynomial time. In order to do this, we adapt the theory of Stallings'…

We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…

This work considers clustering nodes of a largely incomplete graph. Under the problem setting, only a small amount of queries about the edges can be made, but the entire graph is not observable. This problem finds applications in…

We introduce and study the general problem of finding a most "scale-free-like" spanning tree of a connected graph. It is motivated by a particular problem in epidemiology, and may be useful in studies of various dynamical processes in…

We use the notion of fixity for representations of finite groups to construct free and smooth actions on products of spheres. In particular we show that a finite p-group (for p>3) will act freely and smoothly on a product of two spheres if…