English
Related papers

Related papers: Non-projectability of polytope skeleta

200 papers

We design an algorithm to compute the Newton polytope of the resultant, known as resultant polytope, or its orthogonal projection along a given direction. The resultant is fundamental in algebraic elimination, optimization, and geometric…

Symbolic Computation · Computer Science 2013-04-26 Ioannis Z. Emiris , Vissarion Fisikopoulos , Christos Konaxis , Luis Peñaranda

Abstract polytopes generalize the classical notion of convex polytopes to more general combinatorial structures. The most studied ones are regular and chiral polytopes, as it is well-known, they can be constructed as coset geometries from…

Combinatorics · Mathematics 2023-04-06 Isabel Hubard , Elías Mochán

In this paper we study various scribability problems for polytopes. We begin with the classical $k$-scribability problem proposed by Steiner and generalized by Schulte, which asks about the existence of $d$-polytopes that cannot be realized…

Metric Geometry · Mathematics 2018-08-20 Hao Chen , Arnau Padrol

We construct homology theories with coefficients in L-spectra on the category of ball complexes and we define products in this setting. We also obtain signatures of geometric situations in these homology groups and prove product formulae…

Geometric Topology · Mathematics 2016-11-15 Spiros Adams-Florou , Tibor Macko

We apply the combinatorial theory of spherical varieties to characterize the momentum polytopes of polarized projective spherical varieties. This enables us to derive a classification of these varieties, without specifying the open orbit,…

Algebraic Geometry · Mathematics 2020-04-16 Stéphanie Cupit-Foutou , Guido Pezzini , Bart Van Steirteghem

Nicaise--Ottem introduced the notion of (stably) rational polytopes and studied this using a combinatorial description of the motivic volume. In this framework, we ask whether being non-stably rational is preserved under inclusions. We…

Algebraic Geometry · Mathematics 2023-11-03 Simen Westbye Moe

In the present paper we describe topological obstructions to embedding of a (complex) matrix algebra bundle into a trivial one under some additional arithmetic condition on their dimensions. We explain a relation between this problem and…

K-Theory and Homology · Mathematics 2010-08-31 A. V. Ershov

We study unbounded 2-dimensional metric polytopes such as those arising as K\"ahler quotients of complete K\"ahler 4-manifolds with two commuting symmetries and zero scalar curvature. Under a mild closedness condition, we obtain a complete…

Differential Geometry · Mathematics 2015-09-16 Brian Weber

We construct small covers and quasitoric manifolds over $n$-dimensional simple polytopes which allow proper colorings of facets with $n$ colors. We calculate Stiefel-Whitney classes of these manifolds as obstructions to immersions and…

Algebraic Topology · Mathematics 2016-04-29 Djordje Baralic , Vladimir Grujic

Well-known operations defined on a non-degenerate inner product vector space are extended to the case of a degenerate inner product. The main obstructions to the extension of these operations to the degenerate case are (1) the index…

Mathematical Physics · Physics 2011-12-30 Ovidiu Cristinel Stoica

The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…

Computational Geometry · Computer Science 2024-08-07 Mikkel Abrahamsen , Tillmann Miltzow , Nadja Seiferth

Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…

Geometric Topology · Mathematics 2007-05-29 Jaejeong Lee

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

Combinatorics · Mathematics 2017-03-14 Greg Kuperberg , Shachar Lovett , Ron Peled

This is a survey of our research on geometric structures of projective embeddings and includes some topics of our talks in several symposia during 1990-99. We clarify our main problem, which is to construct a kind of geometric composition…

Algebraic Geometry · Mathematics 2007-05-23 Takeshi Usa

This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.

Metric Geometry · Mathematics 2021-10-05 Sergii Myroshnychenko

Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…

Combinatorics · Mathematics 2007-05-23 Michael Joswig , G"unter M. Ziegler

We construct a K3 surface whose transcendental lattice has a self-isomorphism which is not a linear combination of self-isomorphisms over $\mathbb{Q}$ which preserve cup products up to nonzero multiples. Products of it with itself give…

Algebraic Geometry · Mathematics 2007-05-23 K. H. Kim , F. W. Roush

In geometric, algebraic, and topological combinatorics, the unimodality of combinatorial generating polynomials is frequently studied. Unimodality follows when the polynomial is (real) stable, a property often deduced via the theory of…

Combinatorics · Mathematics 2020-06-26 Max Hlavacek , Liam Solus

Reflexive lattice polytopes play a key role in combinatorics, algebraic geometry, physics, and other areas. One important class of lattice polytopes are lattice simplices defining weighted projective spaces. We investigate the question of…

Combinatorics · Mathematics 2022-11-23 Benjamin Braun , Robert Davis , Derek Hanely , Morgan Lane , Liam Solus

A famous theorem in polytope theory states that the combinatorial type of a simplicial polytope is completely determined by its facet-ridge graph. This celebrated result was proven by Blind and Mani in 1987, via a non-constructive proof…

Combinatorics · Mathematics 2022-07-01 Cesar Ceballos , Joseph Doolittle