Related papers: An elementary exposition to topological overlap in…

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.…

In this paper we use the strength of the constraint method in combination with a generalized Borsuk-Ulam type theorem and a cohomological intersection lemma to show how one can obtain many new topological transversal theorems of Tverberg…

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

A generalization of metric space is presented which is shown to admit a theory strongly related to that of ordinary metric spaces. To avoid the topological effects related to dropping any of the axioms of metric space, first a new, and…

We propose an intersection-theoretic method to reduce questions in genus zero logarithmic Gromov-Witten theory to questions in the Gromov-Witten theory of smooth pairs, in the presence of positivity. The method is applied to the enumerative…

The presented work focuses on problems from determinant theory, set theory and topology. The term graph is the binding element that connects these problems. Graphs are distinguished by their geometrical simplicity, which helps in showing…

This is an elementary geometrical proof of Birkhoff theorem. It is hardly important, but the pictures behind are quite nice.

In this paper we give another proof of the fact that a random overlap array, which satisfies the Ghirlanda-Guerra identities and whose elements take values in a finite set, is ultrametric with probability one. The new proof bypasses random…

Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…

Given $mp$ different $p$-planes in general position in $(m+p)$-dimensional space, a classical problem is to ask how many $p$-planes intersect all of them. For example when $m = p = 2$, this is precisely the question of "lines meeting four…

Convergence spaces are a generalization of topological spaces. The category of convergence spaces is well-suited for Algebraic Topology, one of the reasons is the existence of exponential objects provided by continuous convergence. In this…

This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in…

The aim of this paper is to clarify the relationship between Gromov-hyperbolicity and amenability for planar maps.

Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…

In this note, we give a self-contained and elementary proof of the elementary construction of spectral high-dimensional expanders using elementary matrices due to Kaufman and Oppenheim [Proc. 50th ACM Symp. on Theory of Computing (STOC),…

Here we review background in differential topology related to the calculation of an euler characteristic, and background on localization in equivariant cohomology. We then outline Gromov-Witten invariants in algebraic geometry and give…

In his ``Four Lectures", Gromov conjectured a scalar curvature extremality property of convex polytopes. Moreover, Gromov outlined a proof of the conjecture in the special case when the dihedral angles are acute. Gromov's argument relies on…

We present an elementary proof of a generalization of Kirchoff's matrix tree theorem to directed, weighted graphs. The proof is based on a specific factorization of the Laplacian matrices associated to the graphs, which only involves the…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…