English
Related papers

Related papers: Homotopy types of box complexes

200 papers

In this article we compare the set of integer points in the homothetic copy $n\Pi$ of a lattice polytope $\Pi\subseteq\R^d$ with the set of all sums $x_1+\cdots+x_n$ with $x_1,...,x_n\in \Pi\cap\Z^d$ and $n\in\N$. We give conditions on the…

Metric Geometry · Mathematics 2010-06-11 Marko Lindner , Steffen Roch

We give an elementary proof of a weak variant of the homotopy type conjecture from [Gel04]. The proof relies on Belolipetskys estimate on the systole in terms of the volume which is a consequence of Prasads volume formula. In particular we…

Group Theory · Mathematics 2024-07-18 Tsachik Gelander , Paul Vollrath

The homotopy type of the complement of a complex coordinate subspace arrangement is studied by fathoming out the connection between its topological and combinatorial structures. A family of arrangements for which the complement is homotopy…

Algebraic Topology · Mathematics 2007-05-23 Jelena Grbic , Stephen Theriault

The notion of duality is a key element in understanding the interplay between the stability and chromatic numbers of a graph. This notion is a central aspect in the celebrated theory of perfect graphs, and is further and deeply developed in…

Combinatorics · Mathematics 2020-04-21 Nathan Benedetto Proença , Marcel K. de Carli Silva , Gabriel Coutinho

In seminal work, Lov\'asz, Spencer, and Vesztergombi [European J. Combin., 1986] proved a lower bound for the hereditary discrepancy of a matrix $A \in \mathbb{R}^{m \times n}$ in terms of the maximum $|\det(B)|^{1/k}$ over all $k \times k$…

Data Structures and Algorithms · Computer Science 2021-11-03 Haotian Jiang , Victor Reis

We give an alternative to Postnikov's homotopy classification of maps from 3-dimensional CW-complexes to homogeneous spaces G/H of Lie groups. It describes homotopy classes in terms of lifts to the group G and is suitable for extending the…

Geometric Topology · Mathematics 2012-11-26 Sergiy Koshkin

We study the indices of the geodesic central configurations on $\H^2$. We then show that central configurations are bounded away from the singularity set. With Morse's inequality, we get a lower bound for the number of central…

Classical Analysis and ODEs · Mathematics 2020-10-07 Shuqiang Zhu

This article shows several new methods for proofs on Kan complexes while using them to give a compact introduction to the homotopy groups of these complexes. Then more advanced objects are studied starting with homology and the Hurewicz…

Algebraic Topology · Mathematics 2016-08-02 Jan Steinebrunner

In this paper, we introduce relative LS category of a map and study some of its properties. Then we introduce `higher topological complexity' of a map, a homotopy invariant. We give a cohomological lower bound and compare it with previously…

Algebraic Topology · Mathematics 2020-12-15 Yuli B. Rudyak , Soumen Sarkar

A remarkable and important property of face numbers of simplicial polytopes is the generalized lower bound inequality, which says that the $h$-numbers of any simplicial polytope are unimodal. Recently, for balanced simplicial $d$-polytopes,…

Combinatorics · Mathematics 2015-03-24 Martina Juhnke-Kubitzke , Satoshi Murai

A finite-dimensional CAT(0) cube complex $X$ is equipped with several well-studied boundaries. These include the Tits boundary (which depends on the CAT(0) metric), the Roller boundary (which depends only on the combinatorial structure),…

Geometric Topology · Mathematics 2024-01-30 Talia Fernós , David Futer , Mark Hagen

We investigate vector chromatic number, Lovasz theta of the complement, and quantum chromatic number from the perspective of graph homomorphisms. We prove an analog of Sabidussi's theorem for each of these parameters, i.e. that for each of…

Combinatorics · Mathematics 2013-05-27 Chris Godsil , David Roberson , Robert Šámal , Simone Severini

We derive upper bounds for the smallest zero and lower bounds for the largest zero of Laguerre, Jacobi and Gegenbauer polynomials. Our approach uses mixed three term recurrence relations satisfied by polynomials corresponding to different…

Classical Analysis and ODEs · Mathematics 2011-11-07 K. Driver , K. Jordaan

This paper presents new lower bounds for the first general Zagreb index $Z_{\alpha}(G)$ involving two, three, and four arbitrary degrees of vertices of a simple graph $G$. For the special cases $\alpha = 2$ and $\alpha = -2$, the results…

Combinatorics · Mathematics 2025-08-21 Mamta Verma , Ravinder Kumar

We introduce a generalization of the celebrated Lov\'asz theta number of a graph to simplicial complexes of arbitrary dimension. Our generalization takes advantage of real simplicial cohomology theory, in particular combinatorial…

Combinatorics · Mathematics 2017-04-07 Christine Bachoc , Anna Gundert , Alberto Passuello

The Multiplicity conjecture of Herzog, Huneke, and Srinivasan states an upper bound for the multiplicity of any graded $k$-algebra as well as a lower bound for Cohen-Macaulay algebras. In this note we extend this conjecture in several…

Commutative Algebra · Mathematics 2007-05-23 Juan Migliore , Uwe Nagel , Tim Roemer

In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of two inputs, which essentially reduces to SET COVER. We show a…

Computational Complexity · Computer Science 2007-05-23 Joel Friedman

We prove that any metric space $X$ homeomorphic to $\mathbb{R}^2$ with locally finite Hausdorff 2-measure satisfies a reciprocal lower bound on modulus of curve families associated to a quadrilateral. More precisely, let $Q \subset X$ be a…

Metric Geometry · Mathematics 2019-01-15 Kai Rajala , Matthew Romney

In this paper we study topological lower bounds on the number of zeros of closed 1-forms without Morse type assumptions. We prove that one may always find a representing closed 1-form having at most one zero. We introduce and study a…

Differential Geometry · Mathematics 2007-05-23 Michael Farber

Denote by k_4(n) the minimal number of monochromatic copies of a K_4 in a 2-colouring of the edges of K_n and let c_4 := lim k_4(n)/\binom{n}{4}. The best known bounds so far were given by Thomason, who proved that c_4 < 1/33 \approx…

Combinatorics · Mathematics 2012-07-20 Susanne Nieß
‹ Prev 1 4 5 6 7 8 10 Next ›