Related papers: Folding median graphs
In this paper, we establish the convergence of Feynman graph integrals on closed real-analytic K\"ahler manifolds and uncover the structural mechanism underlying this convergence. The key insight is that, using Getzler's rescaling…
The main goal of this paper is a detailed study of asymptotic cones of the mapping class groups. In particular, we prove that every asymptotic cone of a mapping class group has a bi-Lipschitz equivariant embedding into a product of real…
This paper examines the relationship between the knotting of an embedded surface in $\R^3$ and the knotting of its fold curves, formed by the singular set of projection to a plane. The first result shows that every surface, no matter how…
Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…
We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have…
In 2021 Baudier, Motakis, Schlumprecht, and Zs\'ak proved that if a sequence of graphs $(G_k)_{k\in{\mathbb{N}}}$ contains the sequence of complete graphs with uniformly bounded distortion, then the sequence of lamplighter graphs on $G_k$'s…
This paper investigates quasi-isometries between graphs with variable edge lengths. A quasi-isometry is a mapping between metric spaces that approximately preserves distances, allowing for a bounded amount of additive and multiplicative…
A shelling of a graph, viewed as an abstract simplicial complex that is pure of dimension 1, is an ordering of its edges such that every edge is adjacent to some other edges appeared previously. In this paper, we focus on complete bipartite…
We introduce a combinatorial version of Stallings-Bestvina-Feighn-Dunwoody folding sequences. We then show how they are useful in analyzing the solvability of the uniform subgroup membership problem for fundamental groups of graphs of…
We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…
Folding of ADE-Dynkin diagrams according to graph automorphisms yields irreducible Dynkin diagrams of ABCDEFG-types. This folding procedure allows to trace back the properties of the corresponding simple Lie algebras or groups to those of…
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
We establish that every embedding of a Grassmann graph in a polar Grassmann graph can be reduced to an embedding in a Grassmann graph or to an embedding in the collinearity graph of a polar space. Also, we consider $3$-embeddings, i.e.…
Using the Plucker map between grassmannians, we study basic aspects of classic grassmannian geometries. For `hyperbolic' grassmannian geometries, we prove some facts (for instance, that the Plucker map is a minimal isometric embedding) that…
This paper is a self-contained presentation of certain aspects of the theory of weighted Sobolev spaces and elliptic operators on non-compact Riemannian manifolds. Specifically, we discuss (i) the standard and weighted Sobolev Embedding…
In this paper, we prove that any non-positively curved 2-dimensional surface (alias, Busemann surface) is isometrically embeddable into $L_1$. As a corollary, we obtain that all planar graphs which are 1-skeletons of planar non-positively…
A classical result by Pachner states that two $d$-dimensional combinatorial manifolds with boundary are PL homeomorphic if and only they can be connected by a sequence of shellings and inverse shellings. We prove that for balanced, i.e.,…
This work provides the first unifying theoretical framework for node (positional) embeddings and structural graph representations, bridging methods like matrix factorization and graph neural networks. Using invariant theory, we show that…
Traditional representations of graphs and their duals suggest the requirement that the dual vertices be placed inside their corresponding primal faces, and the edges of the dual graph cross only their corresponding primal edges. We consider…
An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The…