中文
相关论文

相关论文: On braxtopes, a class of generalized simplices

200 篇论文

Generalized alcoved polytopes are polytopes whose facet normals are roots in a given root system. We call a set of points in an alcoved polytope a generating set if there does not exist a strictly smaller alcoved polytope containing it. The…

组合数学 · 数学 2016-08-22 Annette Werner , Josephine Yu

Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…

组合数学 · 数学 2010-02-17 Allen Knutson , Ezra Miller , Alexander Yong

This is an expository introduction to simplicial sets and simplicial homotopy theory with particular focus on relating the combinatorial aspects of the theory to their geometric/topological origins. It is intended to be accessible to…

代数拓扑 · 数学 2023-06-12 Greg Friedman

Semi-simplicial and semi-cubical sets are commonly defined as presheaves over respectively, the semi-simplex or semi-cube category. Homotopy Type Theory then popularized an alternative definition, where the set of n-simplices or n-cubes are…

计算机科学中的逻辑 · 计算机科学 2025-07-22 Hugo Herbelin , Ramkumar Ramachandra

Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…

组合数学 · 数学 2023-07-12 Alessio D'Alì , Martina Juhnke-Kubitzke , Melissa Koch

The polymake software system deals with convex polytopes and related objects from geometric combinatorics. This note reports on a new implementation of a subclass for lattice polytopes. The features displayed are enabled by recent changes…

组合数学 · 数学 2009-02-18 Michael Joswig , Benjamin Müller , Andreas Paffenholz

In this paper we show that graphs of "neighbourly" cubical complexes -- cubical complexes in which every pair of vertices spans a (unique) cube -- have good expansion properties, using a technique based on multicommodity flows. By showing…

组合数学 · 数学 2007-05-23 Thomas Voigt

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.

组合数学 · 数学 2010-06-01 Antoine Deza , Tamon Stephen , Feng Xie

We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.

组合数学 · 数学 2024-05-08 Khanh Nguyen Duc , Nguyen Thi Ngoc Giao , Dang Tuan Hiep , Do Le Hai Thuy

We classify combinations of isolated singularities that can occur on complex cubic threefolds generalizing analogous results for cubic surfaces due to Schl\"{a}fli and Bruce--Wall. In addition, we provide concise combinatorial description…

代数几何 · 数学 2024-05-07 Sasha Viktorova

The purpose of this thesis is to study classical combinatorial objects, such as polytopes, polytopal complexes, and subspace arrangements, using tools that have been developed in combinatorial topology, especially those tools developed in…

组合数学 · 数学 2014-03-12 Karim Alexander Adiprasito

Polytope numbers for a given polytope are an integer sequence defined by the combinatorics of the polytope. Recent work by H. K. Kim and J. Y. Lee has focused on writing polytope number sequences as sums of simplex number sequences. We…

In this paper, we study the simplex faces of the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a finite poset $P$. We show that, if $P$ can be recursively constructed from $\mathbf{X}$-free posets using disjoint…

组合数学 · 数学 2025-11-06 Ragnar Freij-Hollanti , Teemu Lundström

We classify the convex polytopes whose symmetry groups have two orbits on the flags. These exist only in two or three dimensions, and the only ones whose combinatorial automorphism group is also two-orbit are the cuboctahedron, the…

度量几何 · 数学 2016-03-09 Nicholas Matteo

This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…

组合数学 · 数学 2007-05-23 Volker Kaibel , Marc E. Pfetsch

The aim of this paper is to characterize simplicial complexes which have standard graded vertex cover algebras. This property has several nice consequences for the squarefree monomial ideals defining these algebras. It turns out that such…

交换代数 · 数学 2007-05-23 Juergen Herzog , Takayuki Hibi , Ngo Viet Trung , Xinxian Zheng

We characterize the combinatorial types of stacked d-polytopes that are inscribable. Equivalently, we identify the triangulations of a simplex by stellar subdivisions that can be realized as Delaunay triangulations.

度量几何 · 数学 2011-11-23 Bernd Gonska , Günter M. Ziegler

We are generalizing to higher dimensions the Bavard-Ghys construction of the hyperbolic metric on the space of polygons with fixed directions of edges. The space of convex d-dimensional polyhedra with fixed directions of facet normals has a…

几何拓扑 · 数学 2019-02-20 Francois Fillastre , Ivan Izmestiev

Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…

组合数学 · 数学 2007-05-23 Nicolas Ressayre , Pierre-Louis Montagard

A normal subgroup of the (extended) mapping class group of a surface is said to be geometric if its automorphism group is the mapping class group. We prove that in the case of the Cantor tree surface, every normal subgroup is geometric. We…

群论 · 数学 2020-02-18 Alan McLeay