Related papers: Foldings, graphs of groups and the membership prob…

A survey of enumeration problems arising from the study of graphs formed when the edges of a polygon are marked with evenly spaced points and every pair of points is joined by a line. A few of these problems have been solved, a classical…

We prove that the first homology group of every planar locally transitive finite graph $G$ is a finitely generated ${\rm Aut}(G)$-module and we prove a similar result for the fundamental group of locally finite planar Cayley graphs.…

With appropriate notions of Hermitian vector bundles and connections over weighted graphs which we allow to be locally infinite, we prove Feynman-Kac-type representations for the corresponding semigroups and derive several applications…

We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…

In the same way the folding of the Dynkin diagram of A_{2n} (resp. A_{2n-1}) produces the B_n (resp. C_n) Dynkin diagram, the symmetry algebra W of a Toda model based on B_n (resp. C_n) can be seen as resulting from the folding of a…

In recent years extensions of manifold Ricci curvature to discrete combinatorial objects such as graphs and hypergraphs (popularly called as "network shapes"), have found a plethora of applications in a wide spectrum of research areas…

Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…

Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…

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 the idea of *representation stability* (and several variations) for a sequence of representations V_n of groups G_n. A central application of the new viewpoint we introduce here is the importation of representation theory into…

Embedding static graphs in low-dimensional vector spaces plays a key role in network analytics and inference, supporting applications like node classification, link prediction, and graph visualization. However, many real-world networks…

Yu. I. Merzljakov developed a method of splittable coordinates which helps to verify the linearity of some groups, he established some fundamental results using this method. In this paper we use the method of splittable coordinates and find…

We introduce a new class of transitive permutation groups which properly contains the automorphism groups of vertex-transitive graphs and digraphs. We then give a sufficient condition for a quotient of this family to remain in the family,…

We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…

We describe how orbital graphs can be used to improve the practical performance of many algorithms for permutation groups, including intersection and stabilizer problems. First we explain how orbital graphs can be integrated in partition…

We apply the theory of $\alpha$-induction of sectors which we elaborated in our previous paper to several nets of subfactors arising from conformal field theory. The main application are conformal embeddings and orbifold inclusions of SU(n)…

We express the hairy graph complexes computing the rational homotopy groups of long embeddings (modulo immersion) of R^m in R^n as "decorated" graph complexes associated to certain representations of the outer automorphism groups of free…

We solve the problem of extension of characters of commutative subalgebras in associative (noncommutative) algebras for a class of subrings (Galois orders) in skew group rings. These results can be viewed as a noncommutative analogue of…

We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin holds for all but finitely many graphs. We also use our method to prove…

Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used by many authors to solve a wide collection of decision problems for free groups and their subgroups. In the present…