中文
相关论文

相关论文: Homotopy types of box complexes

200 篇论文

Let $M$ be a compact, unit volume, Riemannian manifold with boundary. In this paper we study the homology of a random \v{C}ech-complex generated by a homogeneous Poisson process in $M$. Our main results are two asymptotic threshold…

概率论 · 数学 2019-06-19 Henry-Louis de Kergorlay , Ulrike Tillmann , Oliver Vipond

We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…

代数拓扑 · 数学 2012-07-20 Mark Grant , Gregory Lupton , John Oprea

The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…

代数几何 · 数学 2007-05-23 Alexey Glutsyuk

After the first heuristic ideas about `the field of one element' F_1 and `geometry in characteristics 1' (J.~Tits, C.~Deninger, M.~Kapranov, A.~Smirnov et al.), there were developed several general approaches to the construction of…

代数几何 · 数学 2018-08-28 Yuri I. Manin , Matilde Marcolli

For a closed connected oriented manifold $M$ of dimension $2n$, it was proved by M\o ller and Raussen that the components of the mapping space from $M$ to $S^{2n}$ have exactly two different rational homotopy types. However, since this…

代数拓扑 · 数学 2023-07-14 Yichen Tong

Consider a family $\mathcal F$ of $C_{2r+1}$-free graphs, where $r\geq 2$. Suppose that each graph in $\mathcal F$ has minimum degree linear in its number of vertices. Thomassen showed that such a family has bounded chromatic number, or,…

组合数学 · 数学 2022-06-16 Maya Sankar

In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two combinatorial sharp lower bounds for ${\rm conid}({\rm B}_0(G))+1$ and ${\rm conid}({\rm B}(G))+2$, two famous topological lower bounds…

组合数学 · 数学 2016-08-01 Meysam Alishahi , Hossein Hajiabolhassan

Fix $d\ge2$ and consider a uniformly random set $P$ of $n$ points in $[0,1]^{d}$. Let $G$ be the Hasse diagram of $P$ (with respect to the coordinatewise partial order), or alternatively let $G$ be the Delaunay graph of $P$ with respect to…

组合数学 · 数学 2025-01-22 Zhihan Jin , Matthew Kwan , Lyuben Lichev

Given $0<\alpha\leq\pi$, ${\epsilon}>0$ and $n$, we define random graphs on the $d$-dimensional sphere by drawing $n$ i.i.d. uniform random points for the vertices, and edges $u {\sim} v$ whenever the geodesic distance between $u$ and $v$…

组合数学 · 数学 2022-07-29 Francisco Martinez-Figueroa

We show that the vanishing of certain cohomology groups of polyhedral complexes imply upper bounds on Ramsey numbers. Lovasz bounded the chromatic numbers of graphs using Hom complexes. Babson and Kozlov proved Lovasz conjecture and…

组合数学 · 数学 2010-02-23 Alexander Engstrom

Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…

组合数学 · 数学 2017-04-18 Aleksandar Nikolov

We derive exact and sharp lower bounds for the number of monochromatic generalized Schur triples $(x,y,x+ay)$ whose entries are from the set $\{1,\dots,n\}$, subject to a coloring with two different colors. Previously, only asymptotic…

组合数学 · 数学 2020-10-13 Christoph Koutschan , Elaine Wong

A $(d-1)$-dimensional simplicial complex $\Delta$ is balanced if its graph $G(\Delta)$ is $d$-colorable. Klee and Novik obtained the balanced lower bound theorem for balanced normal $(d-1)$-pseudomanifolds $\Delta$ with $d\geq3$ by showing…

组合数学 · 数学 2023-10-10 Ryoshun Oba

Given a finite group $G$ acting freely on a compact metric space $M$, and $\epsilon>0$, we define the $G$-Borsuk graph on $M$ by drawing edges $x\sim y$ whenever there is a non-identity $g\in G$ such that $d(x,gy)\leq\epsilon$. We show that…

组合数学 · 数学 2024-10-15 Francisco Martinez-Figueroa

Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian…

度量几何 · 数学 2022-07-15 Sergey Avvakumov , Alexey Balitskiy , Alfredo Hubard , Roman Karasev

We study the higher (sequential) topological complexity, a numerical homotopy invariant for the planar polygon spaces. For these spaces with a small genetic codes and dimension $m$, Davis showed that their topological complexity is either…

代数拓扑 · 数学 2025-09-03 Sutirtha Datta , Navnath Daundkar , Abhishek Sarkar

In this paper, as a continuation of [30], we consider the Gromov-Hausdorff convergence and collapsing in the family of compact Riemannian manifolds with boundary satisfying lower bounds on the sectional curvatures of interior manifolds,…

微分几何 · 数学 2025-04-09 Takao Yamaguchi , Zhilang Zhang

We introduce a new model for the chromatic number $\chi(G)$ based on what we call combinatorial projection matrices, which is a special class of doubly stochastic symmetric projection matrices. Relaxing this models yields an SDP whose…

最优化与控制 · 数学 2017-08-23 Francesco Silvestri

Linear upper bounds are provided for the size of the torsion homology of negatively curved manifolds of finite volume in all dimensions $d\ne 3$. This extends a classical theorem by Gromov. In dimension $3$, as opposed to the Betti numbers,…

几何拓扑 · 数学 2018-10-05 Uri Bader , Tsachik Gelander , Roman Sauer

Let $S^n$ be the $n$-sphere with the geodesic metric and of diameter $\pi$. The intrinsic \v{C}ech complex of $S^n$ at scale $r$ is the nerve of all open balls of radius $r$ in $S^n$. In this paper, we show how to control the homotopy…

代数拓扑 · 数学 2026-04-14 Henry Adams , Ekansh Jauhari , Sucharita Mallick