Related papers: Short positive loxodromics in graph products
In a graph $G$, a vertex dominates itself and its neighbours. A subset $S\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The minimum cardinality among all double dominating…
This study delves into the exploration of the limiting shape theorem for subadditive processes on finitely generated groups with polynomial growth, commonly referred to as virtually nilpotent groups. Investigating the algebraic structures…
Existing data-driven methods can well handle short text generation. However, when applied to the long-text generation scenarios such as story generation or advertising text generation in the commercial scenario, these methods may generate…
The nonnegative Grassmannian is a cell complex with rich geometric, algebraic, and combinatorial structures. Its study involves interesting combinatorial objects, such as positroids and plabic graphs. Remarkably, the same combinatorial…
Diagrammatic sets are presheaves on a rich category of shapes, whose definition is motivated by combinatorial topology and higher-dimensional diagram rewriting. These shapes include representatives of oriented simplices, cubes, and positive…
We address a question of Grigorchuk by providing both a system of recursive formulas and an asymptotic result for the portrait growth of the first Grigorchuk group. The results are obtained through analysis of some features of the branching…
Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…
We consider an exhaustion of the modular orbifold by compact subsurfaces and show that the growth rate, in terms of word length, of the reciprocal geodesics on such subsurfaces (so named low lying reciprocal geodesics) converge to the…
We develop a theory of soficity for actions on graphs and obtain new applications to the study of sofic groups. We establish various examples, stability and permanence properties of sofic actions on graphs, in particular soficity is…
We generalize a classical result concerning smooth germs of surfaces, by proving that monodromies on links of isolated complex surface singularities associated with reduced holomorphic map germs admit a positive factorization. As a…
We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…
In this paper, we establish the growth tightness of the quotient by confined subgroups in groups admitting the statistically convex-cocompact action with contracting elements. The result is sharp in the sense that the actions could not be…
We give a sufficient condition for a sequence of normal subgroups of a free group to have the property that both, their growths tend to the upper bound and their cogrowths tend to the lower bound. The condition is represented by planarity…
We characterise connected cubic graphs admitting a vertex- transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a…
We extend the characterization of stable subgroups of right-angled Artin groups of Koberda, Mangahas and Taylor to the case of graph products of infinite groups. Specifically, we show that the stable subgroups of such graph products are…
By now, we have a product theorem in every finite simple group $G$ of Lie type, with the strength of the bound depending only in the rank of $G$. Such theorems have numerous consequences: bounds on the diameters of Cayley graphs, spectral…
It is well known that finite commutative association schemes in the sense of the monograph of Bannai and Ito lead to finite commutative hypergroups with positive dual convolutions and even dual hypergroup structures. In this paper we…
The Norton product is defined on each eigenspace of a distance regular graph by the orthogonal projection of the entry-wise product. The resulting algebra, known as the Norton algebra, is a commutative nonassociative algebra that is useful…
We describe a logarithmic tensor product theory for certain module categories for a ``conformal vertex algebra.'' In this theory, which is a natural, although intricate, generalization of earlier work of Huang and Lepowsky, we do not…
The main contribution of this work is a new type of graph product, which we call the {\it zig-zag product}. Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its size from the large one, its degree…