English
Related papers

Related papers: Constrainahedra

200 papers

This paper is devoted to the classification problems concerning extended deformations of convex polyhedra and real hyperplane arrangements in the following senses: combinatorial equivalence of face posets, normal equivalence on normal fans…

Combinatorics · Mathematics 2024-08-08 Houshan Fu , Boxuan Li , Chunming Tang , Suijie Wang

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

Combinatorics · Mathematics 2019-03-05 Kevin Buchin , Man-Kwun Chiu , Stefan Felsner , Günter Rote , André Schulz

We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider…

Combinatorics · Mathematics 2024-11-05 Hugo Akitaya , Jean Cardinal , Stefan Felsner , Linda Kleist , Robert Lauff

We obtain a complete classification of hypercomplex manifolds, on which a compact group of automorphisms acts transitively. The description of the spaces as well as the proofs of our results use only the structure theory of reductive…

Differential Geometry · Mathematics 2012-04-25 George Dimitrov , Vasil Tsanov

To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…

Combinatorics · Mathematics 2017-05-08 Thomas Chappell , Tobias Friedl , Raman Sanyal

A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…

Combinatorics · Mathematics 2026-05-27 Arnau Padrol , Germain Poullot

Motivated by the theory of cluster algebras, F. Chapoton, S. Fomin and A. Zelevinsky associated to each finite type root system a simple convex polytope called \emph{generalized associahedron}. They provided an explicit realization of this…

Combinatorics · Mathematics 2012-10-24 Salvatore Stella

In 1986 Stanley associated to a poset the order polytope. The close interplay between its combinatorial and geometric properties makes the order polytope an object of tremendous interest. Double posets were introduced in 2011 by Malvenuto…

Combinatorics · Mathematics 2022-09-15 Aenne Benjes

A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…

General Mathematics · Mathematics 2007-05-23 Iosif Pinelis

A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…

Combinatorics · Mathematics 2023-03-14 Jaeho Shin

In the framework of algebraic topology the closed sequence of 4-dimensional polyhedra (algebraic polytopes) was defined. This sequence is started by the polytope {240}, discovered by Coxeter, and is determined by the second coordination…

Materials Science · Physics 2015-06-12 M. I. Samoylovich , A. L. Talis

Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group…

Metric Geometry · Mathematics 2016-03-09 Nicholas Matteo

Building sets were introduced in the study of wonderful compactifications of hyperplane arrangement complements and were later generalized to finite meet-semilattices. Convex geometries, the duals of antimatroids, offer a robust…

Combinatorics · Mathematics 2025-11-12 Spencer Backman , Richard Danner

Monotone path polytopes arise as a special case of the construction of fiber polytopes, introduced by Billera and Sturmfels. A simple example is provided by the permutahedron, which is a monotone path polytope of the standard unit cube. The…

Combinatorics · Mathematics 2016-09-07 Christos A. Athanasiadis

We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated mixed-integer set in an extended space with a quadratic…

Optimization and Control · Mathematics 2022-11-29 Linchuan Wei , Alper Atamtürk , Andrés Gómez , Simge Küçükyavuz

We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…

Numerical Analysis · Mathematics 2021-07-07 Thomas Mejstrik , Vladimir Yu. Protasov

This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…

Combinatorics · Mathematics 2022-10-24 David Richter

Let $\A$ be an arrangement of affine lines in $\C^2,$ with complement $\M(\A).$ The (co)homo-logy of $\M(\A)$ with twisted coefficients is strictly related to the cohomology of the Milnor fibre associated to the conified arrangement,…

Algebraic Topology · Mathematics 2017-03-09 M. Salvetti , M. Serventi

In this paper we construct an infinite family of homotopically rigid spaces. These examples are then used as building blocks to forge highly connected rational spaces with prescribed finite group of self-homotopy equivalences. They are also…

Algebraic Topology · Mathematics 2019-04-02 Cristina Costoya , David Méndez , Antonio Viruel

Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…

Combinatorics · Mathematics 2007-05-23 Stefan Felsner , Sarah Kappes