English
Related papers

Related papers: Shellability, Ehrhart Theory, and $r$-stable Hyper…

200 papers

This work is to provide a comprehensive treatment of the relationship between the theory of the generalized (palindromic) eigenvalue problem and the theory of the Sylvester-type equations. Under a regularity assumption for a specific matrix…

Numerical Analysis · Mathematics 2014-12-03 Matthew M. Lin , Chun-Yueh Chiang

Renormalized homotopy continuation on toric varieties is introduced as a tool for solving sparse systems of polynomial equations, or sparse systems of exponential sums. The cost of continuation depends on a renormalized condition length,…

Numerical Analysis · Mathematics 2025-06-23 Gregorio Malajovich

For a simplicial complex $\Delta$, we introduce a simplicial complex attached to $\Delta$, called the expansion of $\Delta$, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the…

Commutative Algebra · Mathematics 2016-01-05 Somayeh Moradi , Fahimeh Khosh-Ahang

Orthogonal polynomials with respect to the hypergeometric distribution on lattices in polyhedral domains in ${\mathbb R}^d$, which include hexagons in ${\mathbb R}^2$ and truncated tetrahedrons in ${\mathbb R}^3$, are defined and studied.…

Classical Analysis and ODEs · Mathematics 2020-02-13 Plamen Iliev , Yuan Xu

Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart…

Combinatorics · Mathematics 2017-11-30 Benjamin Braun

Given a triangulation of a closed, oriented, irreducible, atoroidal 3-manifold every oriented, incompressible surface may be isotoped into normal position relative to the triangulation. Such a normal oriented surface is then encoded by…

Geometric Topology · Mathematics 2007-06-06 Daryl Cooper , Stephan Tillmann

We give a combinatorial proof of an identity that involves Eulerian numbers and was obtained algebraically by Brenti and Welker (2009). To do so, we study alcoved triangulations of dilated hypersimplices. As a byproduct, we describe the…

Combinatorics · Mathematics 2025-03-31 Jerónimo Valencia-Porras

The type A_n full root polytope is the convex hull in R^{n+1} of the origin and the points e_i-e_j for 1<= i<j <= n+1. Given a tree T on the vertex set [n+1], the associated root polytope P(T) is the intersection of the full root polytope…

Combinatorics · Mathematics 2009-09-02 Karola Meszaros

We investigate the hypercohomologies of truncated twisted holomorphic de Rham complexes on (not necessarily compact) complex manifolds. In particular, we generalize Leray-Hirsch, K\"{u}nneth and Poincar\'{e}-Serre duality theorems on them.…

Algebraic Geometry · Mathematics 2020-06-02 Lingxu Meng

We analyze the BPS equations in the ``superstratum sector'' of three-dimensional gauged supergravity. We obtain multi-parameter supersymmetric solutions that include elliptical deformations of the supertubes that underlie standard…

High Energy Physics - Theory · Physics 2022-09-28 Bogdan Ganchev , Anthony Houppe , Nicholas P. Warner

The Eulerian polynomials and derangement polynomials are two well-studied generating functions that frequently arise in combinatorics, algebra, and geometry. When one makes an appearance, the other often does so as well, and their…

Combinatorics · Mathematics 2020-04-14 Nils Gustafsson , Liam Solus

We study a class of mechanisms known as Kokotsakis polyhedra with a quadrangular base. These are $3\times3$ quadrilateral meshes whose faces are rigid bodies and joined by hinges at the common edges. In contrast to existing work, the…

Algebraic Geometry · Mathematics 2026-03-09 Yang Liu

We discover that tautological intersection numbers on $\bar{\mathcal{M}}_{g, n}$, the moduli space of stable genus $g$ curves with $n$ marked points, are evaluations of Ehrhart polynomials of partial polytopal complexes. In order to prove…

Algebraic Geometry · Mathematics 2022-09-29 Adam Afandi

A family of one-vertex triangulations of 3-manifolds, layered-triangulations, is defined. Layered-triangulations are first described for handlebodies and then extended to all 3-manifolds via Heegaard splittings. A complete and detailed…

Geometric Topology · Mathematics 2007-05-23 William Jaco , J. Hyam Rubinstein

This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…

Combinatorics · Mathematics 2010-06-15 Edward D. Kim

We present algorithms to classify isolated hypersurface singularities over the real numbers according to the classification by V.I. Arnold (Arnold et al., 1985). This first part covers the splitting lemma and the simple singularities; a…

Algebraic Geometry · Mathematics 2016-01-15 Magdaleen S. Marais , Andreas Steenpass

We present a partial description of which polytopes are reconstructible from their graphs. This is an extension of work by Blind and Mani (1987) and Kalai (1988), which showed that simple polytopes can be reconstructed from their graphs. In…

Combinatorics · Mathematics 2017-02-21 Joseph Doolittle

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…

Combinatorics · Mathematics 2019-06-06 Florian Kohl , McCabe Olsen

An important combinatorial result in equivariant cohomology and $K$-theory Schubert calculus is represented by the formulas of Billey and Graham-Willems for the localization of Schubert classes at torus fixed points. These formulas work…

Algebraic Geometry · Mathematics 2017-11-01 Cristian Lenart , Kirill Zainoulline

This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…

Combinatorics · Mathematics 2010-11-09 Velleda Baldoni , Nicole Berline , Jesús A. De Loera , Matthias Köppe , Michèle Vergne