Related papers: Why CAT(0) cube complexes should be replaced with …
In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…
We construct CAT(0) groups containing subgroups whose Dehn functions are given by $x^s$, for a dense set of numbers $s \in [2, \infty)$. This significantly expands the known geometric behavior of subgroups of CAT(0) groups.
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median…
In the suborbital graphs studies, there has been a research gap in the sense that the Modular group is connected to two numbers. Thus, this paper attempts to contribute to the studies developed by Gauss, Bolyai, Lobachevsky and Riemann.…
We investigate the cocompact action of Higman's group on a CAT(0) square complex associated to its standard presentation. We show that this action is in a sense intrinsic, which allows for the use of geometric techniques to study the…
The main technical result of this paper is to characterize the contracting isometries of a CAT(0) cube complex without any assumption on its local finiteness. Afterwards, we introduce the combinatorial boundary of a CAT(0) cube complex, and…
This paper presents the first polynomial time algorithm to compute geodesics in a CAT(0) cubical complex in general dimension. The algorithm is a simple iterative method to update breakpoints of a path joining two points using Miller, Owen…
We study Cayley graphs of abelian groups from the perspective of quantum symmetries. We develop a general strategy for determining the quantum automorphism groups of such graphs. Applying this procedure, we find the quantum symmetries of…
Beyond the crucial role they play in the foundations of the theory of overconvergent modular forms, canonical subgroups have found new applications to analytic continuation of overconvergent modular forms. For such applications, it is…
The notion of quadratic maps between arbitrary groups appeared at several places in the literature on quadratic algebra. Here a unified extensive treatment of their properties is given; the relation with a relative version of Passi's…
The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…
The graph braid group of a complete bipartite graph is the fundamental group of a configuration space of points on the graph, which is a CAT(0) cube complex. We combine an analysis of the topology of links of vertices in this complex, the…
For a CAT(0) cube complex $\mathbf X$, we define a simplicial flag complex $\partial_\Delta\mathbf X$, called the \emph{simplicial boundary}, which is a natural setting for studying non-hyperbolic behavior of $\mathbf X$. We compare…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…
We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.
Ramanujan graphs are graphs whose spectrum is bounded optimally. Such graphs have found numerous applications in combinatorics and computer science. In recent years, a high dimensional theory has emerged. In this paper these developments…
Graph theory is important in information theory. We introduce a quantization process on graphs and apply the quantized graphs in quantum information. The quon language provides a mathematical theory to study such quantized graphs in a…
This article is a survey article on geometric group theory from the point of view of a non-expert who likes geometric group theory and uses it in his own research. The sections are: classical examples, basics about quasiisometry,properties…
We investigate Feynman graphs and their Feynman rules from the viewpoint of graph complexes. We focus on graph homology and on the appearance of cubical complexes when either reducing internal edges or when removing them by putting them on…