中文
相关论文

相关论文: Trianguloids and Triangulations of Root Polytopes

200 篇论文

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

组合数学 · 数学 2012-06-05 H. K. Kim , J. Y. Lee

Cayley polytopes were defined recently as convex hulls of Cayley compositions introduced by Cayley in 1857. In this paper we resolve Braun's conjecture, which expresses the volume of Cayley polytopes in terms of the number of connected…

组合数学 · 数学 2011-08-10 Matjaz Konvalinka , Igor Pak

The spaces of triangulations of a given manifold have been widely studied. The celebrated theorem of Pachner~\cite{Pachner} says that any two triangulations of a given manifold can be connected by a sequence of bistellar moves, or Pachner…

几何拓扑 · 数学 2020-12-22 D. A. Fedoseev , I. M. Nikonov , V. O. Manturov

A sweep of a point configuration is any ordered partition induced by a linear functional. Posets of sweeps of planar point configurations were formalized and abstracted by Goodman and Pollack under the theory of allowable sequences of…

组合数学 · 数学 2023-10-26 Arnau Padrol , Eva Philippe

A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…

Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…

组合数学 · 数学 2020-07-15 Tianran Chen , Evgeniia Korchevskaia

We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…

组合数学 · 数学 2017-02-06 Andrei Asinowski , Christian Krattenthaler , Toufik Mansour

We describe a framework that unifies the two types of polynomials introduced respectively by Bacher and Mouton and by Rutschmann and Wettstein to analyze the number of triangulations of point sets. Using this insight, we generalize the…

计算几何 · 计算机科学 2025-04-15 Hong Duc Bui

Tropical oriented matroids were defined by Ardila and Develin in 2007. They are a tropical analogue of classical oriented matroids in the sense that they encode the properties of the types of points in an arrangement of tropical hyperplanes…

组合数学 · 数学 2012-12-11 Silke Horn

There is a well-established dictionary between zonotopes, hyperplane arrangements, and their (oriented) matroids. Arguably one of the most famous examples is the class of graphical zonotopes, also called acyclotopes, which encode…

组合数学 · 数学 2024-09-24 Eleonore Bach , Matthias Beck , Sophie Rehberg

After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…

组合数学 · 数学 2007-05-23 Roland Bacher

We prove that in any $\mathbb{Z}^n$-periodic triangulation of $\mathbb{R}^n$ the number of $\mathbb{Z}^n$-orbits of $n$-dimensional simplices is at least the tensor rank of the $n$th determinant tensor. The latter is known to be at least…

组合数学 · 数学 2025-09-29 Sergey Avvakumov , Roman Karasev

The Birkhoff polytope, defined to be the convex hull of $n\times n$ permutation matrices, is a well studied polytope in the context of the Ehrhart theory. This polytope is known to have many desirable properties, such as the Gorenstein…

组合数学 · 数学 2019-06-06 Florian Kohl , McCabe Olsen

Hypersimplices are well-studied objects in combinatorics, optimization, and representation theory. For each hypersimplex, we define a new family of subpolytopes, called r-stable hypersimplices, and show that a well-known regular unimodular…

组合数学 · 数学 2016-03-17 Benjamin Braun , Liam Solus

The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…

组合数学 · 数学 2012-08-21 Alon Regev

This paper introduces path triangulation of points in a bounded, simply connected surface region, replacing ordinary triangles in a Delaunay triangulation with path triangles from homotopy theory. A {\bf path triangle} has a border that is…

代数拓扑 · 数学 2022-08-29 James F. Peters

Maximal $(k+1)$-crossing-free graphs on a planar point set in convex position, that is, $k$-triangulations, have received attention in recent literature, with motivation coming from several interpretations of them. We introduce a new way of…

组合数学 · 数学 2012-06-14 Vincent Pilaud , Francisco Santos

We show that indecomposable two-term presilting complexes over $\Pi_{n}$, the preprojective algebra of $A_{n}$, are in bijection with internal $n$-simplices in the prism $\Delta_{n} \times \Delta_{1}$, the product of an $n$-simplex with a…

表示论 · 数学 2022-11-15 Osamu Iyama , Nicholas J. Williams

We characterize all possible relative positions between a hyperboloid of one sheet and a sphere through the roots of a characteristic polynomial associated to these quadrics. The classification is also suitable for a hyperboloid and a…

Triangulations of the 5-gon with no separating triangle nor quadrangle, so called 5c-triangulations, are a planar map family closely related to 5-connected planar triangulations. We show that 5c-triangulations are in bijection with…

组合数学 · 数学 2025-10-29 Éric Fusy