Related papers: A combinatorial model for the Menger curve
The Erd\H{o}s, Gr\"unwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article we prove an effective version of the Erd\H{o}s,…
Let $R$ be a local ring and $M$ a finitely generated $R$-module. The complete intersection dimension of $M$--defined by Avramov, Gasharov and Peeva, and denoted $\cidim_R(M)$--is a homological invariant whose finiteness implies that $M$ is…
We study the logical properties of infinite geometric random graphs, introduced by Bonato and Janssen. These are graphs whose vertex set is a dense ``generic'' subset of a metric space, where two vertices are adjacent with probability $p>0$…
We explore the geometry of the Bures-Wasserstein space for potentially degenerate Gaussian measures on a separable Hilbert space. In this general setting, the optimal transport map is formally the subgradient of a convex function that is…
Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty intersection. Sometimes…
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…
Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphical designs can coincide with highly structured and…
In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex of graphs in terms of its dimension. We observe that the…
We prove sandwich theorems and a Tauberian theorem in the space of compact metric measure spaces, endowed with the Gromov-Hausdorff-Prokhorov (GHP) topology. These results hold with respect to a close relative of Gromov's Lipschitz order.…
We introduce and analyze a statistical estimator for Monge transport maps: solutions to the quadratic optimal transport problem in Euclidean space. For absolutely continuous source measures, this map is uniquely defined as the gradient of a…
A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…
Given a projective smooth curve $X$ over any field $k$, we discuss two notions of global $\mathbb{A}^1$ degree of a finite morphism of smooth curves $f: X \to \mathbb{P}^1_k$ satisfying certain conditions. One originates from computing the…
A well-known theorem of Wolpert shows that the Weil-Petersson symplectic form on Teichm\"uller space, computed on two infinitesimal twists along simple closed geodesics on a fixed hyperbolic surface, equals the sum of the cosines of the…
In this work we discuss some appearances of semi-infinite combinatorics in representation theory. We propose a semi-infinite moment graph theory and we motivate it by considering the (not yet rigorously defined) geometric side of the story.…
Moser's Bernstein theorem \cite{moser61} says that an entire minimal graph of codimension 1 with bounded slope must be a hyperplane. An analogous result for arbitrary codimension is not true, by an example of Lawson-Osserman. Here, we show…
In a recent work [2] with Datta, we introduced the mu vector (with respect to a given field) of simplicial complexes and used it to study tightness and lower bounds. In this paper, we modify the definition of mu vectors. With the new…
The jacobian of the universal curve over $\mathcal{M}_{g,n}$ is an abelian scheme over $\mathcal{M}_{g,n}$. Our main result is the construction of an algebraic space $\beta\colon \tilde{\mathcal{M}}_{g,n} \rightarrow…
Given a directed graph E, we construct for each real number l a quiver whose vertex space is the topological realisation of E, and whose edges are directed paths of length l in the vertex space. These quivers are not topological graphs in…
We give the first rigorous construction of complete, embedded self-shrinking hypersurfaces under mean curvature flow, since Angenent's torus in 1989. The surfaces exist for any sufficiently large prescribed genus $g$, and are non-compact…
We consider the count of subgraphs with an arbitrary configuration of endpoints in the random-connection model based on a Poisson point process on ${\Bbb R}^d$. We present combinatorial expressions for the computation of the cumulants and…