Related papers: Monotone Simultaneous Embeddings of Paths in R^d

We study the topological persistence of the (path) configuration spaces and the (path) independence complexes for digraphs as well as their underlying graphs. We construct some canonical embeddings from the (path) independence complexes of…

Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…

We consider the global rigidity problem for bar-joint frameworks where each vertex is constrained to lie on a particular line in $\mathbb R^d$. In our setting we allow multiple vertices to be constrained to the same line. Under a mild…

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…

We solve a problem on a construction of a separately continuous mapping with the given diagonal, which is the pointwise limit of a sequence of continuous mappings valued in an equiconnected space. We construct an example of a closed-valued…

Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

In a recent paper, we introduced the simultaneous representation problem (defined for any graph class C) and studied the problem for chordal, comparability and permutation graphs. For interval graphs, the problem is defined as follows. Two…

We propose a new family of natural generalizations of the pentagram map from 2D to higher dimensions and prove their integrability on generic twisted and closed polygons. In dimension $d$ there are $d-1$ such generalizations called dented…

Erd\H{o}s and Hajnal proposed a problem that: is it true that every $(2n+1)$-vertex graph with $n^2+n+1$ edges contains two vertices of equal degree connected by a path of length three? The edge bound is sharp by the complete bipartite…

We study the NP-hard Minimum Shared Edges (MSE) problem on graphs: decide whether it is possible to route $p$ paths from a start vertex to a target vertex in a given graph while using at most $k$ edges more than once. We show that MSE can…

We show that every planar graph can be represented by a monotone topological 2-page book embedding where at most 15n/16 (of potentially 3n-6) edges cross the spine exactly once.

In this paper we revisit the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal…

We consider Bratteli diagrams of finite rank (not necessarily simple) and ergodic invariant measures with respect to the cofinal equivalence relation on their path spaces. It is shown that every ergodic invariant measure (finite or…

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

We consider defining the embedding of a triangle mesh into $R^3$, up to translation, rotation, and scale, by its vector of dihedral angles. Theoretically, we show that locally, almost everywhere, the map from realizable vectors of dihedrals…

This is an outline of work in progress. We study the conjecture that the topological entropy of a real cubic map depends ``monotonely'' on its parameters, in the sense that each locus of constant entropy in parameter space is a connected…

Let $f$ be a homogeneous polynomial with rational coefficients in $d$ variables. We prove several results concerning uniform simultaneous approximation to points on the graph of $f$, as well as on the hypersurface $\{f(x_1,\dots,x_d) =…

Let $E \subset {\Bbb F}_q^d$, the $d$-dimensional vector space over a finite field with $q$ elements. Construct a graph, called the distance graph of $E$, by letting the vertices be the elements of $E$ and connect a pair of vertices…

An EPG-representation of a graph $G$ is a collection of paths in a plane square grid, each corresponding to a single vertex of $G$, so that two vertices are adjacent if and only if their corresponding paths share infinitely many points. In…