中文
相关论文

相关论文: Representing the Sporadic Archimedean Polyhedra as…

200 篇论文

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

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

泛函分析 · 数学 2010-10-13 Maxim V. Balashov , Dušan Repovš

We give combinatorial models for the homotopy type of complements of elliptic arrangements (i.e., certain sets of abelian subvarieties in a product of elliptic curves). We give a presentation of the fundamental group of such spaces and, as…

代数拓扑 · 数学 2021-08-25 Emanuele Delucchi , Roberto Pagaria

We introduce the notion of an arithmetic matroid, whose main example is given by a list of elements of a finitely generated abelian group. In particular we study the representability of its dual, providing an extension of the Gale duality…

组合数学 · 数学 2011-07-26 Michele D'Adderio , Luca Moci

Generalized permutahedra are the polytopes obtained from the permutahedron by changing the edge lengths while preserving the edge directions, possibly identifying vertices along the way. We introduce a "lifting" construction for these…

组合数学 · 数学 2013-02-25 Federico Ardila , Jeffrey Doker

We ask which degree sequences admit a unique realisation as a $3$-polytopal graph (polyhedron) on $p$ vertices. We give an exhaustive list of these sequences for the case where one degree equals $p-1$ and exactly two or three of them equal…

组合数学 · 数学 2022-07-06 Riccardo W. Maffucci

For any $r\geq 1$ and $\mathbf{n} \in \mathbb{Z}_{\geq0}^r \setminus \{\mathbf0\}$ we construct a poset $W_{\mathbf{n}}$ called a 2-associahedron. The 2-associahedra arose in symplectic geometry, where they are expected to control maps…

辛几何 · 数学 2019-03-20 Nathaniel Bottman

Numerical algebraic geometry revolves around the study of solutions to polynomial systems via numerical methods. The polyhedral homotopy of Huber and Sturmfels for computing isolated solutions and the concept of witness sets as numerical…

代数几何 · 数学 2025-09-29 Tianran Chen

We use the Legendre polynomials and the Hermite polynomials as two examples to illustrate a simple and systematic technique on deriving asymptotic formulas for orthogonal polynomials via recurrence relations. Another application of this…

经典分析与常微分方程 · 数学 2011-01-25 X. -S. Wang , R. Wong

In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…

组合数学 · 数学 2023-06-22 Gunnar Brinkmann , Thomas Tucker , Nico Van Cleemput

A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le \pi$ surface to each side at every point. In contrast, a geodesic has exactly $\pi$ to each side and so can never pass through a vertex, whereas quasigeodesics…

We introduce the concept of pseudo-trisections of smooth oriented compact 4-manifolds with boundary. The main feature of pseudo-trisections is that they have lower complexity than relative trisections for given 4-manifolds. We prove…

几何拓扑 · 数学 2025-02-19 Shintaro Fushida-Hardy

A \textit{geometric realization} of an abstract polyhedron $\mathcal{P}$ is a mapping $\rho : \mathcal{P} \to \mathbb{E}^3$ that sends an $i$-face to an open set of dimension $i$. This work adapts a method based on Wythoff construction to…

群论 · 数学 2019-10-28 Jonn Angel L. Aranas , Mark L. Loyola

This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

度量几何 · 数学 2007-05-23 Hartwig Bosse , Martin Groetschel , Martin Henk

We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider…

组合数学 · 数学 2024-11-05 Hugo Akitaya , Jean Cardinal , Stefan Felsner , Linda Kleist , Robert Lauff

It is well-known that pythagorean triples can be represented by points of the unit circle with rational coordinates. These points form an abelian group, and we describe its structure. This structural description yields, almost immediately,…

数论 · 数学 2022-01-11 Amnon Yekutieli

The main result of this note is an efficient presentation of the $S^1$-equivariant cohomology ring of Peterson varieties (in type $A$) as a quotient of a polynomial ring by an ideal $\mathcal{J}$, in the spirit of the well-known Borel…

代数几何 · 数学 2015-08-07 Yukiko Fukukawa , Megumi Harada , Mikiya Masuda

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 convex polyhedron, that is, a compact convex subset of $\mathbb{R}^3$ which is the intersection of finitely many closed half-spaces, can be rectified by taking the convex hull of the midpoints of the edges of the polyhedron. We derive…

度量几何 · 数学 2016-04-05 Samuel Reid