中文
相关论文

相关论文: A Class of Convex Polyhedra with Few Edge Unfoldin…

200 篇论文

Polypolyhedra (after R. Lang) are compounds of edge-transitive 1-skeleta. There are 54 topologically different polypolyhedra, and each has icosidodecahedral, cuboctahedral, or tetrahedral symmetry, all are realizable as modular origami…

度量几何 · 数学 2016-01-14 Sarah-Marie Belcastro , Thomas C. Hull

We classify closed, simply-connected, non-negatively curved 6-manifolds of almost maximal symmetry rank up to equivariant diffeomorphism.

微分几何 · 数学 2017-11-16 Christine Escher , Catherine Searle

An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements…

离散数学 · 计算机科学 2010-08-17 Bill Rosgen , Lorna Stewart

For any $n\geq 6$ we construct almost strongly minimal geometries of type $\bullet \overset{n}{-} \bullet \overset{n}{-}\bullet$ which are $2$-ample but not $3$-ample.

逻辑 · 数学 2017-10-05 Katrin Tent , Isabel Müller

Two single parameter families of polyhedra $P(\psi)$ are constructed in three dimensional spaces of constant curvature $C(\psi)$. Identification of the faces of the polyhedra via isometries results in cone manifolds $M(\psi)$ which are…

几何拓扑 · 数学 2007-05-23 A Aalam

We consider the combinatorial question of how many convex polygons can be made by using the edges taken from a fixed triangulation of n vertices. For general triangulations, there can be exponentially many: we show a construction that has…

离散数学 · 计算机科学 2012-09-19 Marc van Kreveld , Maarten Löffler , János Pach

It is well known that the set of possible degree sequences for a graph on $n$ vertices is the intersection of a lattice and a convex polytope. We show that the set of possible degree sequences for a $k$-uniform hypergraph on $n$ vertices is…

组合数学 · 数学 2012-01-31 Ricky Ini Liu

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

度量几何 · 数学 2020-02-20 Lyle Ramshaw , James B. Saxe

We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are…

概率论 · 数学 2017-08-23 Nguyen Tuan Minh , Stanislav Volkov

We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…

组合数学 · 数学 2023-12-05 Jacob Fox , Janos Pach , Andrew Suk

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…

Given n >= 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the others.

离散数学 · 计算机科学 2011-01-06 Joseph O'Rourke

We present an algorithm that enumerates and classifies all edge-to-edge gluings of unit squares that correspond to convex polyhedra. We show that the number of such gluings of $n$ squares is polynomial in $n$, and the algorithm runs in time…

计算几何 · 计算机科学 2021-11-30 Stefan Langerman , Nicolas Potvin , Boris Zolotov

Motivated by a recent groundbreaking work of Ontaneda, we describe a sizable class of closed manifolds such that the product of each manifold in the class with the real line admits a complete metric of bounded negative sectional curvature…

微分几何 · 数学 2014-08-05 Igor Belegradek

Let X be a 2-dimensional simplicial complex. The degree of an edge e is the number of 2-faces of X containing e. The complex X is an \epsilon-expander if the coboundary d_1(\phi) of every Z_2-valued 1-cochain \phi \in C^1(X;Z_2) satisfies…

组合数学 · 数学 2013-07-16 Alexander Lubotzky , Roy Meshulam

We classify edge-to-edge tilings of the sphere by congruent almost equilateral pentagons, in which four edges have the same length. Together with our earlier classifications of edge-to-edge tilings of the sphere by congruent equilateral…

组合数学 · 数学 2024-02-09 Hoi Ping Luk , Min Yan

We give a simple construction of new, complete, finite volume manifolds $M$ of bounded, nonpositive curvature. These manifolds have ends that look like a mixture of locally symmetric ends of different ranks and their fundamental groups are…

几何拓扑 · 数学 2021-03-17 Grigori Avramidi , T. Tam Nguyen Phan

The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…

几何拓扑 · 数学 2007-05-23 William P. Thurston

A new parametric surface representation is proposed that interpolates the vertices of a given closed mesh of arbitrary topology. Smoothly connecting quadrilateral patches are created by blending local, multi-sided quadratic interpolants. In…

计算几何 · 计算机科学 2026-01-28 Péter Salvi

This is a survey of topological properties of open, complete nonpositively curved manifolds which may have infinite volume. Topics include topology of ends, restrictions on the fundamental group, as well as a review of known examples.

微分几何 · 数学 2014-08-05 Igor Belegradek