Related papers: A Ramsey-type phenomenon in two and three dimensio…
Let $\mathbb{P}= \{P_1, \cdots, P_{k}\in \mathbb{R}[y]\}$ be a collection of polynomials with distinct degrees and zero constant terms. We proved that there exists $\epsilon=\epsilon(\mathbb{P})>0$ such that, for any compact set $E \subset…
According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…
Ryser's Conjecture states that any $r$-partite $r$-uniform hypergraph has a vertex cover of size at most $r - 1$ times the size of the largest matching. For $r = 2$, the conjecture is simply K\"onig's Theorem and every bipartite graph is a…
We prove that hypergraphs defined by low-degree polynomial inequalities contain large homogeneous subsets. Formally, let $H$ be an $r$-uniform hypergraph on $N$ vertices that is semialgebraic of constant description complexity, and each…
In this paper we define a family of topological spaces, which contains and vastly generalizes the higher-dimensional Dunce hats. Our definition is purely combinatorial, and is phrased in terms of identifications of boundary simplices of…
We prove some extension theorems involving uniformly continuous maps of the universal Urysohn space. We also prove reconstruction theorems for certain groups of autohomeomorphisms of this space and of its open subsets.
There are two rather distinct approaches to Morse theory nowadays: smooth and discrete. We propose to study a real valued function by assembling all associated sections in a topological category. From this point of view, Reeb functions on…
We introduce the multineighbor complex of a graph, which is a simplicial complex in which a simplex is a subset of the graph with a sufficient number of mutual neighbors. We investigate the asymptotic homological properties of such…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
Here are versions of the proofs of two classic theorems of combinatorial topology. The first is the result that piecewise linearly homeomorphic simplicial complexes are related by stellar moves. This is used in the proof, modelled on that…
We show that, for every $r, k$, there is an $n = n(r,k)$ so that any $r$-coloring of the edges of the complete graph on $[n]$ will yield a monochromatic complete subgraph on vertices ${a + \sum_{i \in I} d_i \mid I \subseteq [k]}$ for some…
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively studied k-server problem. The proof is based on Ramsey-type…
In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is an algorithm for the homeomorphism…
We establish a relative version of Gromov's Vanishing Theorem in the presence of amenable open covers with small multiplicity, extending a result of Li, L\"oh, and Moraschini. Our approach relies on Gromov's theory of multicomplexes.
A topological group $G$ is extremely amenable if every continuous action of $G$ on a compact space has a fixed point. Using the concentration of measure techniques developed by Gromov and Milman, we prove that the group of automorphisms of…
In this paper, we construct a new homology theory for semi-groups satisfying the self distributivity axiom or the idempotency axiom. Next, we consider the geometric realization corresponding to the homology theory. We continue with the…
We extend Matveev's theory of complexity for 3-manifolds, based on simple spines, to (closed, orientable, locally orientable) 3-orbifolds. We prove naturality and finiteness for irreducible 3-orbifolds, and, with certain restrictions and…
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…
In our recent work we described conditions under which a multi-parameter random simplicial complex is connected and simply connected. We showed that the Betti numbers of multi-parameter random simplicial complexes in one specific dimension…
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive…