English
Related papers

Related papers: Balancing polyhedra

200 papers

We consider compact homogeneous spaces G/H of positive Euler characteristic endowed with an invariant almost complex structure J and the canonical action \theta of the maximal torus T ^{k} on G/H. We obtain explicit formula for the…

Algebraic Topology · Mathematics 2007-09-03 Victor M. Buchstaber , Svjetlana Terzic

We define symmetry classes and commutation symmetries in the Hilbert space H of the 1D spin-1/2 Heisenberg magnetic ring with N sites and investigate them by means of tools from the representation theory of symmetric groups S_N such as…

Combinatorics · Mathematics 2009-11-13 Bernd Fiedler

We show the existence of families of periodic polyhedra in spaces of constant curvature whose fundamental domains can be obtained by attaching prisms and antiprisms to Archimedean solids. These polyhedra have constant discrete curvature and…

Differential Geometry · Mathematics 2024-01-09 Christina Duffield , Daniel Freese , William Holt , Matthias Weber , Ramazan Yol

The relaxation complexity $\mathrm{rc}(X)$ of the set of integer points $X$ contained in a polyhedron is the smallest number of facets of any polyhedron $P$ such that the integer points in $P$ coincide with $X$. It is a useful tool to…

Optimization and Control · Mathematics 2021-05-27 Gennadiy Averkov , Christopher Hojny , Matthias Schymura

A closed quasigeodesic on a convex polyhedron is a closed curve that is locally straight outside of the vertices, where it forms an angle at most $\pi$ on both sides. While the existence of a simple closed quasigeodesic on a convex…

Computational Geometry · Computer Science 2022-09-29 Jean Chartier , Arnaud de Mesmay

Given a combinatorial description $C$ of a polyhedron having $E$ edges, the space of dihedral angles of all compact hyperbolic polyhedra that realize $C$ is generally not a convex subset of $\mathbb{R}^E$ \cite{DIAZ}. If $C$ has five or…

Geometric Topology · Mathematics 2007-05-23 Roland K. W. Roeder

Let $M$ be a smooth closed orientable surface. Let $F$ be the space of Morse functions on $M$ having fixed number of critical points of each index, moreover at least $\chi(M)+1$ critical points are labeled by different labels (enumerated).…

Geometric Topology · Mathematics 2021-12-06 Elena Kudryavtseva

We study the Art Gallery Problem for face guards in polyhedral environments. The problem can be informally stated as: how many (not necessarily convex) windows should we place on the external walls of a dark building, in order to completely…

Computational Geometry · Computer Science 2014-04-22 Giovanni Viglietta

We show that a $d$-dimensional polyhedron $S$ in $\real^d$ can be represented by $d$-polynomial inequalities, that is, $S = \{x \in \real^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \}$, where $p_0,...,p_{d-1}$ are appropriate polynomials.…

Algebraic Geometry · Mathematics 2010-02-05 Gennadiy Averkov , Ludwig Bröcker

Consider a finite system of non-strict polynomial inequalities with solution set $S\subseteq\mathbb R^n$. Its Lasserre relaxation of degree $d$ is a certain natural linear matrix inequality in the original variables and one additional…

Algebraic Geometry · Mathematics 2018-11-30 Tom-Lukas Kriel , Markus Schweighofer

Let $K$ be a convex body (a non-empty compact convex set) in $n$-dimensional Euclidean space. A set $B$ is called a barrier (or an `opaque set') for $K$ if every line that intersects $K$, also intersects $B$. Although this concept was…

Metric Geometry · Mathematics 2026-05-14 Markus Kiderlen

We give the quasi--Euclidean classification of the maximal (with respect to the $f$--vector) alcoved polyhedra. The $f$--vector of these maximal convex bodies is $(20,30,12)$, so they are simple dodecahedra. We find eight quasi--Euclidean…

Combinatorics · Mathematics 2020-10-09 M. J. de la Puente

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

Optimization and Control · Mathematics 2015-05-07 Alberto Del Pia , Robert Hildebrand , Robert Weismantel , Kevin Zemmer

In this short note we announce three formulas for the set of weights of various classes of highest weight modules $\V$ with highest weight \lambda, over a complex semisimple Lie algebra $\lie{g}$ with Cartan subalgebra $\lie{h}$. These…

Representation Theory · Mathematics 2013-05-20 Apoorva Khare

Given an $n$-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the $n$-gon (viewed as a disc with $n$…

Geometric Topology · Mathematics 2018-11-14 Joseph Gordon , Gaiane Panina

Define $||n||$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. The set $\mathscr{D}$ of defects, differences $\delta(n):=||n||-3\log_3 n$, is known…

Number Theory · Mathematics 2025-10-20 Harry Altman , Juan Arias de Reyna

Suppose $<A_i, \vec{c}_i>$ are planar (convex) H-polyhedra, that is, $A_i \in \mathbb{R}^{n_i \times 2}$ and $\vec{c}_i \in \mathbb{R}^{n_i}$. Let $P_i = \{\vec{x} \in \mathbb{R}^2 \mid A_i\vec{x} \leq \vec{c}_i \}$ and $n = n_1 + n_2$. We…

Computational Geometry · Computer Science 2007-05-23 Axel Simon , Andy King

For each simple Lie algebra $\mathfrak{g}$ (excluding, for trivial reasons, type ${\sf C}$) we find the lowest possible degree of an invariant second-order PDE over the adjoint variety in $\mathbb{P}\mathfrak{g}$, a homogeneous contact…

Differential Geometry · Mathematics 2017-11-29 Dmitri V. Alekseevsky , Jan Gutt , Gianni Manno , Giovanni Moreno

A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…

Metric Geometry · Mathematics 2013-02-13 Karoly Bezdek , Marton Naszodi

Various practical problems within the class $\Sigma_{2}^P$ possess an unambiguity property, meaning that yes-instances correspond with a unique witness. The semantic class containing all unambiguous $\Sigma_{2}^P$ problems is denoted…

Computational Complexity · Computer Science 2026-04-02 Matan Gilboa , Paul W. Goldberg , Elias Koutsoupias , Noam Nisan