中文
相关论文

相关论文: On the number of facets of three-dimensional Diric…

200 篇论文

In this paper we finish the intensive study of three-dimensional Dirichlet stereohedra started by the second author and D. Bochis, who showed that they cannot have more than 80 facets, except perhaps for crystallographic space groups in the…

组合数学 · 数学 2011-09-20 Pilar Sabariego , Francisco Santos

We are interested in the maximum possible number of facets that Dirichlet stereohedra for three-dimensional crystallographic groups can have. The problem for non-cubic groups was studied in previous papers by D. Bochis and the second author…

组合数学 · 数学 2009-07-07 Pilar Sabariego , Francisco Santos

We present the census of all non-orientable, closed, connected 3-manifolds admitting a rigid crystallization with at most 30 vertices. In order to obtain the above result, we generate, manipulate and compare, by suitable computer…

几何拓扑 · 数学 2012-03-02 Paola Bandieri , Paola Cristofori , Carlo Gagliardi

Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…

度量几何 · 数学 2014-03-04 Egon Schulte

A chiral polyhedron has a geometric symmetry group with two orbits on the flags, such that adjacent flags are in distinct orbits. Part I of the paper described the discrete chiral polyhedra in ordinary Euclidean 3-space with finite skew…

度量几何 · 数学 2007-05-23 Egon Schulte

In this paper, we establish that the non-zero dihedral angles of hyperbolic Coxeter polyhedra of large dimensions are not arbitrarily small. Namely, for dimensions $n\geq 32$, they are of the form $\frac{\pi}{m}$ with $m\leq 6$. Moreover,…

组合数学 · 数学 2025-07-08 Naomi Bredon

For each $d\geq 3$ we construct cube complexes homeomorphic to the $d$-sphere with $n$ vertices in which the number of facets (assuming $d$ constant) is $\Omega(n^{5/4})$. This disproves a conjecture of Kalai's stating that the number of…

组合数学 · 数学 2025-03-25 Sergey Avvakumov , Alfredo Hubard

By examining the 3 surface angles which exist at any of the 8 vertices of a Diophantine parallelepiped, and classifying them by the appearance of a right angle, it is discovered that 5 unique classes of Diophantine parallelepipeds exist. It…

数论 · 数学 2018-12-05 Randall L. Rathbun

Twinned chain polytopes form a broad class of non-centrally symmetric reflexive polytopes and exhibit intriguing structures. In the present paper, we show that the number of facets of $d$-dimensional twinned chain polytopes is at most…

组合数学 · 数学 2025-12-01 Aki Mori , Kenta Mori , Hidefumi Ohsugi

In this paper we prove that the surface of the cuboctahedron can be triangulated into 8 non-obtuse triangles and 12 acute triangles. Furthermore, we show that both bounds are the best possible.

组合数学 · 数学 2012-09-21 Xiao Feng , Liping Yuan

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

计算几何 · 计算机科学 2007-05-23 Marshall Bern , Erik D. Demaine , David Eppstein , Eric Kuo , Andrea Mantler , Jack Snoeyink

We consider compact hyperbolic Coxeter polytopes whose Coxeter diagram contains a unique dotted edge. We prove that such a polytope in d-dimensional hyperbolic space has at most d+3 facets. In view of results of Lann\'er, Kaplinskaja,…

度量几何 · 数学 2022-09-13 Anna Felikson , Pavel Tumarkin

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

几何拓扑 · 数学 2023-07-28 Yunhi Cho , Seonhwa Kim

Regular polygonal complexes in euclidean 3-space are discrete polyhedra-like structures with finite or infinite polygons as faces and with finite graphs as vertex-figures, such that their symmetry groups are transitive on the flags. The…

组合数学 · 数学 2012-10-09 Daniel Pellicer , Egon Schulte

We improve and extend to the non-orientable case a recent result of Karabas, Malicki and Nedela concerning the classification of all orientable prime 3-manifolds of Heegaard genus two, triangulated with at most 42 coloured tetrahedra.

几何拓扑 · 数学 2012-03-02 Paola Bandieri , Paola Cristofori , Carlo Gagliardi

We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d=6. This implies that for all pairs (d,n) with n-d \leq 6 the diameter of…

组合数学 · 数学 2011-08-24 David Bremner , Lars Schewe

Call {\em i-hedrite} any 4-valent n-vertex plane graph, whose faces are 2-, 3- and 4-gons only and $p_2+p_3=i$. The edges of an i-hedrite, as of any Eulerian plane graph, are partitioned by its {\em central circuits}, i.e. those, which are…

几何拓扑 · 数学 2007-05-23 M. Deza , M. Dutour , M. Shtogrin

We complete the classification of compact hyperbolic Coxeter $d$-polytopes with $d+4$ facets for $d=4$ and $5$. By previous work of Felikson and Tumarkin, the only remaining dimension where new polytopes may arise is $d=6$. We derive a new…

组合数学 · 数学 2022-10-17 Amanda Burcroff

Consider an orthogonal polyhedron, i.e., a polyhedron where (at least after a suitable rotation) all faces are perpendicular to a coordinate axis, and hence all edges are parallel to a coordinate axis. Clearly, any facial angle and any…

计算几何 · 计算机科学 2013-12-25 Therese Biedl , Martin Derka , Stephen Kiazyk , Anna Lubiw , Hamide Vosoughpour

Compact polyhedra of cubic point symmetry Oh, exhibit surfaces of planar sections (facets) characterized by normal vector families {abc} with up to 48 members each, compatible with Oh symmetry. We focus first on polyhedra confined by facets…

原子与分子团簇 · 物理学 2022-09-20 KLaus E. Hermann
‹ 上一页 1 2 3 10 下一页 ›