English
Related papers

Related papers: Many equiprojective polytopes

200 papers

It is shown that, for each $d \geq 4$, there exists an integral convex polytope $\mathcal{P}$ of dimension $d$ such that each of the coefficients of $n, n^{2}, \ldots, n^{d-2}$ of its Ehrhart polynomial $i(\mathcal{P},n)$ is negative.…

Combinatorics · Mathematics 2016-05-03 Takayuki Hibi , Akihiro Higashitani , Akiyoshi Tsuchiya , Koutarou Yoshida

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

Combinatorics · Mathematics 2018-11-28 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…

Classical Analysis and ODEs · Mathematics 2007-12-18 Alexei Zhedanov

Ordinary polytopes were introduced by Bisztriczky as a (nonsimplicial) generalization of cyclic polytopes. We show that the colex order of facets of the ordinary polytope is a shelling order. This shelling shares many nice properties with…

Combinatorics · Mathematics 2007-05-23 Margaret M. Bayer

We consider the problem of constructing an abstract $(n+1)$-polytope $Q$ with $k$ facets isomorphic to a given $n$-polytope $P$, where $k \geq 3$. In particular, we consider the case where we want $Q$ to be $(n-2,n)$-flat, meaning that…

Combinatorics · Mathematics 2020-01-22 Gabe Cunningham

Quadratic points of a surface in the projective 3-space are the points which can be exceptionally well approximated by a quadric. They are also singularities of a 3-web in the elliptic part and of a line field in the hyperbolic part of the…

Differential Geometry · Mathematics 2017-11-30 Marcos Craizer , Ronaldo Alves Garcia

We prove that the number of vertices of a polytope of a particular kind is exponentially large in the dimension of the polytope. As a corollary, we prove that an n-dimensional centrally symmetric polytope with O(n) facets has 2^{Omega(n)}…

Combinatorics · Mathematics 2012-04-24 Alexander Barvinok

An equiangular hyperbolic Coxeter polyhedron is a hyperbolic polyhedron where all dihedral angles are equal to \pi/n for some fixed integer n at least 2. It is a consequence of Andreev's theorem that either n=3 and the polyhedron has all…

Geometric Topology · Mathematics 2014-10-01 Christopher K. Atkinson

The aim of this paper is twofold. First of all, we confirm a few basic criteria of the finiteness of real forms of a given smooth complex projective variety, in terms of the Galois cohomology set of the discrete part of the automorphism…

Algebraic Geometry · Mathematics 2023-01-27 Tien-Cuong Dinh , Cécile Gachet , Hsueh-Yung Lin , Keiji Oguiso , Long Wang , Xun Yu

In 2012 Gubeladze (Adv.\ Math.\ 2012) introduced the notion of k-convex-normal polytopes to show that integral polytopes all of whose edges are longer than 4d(d+1) have the integer decomposition property. In the first part of this paper we…

Combinatorics · Mathematics 2014-10-24 Christian Haase , Jan Hofmann

Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They…

K-Theory and Homology · Mathematics 2007-05-23 Winfried Bruns , Joseph Gubeladze

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

Complex Variables · Mathematics 2020-09-29 Purvi Gupta , Rasul Shafikov

An extended formulation of a polytope P is a polytope Q which can be projected onto P. Extended formulations of small size (i.e., number of facets) are of interest, as they allow to model corresponding optimization problems as linear…

Combinatorics · Mathematics 2012-07-10 Samuel Fiorini , Volker Kaibel , Kanstantsin Pashkovich , Dirk Oliver Theis

We investigate the existence of closed polylines (also known as closed polygonal chains or self-crossing polygons) that intersect each of their edges the same number of times. The most general question in this corner of combinatorial…

Metric Geometry · Mathematics 2026-05-19 Dmitri Fomin

An arithmetic method of proving the irrationality of smooth projective 3-folds is described, using reduction modulo $p$. It is illustrated by an application to a cubic threefold, for which the hypothesis that its intermediate Jacobian is…

Algebraic Geometry · Mathematics 2017-09-05 Dimitri Markushevich , Xavier Roulleau

According to Euler's relation any polytope P has as many faces of even dimension as it has faces of odd dimension. As a generalization of this fact one can compare the number of faces whose dimension is congruent to i modulo m with the…

Combinatorics · Mathematics 2011-07-11 Laszlo Major

2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…

Combinatorics · Mathematics 2017-12-15 Manuel Aprile , Alfonso Cevallos , Yuri Faenza

It is shown that a complex normal projective variety has non-positive Kodaira dimension if it admits a non-isomorphic quasi-polarized endomorphism. The geometric structure of the variety is described by methods of equivariant lifting and…

Algebraic Geometry · Mathematics 2018-09-24 Noboru Nakayama , De-Qi Zhang

In this paper we present a new technique to construct neighborly polytopes, and use it to prove a lower bound of ((r+d)^((r/2+d/2)^2))/(r^((r/2)^2)d^((d/2)^2)e^(3rd/4)) for the number of combinatorial types of vertex-labeled neighborly…

Metric Geometry · Mathematics 2013-08-29 Arnau Padrol

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $r<d$, as a (recursively defined)…

Computational Geometry · Computer Science 2015-03-03 Menelaos I. Karavelas , Eleni Tzanaki
‹ Prev 1 4 5 6 7 8 10 Next ›