English
Related papers

Related papers: Homotopy groups and quantitative Sperner-type lemm…

200 papers

Let M be a closed 3-manifold which can be triangulated with N simplices. We prove that any map from M to a genus 2 surface has Hopf invariant at most C^N. Let X be a closed oriented hyperbolic 3-manifold with injectivity radius less than…

Differential Geometry · Mathematics 2009-03-16 Larry Guth

Given a suitable link map f into a manifold M, we constructed, in [10], link homotopy invariants kappa(f) and mu(f). In the present paper we study the case M=S^n x R^{m - n} in detail. Here mu(f) turns out to be the starting term of a whole…

Algebraic Topology · Mathematics 2007-05-23 Ulrich Koschorke

For positive integers $m,n, d\geq 1$ with $(m,n)\not= (1,1)$ and a field $\Bbb F$ with its algebraic closure $\overline{\Bbb F}$, let $\text{Poly}^{d,m}_n(\Bbb F)$ denote the space of all $m$-tuples $(f_1(z),\cdots ,f_m(z))\in \Bbb F [z]$…

Algebraic Topology · Mathematics 2016-12-21 Andrzej Kozlowski , Kohhei Yamaguchi

We provide a sufficient condition for the nontriviality of the Lipschitz homotopy group of the Heisenberg group, $\pi_m^{Lip}(H_n)$, in terms of properties of the classical homotopy group of the sphere, $\pi_m(S^n)$. As an application we…

Geometric Topology · Mathematics 2013-12-02 Piotr Hajlasz , Armin Schikorra , Jeremy T. Tyson

A \emph{majority coloring} of a digraph is a coloring of its vertices such that for each vertex $v$, at most half of the out-neighbors of $v$ has the same color as $v$. A digraph $D$ is \emph{majority $k$-choosable} if for any assignment of…

Combinatorics · Mathematics 2018-10-16 Marcin Anholcer , Bartłomiej Bosek , Jarosław Grytczuk

Two locally generic maps f,g : M^n --> R^{2n-1} are regularly homotopic if they lie in the same path-component of the space of locally generic maps. Our main result is that if n is not 3 and M^n is a closed n-manifold then the regular…

Geometric Topology · Mathematics 2007-05-23 Andras Juhasz

The dichromatic number of a digraph $D$ is the minimum number of colors needed to color its vertices in such a way that each color class induces an acyclic digraph. As it generalizes the notion of the chromatic number of graphs, it has been…

Combinatorics · Mathematics 2020-09-29 Pierre Aboulker , Pierre Charbit , Reza Naserasr

The partition relation N \to (n)_{\ell}^k means that whenever the k-tuples of an N-element set are \ell-colored, there is a monochromatic set of size n, where a set is called monochromatic if all its k-tuples have the same color. The…

Combinatorics · Mathematics 2009-07-03 David Conlon , Jacob Fox , Benny Sudakov

We build model structures on the category of equivariant simplicial operads with a fixed set of colors, with weak equivalences determined by families of subgroups. In particular, by specifying to the family of graph subgroups (or, more…

Algebraic Topology · Mathematics 2022-04-20 Peter Bonventre , Luis Alexandre Pereira

For a compact $(2n+1)$-dimensional smooth manifold, let $\mu_M : B Diff_\partial (D^{2n+1}) \to B Diff (M)$ be the map that is defined by extending diffeomorphisms on an embedded disc by the identity. By a classical result of Farrell and…

Algebraic Topology · Mathematics 2023-08-02 Johannes Ebert

Thompson's group F is the group of all increasing dyadic piecewise linear homeomorphisms of the closed unit interval. We compute Sigma^m(F) and Sigma^m(F;Z), the homotopical and homological Bieri-Neumann-Strebel-Renz invariants of F, and we…

Group Theory · Mathematics 2008-08-01 Robert Bieri , Ross Geoghegan , Dessislava Kochloukova

Let $m$ and $n$ be two positive integers such that $m < n$. Denote by $P_{n,k}$ the principal $Sp(n)$-bundle over $S^{4m}$ and $\mathcal{G}_{k,m}(Sp(n))$ be the gauge group of $P_{n,k}$ classified by $k\varepsilon'$, where $\varepsilon'$ is…

Algebraic Topology · Mathematics 2023-05-23 Sajjad Mohammadi

We discuss coloring and partitioning questions related to Sperner's Lemma, originally motivated by an application in hardness of approximation. Informally, we call a partitioning of the $(k-1)$-dimensional simplex into $k$ parts, or a…

Combinatorics · Mathematics 2016-11-28 Maryam Mirzakhani , Jan Vondrak

We show that any proper coloring of a Kneser graph $KG_{n,k}$ with $n-2k+2$ colors contains a trivial color (i.e., a color consisting of sets that all contain a fixed element), provided $n>(2+\varepsilon)k^2$, where $\varepsilon\to 0$ as…

Combinatorics · Mathematics 2022-08-12 Sergei Kiselev , Andrey Kupavskii

Recently Sober\'on proved a far-reaching generalization of the colorful KKM Theorem due to Gale: let $n\geq k$, and assume that a family of closed sets $(A^i_j\mid i\in [n], j\in [k])$ has the property that for every $I\in…

Combinatorics · Mathematics 2021-12-30 Daniel McGinnis , Shira Zerbib

We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates…

Combinatorics · Mathematics 2026-04-17 David Gonzalez

We work with simple graphs in ZF (Zermelo--Fraenkel set theory without the Axiom of Choice (AC)) and assume that the sets of colors can be either well-orderable or non-well-orderable to prove that the following statements are equivalent to…

Combinatorics · Mathematics 2025-07-23 Amitayu Banerjee , Zalán Molnár , Alexa Gopaulsingh

Category theory in homotopy type theory is intricate as categorical laws can only be stated "up to homotopy", and thus require coherences. The established notion of a univalent category (Ahrens, Kapulkin, Shulman) solves this by considering…

Category Theory · Mathematics 2017-10-31 Paolo Capriotti , Nicolai Kraus

The goal of this thesis is to prove that $\pi_4(S^3) \simeq \mathbb{Z}/2\mathbb{Z}$ in homotopy type theory. In particular it is a constructive and purely homotopy-theoretic proof. We first recall the basic concepts of homotopy type theory,…

Algebraic Topology · Mathematics 2016-06-21 Guillaume Brunerie

We prove that for any planar convex body C there is a positive integer m with the property that any finite point set P in the plane can be three-colored such that there is no translate of C containing at least m points of P, all of the same…

Combinatorics · Mathematics 2026-01-21 Gábor Damásdi , Dömötör Pálvölgyi