中文
相关论文

相关论文: Quotients of a Universal Locally Projective Polyto…

200 篇论文

This article announces the completion of the classification of rank 4 locally projective polytopes and their quotients. There are seventeen universal locally projective polytopes (nine nondegenerate). Amongst their 441 quotients are a…

组合数学 · 数学 2007-05-23 Michael I Hartley

We augment the list of finite universal locally toroidal regular polytopes of type {3,3,4,3,3} due to P.McMullen and E.Schulte, adding as well as removing entries. This disproves a related long-standing conjecture. Our new universal…

群论 · 数学 2017-07-05 Dmitrii V. Pasechnik

We prove that every polytope described by algebraic coordinates is the face of a projectively unique polytope. This provides a universality property for projectively unique polytopes. Using a closely related result of Below, we construct a…

度量几何 · 数学 2013-06-14 Karim Alexander Adiprasito , Arnau Padrol

In this paper, we obtain a complete classification of 331 finite-volume hyperbolic Coxeter 4-dimensional polytopes with 7 facets.

几何拓扑 · 数学 2024-12-24 Jiming Ma , Fangting Zheng

We give a complete enumeration of all 2-neighborly $d$-polytopes with $d+9$ and less facets. All of them are realized as 0/1-polytopes, except a 6-polytope $P_{6,10,15}$ with 10 vertices and 15 facets, and pyramids over $P_{6,10,15}$. In…

组合数学 · 数学 2019-12-10 Aleksandr N. Maksimenko , Dmitry V. Gribanov , Dmitry S. Malyshev

We show that every non-degenerate regular polytope can be used to construct a thin, residually-connected, chamber-transitive incidence geometry, i.e. a regular hypertope, with a tail-triangle Coxeter diagram. We discuss several interesting…

组合数学 · 数学 2020-01-31 Antonio Montero , Asia Ivić Weiss

Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating…

度量几何 · 数学 2021-12-21 Spencer Whitehead

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

度量几何 · 数学 2021-12-16 Csaba Vincze , Márk Oláh , Letícia Lengyel

A polytope is called a Coxeter polytope if its dihedral angles are integer parts of $\pi$. In this paper we prove that if a non-compact Coxeter polytope of finite volume in $H^n$ has exactly $n+3$ facets then $n\le 16$. We also find an…

度量几何 · 数学 2019-10-30 Pavel Tumarkin

A polytope is called {\em regular-faced} if every one of its facets is a regular polytope. The 4-dimensional regular-faced polytopes were determined by G. Blind and R. Blind \cite{BlBl2,roswitha,roswitha2}. The last class of such polytopes…

度量几何 · 数学 2011-11-10 Mathieu Dutour Sikirić , Wendy Myrvold

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…

组合数学 · 数学 2022-10-24 David Richter

We report here a computation giving the complete list of facets for the cut polytopes over several very symmetric graphs with $15-30$ edges, including $K_8$, $K_{3,3,3}$, $K_{1,4,4}$, $K_{5,5}$, some other $K_{l,m}$, $K_{1,l,m}$, $Prism_7,…

组合数学 · 数学 2015-05-15 Michel Deza , Mathieu Dutour Sikiric

Given a lattice $L$, a full dimensional polytope $P$ is called a {\em Delaunay polytope} if the set of its vertices is $S\cap L$ with $S$ being an {\em empty sphere} of the lattice. Extending our previous work \cite{DD-hyp} on the {\em…

度量几何 · 数学 2007-05-23 M. Dutour

We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…

度量几何 · 数学 2011-11-21 Alexander Barvinok , Seung Jin Lee , Isabella Novik

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

度量几何 · 数学 2026-03-10 Steven Hoehner

In this paper, we obtain a complete classification of compact hyperbolic Coxeter five-dimensional polytopes with nine facets.

几何拓扑 · 数学 2022-11-23 Jiming Ma , Fangting Zheng

We give a complete enumeration of all 2-neighborly 0/1-polytopes of dimension 7. There are 13 959 358 918 different 0/1-equivalence classes of such polytopes. They form 5 850 402 014 combinatorial classes and 1 274 089 different f-vectors.…

组合数学 · 数学 2019-04-09 Aleksandr Maksimenko

Through tropical normal idempotent matrices, we introduce isocanted alcoved polytopes, computing their $f$--vectors and checking the validity of the following five conjectures: B\'{a}r\'{a}ny, unimodality, $3^d$, flag and cubical lower…

组合数学 · 数学 2020-09-30 María Jesús de la Puente , Pedro Luis Clavería

This paper is devoted to the study the $m$-point homogeneity property and the point homogeneity degree for finite metric spaces. Since the vertex sets of regular polytopes, as well as of some their generalizations, are homogeneous, we pay…

度量几何 · 数学 2024-06-13 Valerii N. Berestovskii , Yurii G. Nikonorov

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…

组合数学 · 数学 2007-05-23 Stefan Felsner , Sarah Kappes
‹ 上一页 1 2 3 10 下一页 ›