Related papers: Trivalent expanders, $(\Delta-Y)$-transformation, …

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…

We show that for any surface of genus at least 3 equipped with any choice of framing, the graph of non-separating curves with winding number 0 with respect to the framing is hierarchically hyperbolic but not Gromov hyperbolic. We also…

Given a topological cell decomposition of a closed surface equipped with edge weights, we consider the Dirichlet energy of any geodesic realization of the 1-skeleton graph to a hyperbolic surface. By minimizing the energy over all possible…

We define a solvable extension of the graph 2-step nilpotent Lie algebras of [5] by adding elements corresponding to the 3-cliques of the graph. We study some of their basic properties and we prove that two such Lie algebras are isomorphic…

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…

We introduce two families of two-generator one-relator groups called primitive extension groups and show that a one-relator group is hyperbolic if its primitive extension subgroups are hyperbolic. This reduces the problem of characterising…

We focus our attention on well-covered graphs that are vertex decomposable. We show that for many known families of these vertex decomposable graphs, the set of shedding vertices forms a dominating set. We then construct three new infinite…

We consider the family of undirected Cayley graphs associated with odd cyclic groups, and study statistics for the eigenvalues in their spectra. Our results are motivated by analogies between arithmetic geometry and graph theory.

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

Torsion polynomials connect the genus of a hyperbolic knot (a topological invariant) with the discrete faithful representation (a geometric invariant). Using a new combinatorial structure of an ideal triangulation of a 3-manifold that…

A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are…

We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using…

Vertex-stabilizers of trivalent edge-transitive graphs have been classified by Tutte, Goldschmidt and some others in several previous papers. Tetravalent half-arc-transitive graphs form an important class of tetravalent edge-transitive…

We present a construction of sequences of closed hyperbolic surfaces that have long systoles which form pants decompositions of these surfaces. The length of the systoles of these surfaces grows logarithmically as a function of their genus.

We continue the study of non-commutative operator graphs generated by resolutions of identity covariant with respect to unitary actions of the circle group and the Heisenber-Weyl group as well. It is shown that the graphs generated by the…

We study the representations of non-commutative universal lattices and use them to compute lower bounds for the \TauC for the commutative universal lattices $G_{d,k}= \SL_d(\Z[x_1,...,x_k])$ with respect to several generating sets. As an…

In a recent paper (arXiv:1505.01475 ) Est\'elyi and Pisanski raised a question whether there exist vertex-transitive Haar graphs that are not Cayley graphs. In this note we construct an infinite family of trivalent Haar graphs that are…

High-dimensional expanders are a generalization of the notion of expander graphs to simplicial complexes and give rise to a variety of applications in computer science and other fields. We provide a general tool to construct families of…

This paper deals with some of the algebraic properties of Sierpi\'nski graphs and a family of regular generalized Sierpi\'nski graphs. For the family of regular generalized Sierpi\'nski graphs, we obtain their spectrum and characterize…