Related papers: Growth in product replacement graphs
In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves…
We study groups, exponential groups and ordered groups equipped with valuations. We investigate algebraic and topological features of such valued structures, and apply our findings in order to solve regular equations over groups using…
We prove a sharp representation stability result for graph complexes with a distinguished vertex, and prove that the chains realizing this sharp bound pass to non-trivial families of graph homology classes. This result may be interpreted as…
Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static…
In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…
For each nonnegative integer $g$, we classify the ramification types and monodromy groups of indecomposable coverings of complex curves $f: X\to Y$ where $X$ has genus $g$, under the hypothesis that $n:=\deg(f)$ is sufficiently large and…
We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…
We show that for some absolute (explicit) constant $C$, the following holds for every finitely generated group $G$, and all $d >0$: If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…
Graph colorings have been of interest to mathematicians for a long time, but relatively recently, social scientists have also found them to be interesting tools for studying group behavior. In the last 20 years, scientists have begun to…
In this paper, we investigate the multiplicative structure of a shifted multiplicative subgroup and its connections with additive combinatorics and the theory of Diophantine equations. Among many new results, we highlight our main…
Residual finiteness growth gives an invariant that indicates how well-approximated a finitely generated group is by its finite quotients. We briefly survey the state of the subject. We then improve on the best known upper and lower bounds…
We give strong necessary conditions on the admissibility of a Polish group topology for an arbitrary graph product of groups $G(\Gamma, G_a)$, and use them to give a characterization modulo a finite set of nodes. As a corollary, we give a…
Let G be a finitely presented group, and let {G_i} be a collection of finite index normal subgroups that is closed under intersections. Then, we prove that at least one of the following must hold: 1. G_i is an amalgamated free product or…
Given a diffeomorphism of the interval, consider the uniform norm of the derivative of its n-th iteration. We get a sequence of real numbers called the growth sequence. Its asymptotic behavior is an invariant which naturally appears both in…
We consider classes of graphs, which we call thick graphs, that have the vertices of a corresponding thin graph replaced by cliques and the edges replaced by cobipartite graphs In particular, we consider the case of thick forests, which we…
We give a complete characterization of the graph products of cyclic groups admitting a Polish group topology, and show that they are all realizable as the group of automorphisms of a countable structure. In particular, we characterize the…
We show that every non-decreasing function $f\colon \mathbb N\to \mathbb N$ bounded from above by $a^n$ for some $a\ge 1$ can be realized (up to a natural equivalence) as the conjugacy growth function of a finitely generated group. We also…