Related papers: Quasi-isometry classification of certain graph $2$…
We construct uncountably many finitely generated, pairwise non-isomorphic torsion-free groups, all of which fall into the same quasi-isometry class. This is done by considering Schur covering groups and group cohomology, with the necessary…
We study P-groupoids that arise from certain decompositions of complete graphs. We show that left distributive P-groupoids are distributive, quasigroups. We characterize P-groupoids when the corresponding decomposition is a Hamiltonian…
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…
We prove several rigidity properties for random quotients of mapping class groups of surfaces, namely whose kernel is normally generated by the n-th steps of finitely many independent random walks. Firstly, we generalise a celebrated…
Characterizing graphs by their spectra is an important topic in spectral graph theory, which has attracted a lot of attention of researchers in recent years. It is generally very hard and challenging to show a given graph to be determined…
We study a finite sequence of graphs, beginning with the curve graph and ending with a graph quasi-isometric to a tree. There is a Lipschitz map from one graph in the sequence to the next. This sequence was first introduced by Hamenst\"adt.…
We classify the pairs $(C,G)$ where $C$ is a seminormal curve over an arbitrary field $k$ and $G$ is a smooth connected algebraic group acting faithfully on $C$ with a dense orbit, and we determine the equivariant Picard group of $C$. We…
We study quasiisometric embeddings between finite-dimensional CAT(0) cube complexes. More specifically, we introduce geometric branching conditions under which flats in the domain, not necessarily of top rank, are mapped within finite…
Recent work suggests that topological features of certain quantum gravity theories can be interpreted as particles, matching the known fermions and bosons of the first generation in the Standard Model. This is achieved by identifying…
A T-graph (a special case of a chordal graph) is the intersection graph of connected subtrees of a suitable subdivision of a fixed tree T . We deal with the isomorphism problem for T-graphs which is GI-complete in general - when T is a part…
Spanning trees of complete bipartite graphs exhibit a rich interaction between degree sequences and graph structure. In this paper, we obtain lower bounds on the number of isomorphism classes of spanning trees in $K_{a,b}, 2 \leq a \leq b$…
We generalize the notion of quasielliptic curves, which have infinitesimal symmetries and exist only in characteristic two and three, to a remarkable hierarchy of regular curves having infinitesimal symmetries, defined in all…
A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…
This survey studies pairs $(G,\mathcal{P})$ with $G$ a finitely generated group and $\mathcal{P}$ a (finite) collection of subgroups of $G$. We explore the notion of quasi-isometry of such pairs and the notion of a qi-characteristic…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
We consider the structures formed by isogenies of abelian varieties with polarizations that are not necessarily principal, specifically with the $[\ell]$-polarizations we have previously defined. Our primary interest is in superspecial…
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…
In this paper, we characterize the second bounded characteristic classes of foliated bundles in terms of the non-descendible quasi-morphisms on the universal covering of the structure group. As its application, we study the boundedness of…
2-colored quasi best match graphs (2-qBMGs) are directed graphs that arose in phylogenetics. Investigations of 2-qBMGs have mostly focused on computational issues. However, 2-qBMGs also have relevant properties for structural graph theory;…
Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…