English
Related papers

Related papers: Constrainahedra

200 papers

Let k be a regular F_p-algebra, let A = k[x,y]/(x^b - y^a) be the coordinate ring of a planar cuspical curve, and let I = (x,y) be the ideal that defines the cusp point. We give a formula for the relative K-groups K_q(A,I) in terms of the…

K-Theory and Homology · Mathematics 2015-03-27 Lars Hesselholt

For a Euclidean building $X$ of type $A_{2}$, we classify the 0-dimensional subbuildings $A$ of $\partial_{T}X$ that occur as the asymptotic boundary of closed convex subsets. In particular, we show that triviality of the holonomy of a…

Metric Geometry · Mathematics 2007-05-23 Andreas Balser

This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…

Optimization and Control · Mathematics 2025-01-10 Alberto Del Pia , Aida Khajavirad

We classify all convex polyomino ideals which are linearly related or have a linear resolution. Convex stack polyominoes whose ideals are extremal Gorenstein are also classified. In addition, we characterize, in combinatorial terms, the…

Commutative Algebra · Mathematics 2014-03-19 Viviana Ene , Jürgen Herzog , Takayuki Hibi

We give a complete description of all convex polyhedra whose surface can be constructed from several congruent regular pentagons by folding and gluing them edge to edge. Our method of determining the graph structure of the polyhedra from a…

Computational Geometry · Computer Science 2020-07-06 Elena Arseneva , Stefan Langerman , Boris Zolotov

We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results about coloring point sets such that any member of the family…

Metric Geometry · Mathematics 2014-03-17 Balázs Keszegh , Dömötör Pálvölgyi

We study the monodromies and the limit mixed Hodge structures of families of complete intersection varieties over a punctured disk in the complex plane. For this purpose, we express their motivic nearby fibers in terms of the geometric data…

Algebraic Geometry · Mathematics 2021-03-11 Takahiro Saito , Kiyoshi Takeuchi

Given a hypersurface coamoeba of a Laurent polynomial f, it is an open problem to describe the structure of its set of connected complement components. In this paper we approach this problem by introducing the lopsided coamoeba. We show…

Algebraic Geometry · Mathematics 2014-01-21 Jens Forsgård , Petter Johansson

Generalized associahedra are a well-studied family of polytopes associated to a finite-type cluster algebra and choice of starting cluster. We show that the generalized associahedra constructed by Padrol, Palu, Pilaud, and Plamondon,…

Combinatorics · Mathematics 2024-02-07 Michael Gekhtman , Hugh Thomas

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

Combinatorics · Mathematics 2007-05-23 David Orden , Francisco Santos

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

Computational Geometry · Computer Science 2016-08-12 David Eppstein , Elena Mumford

A well-known construction of associahedra comes from truncations of simplices. Motivated by compactifications of point configurations, we show associahedra as truncations of certain products of simplices. This is then used to provide a…

Mathematical Physics · Physics 2011-09-14 Satyan L. Devadoss

Continuing a well established tradition of associating convex bodies to monomial ideals, we initiate a program to construct asymptotic Newton polyhedra from decompositions of monomial ideals. This is achieved by forming a graded family of…

There are many open problems and some mysteries connected to the realizations of the associahedra as convex polytopes. In this note, we describe three -- concerning special realizations with the vertices on a sphere, the space of all…

Combinatorics · Mathematics 2011-10-19 Cesar Ceballos , Günter M. Ziegler

We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well as higher-order maps. We show…

Combinatorics · Mathematics 2023-04-05 Niklas Kochdumper , Matthias Althoff

An antinorm is a concave analogue of a norm. In contrast to norms, antinorms are not defined on the entire space $R^d$ but on a cone $K\subset R^d$. They are applied in the matrix analysis, optimal control, and dynamical systems. Their…

Metric Geometry · Mathematics 2024-07-08 Maxim Makarov , Vladimir Yu. Protasov

In this paper, we study the stable homotopy types of $\mathbf{F}^4_{n(2)}$-polyhedra, i.e., $(n-1)$-connected, at most $(n+4)$-dimensional polyhedra with 2-torsion free homologies. We are able to classify the indecomposable…

Algebraic Topology · Mathematics 2016-06-29 Jianzhong Pan , Zhongjian Zhu

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

Combinatorics · Mathematics 2021-10-29 C P Anil Kumar

The convex hull generated by the restriction to the unit ball of a stationary Poisson point process in the $d$-dimensional Euclidean space is considered. By establishing sharp bounds on cumulants, exponential estimates for large deviation…

Probability · Mathematics 2015-12-15 Julian Grote , Christoph Thaele

Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this…

Computational Geometry · Computer Science 2025-10-16 Boris Aronov , Sang Won Bae , Sergio Cabello , Otfried Cheong , David Eppstein , Christian Knauer , Raimund Seidel