English
Related papers

Related papers: Sweeping the cd-Index and the Toric h-Vector

200 papers

The $k$-secant degree is studied with a combinatorial approach. A planar toric degeneration of any projective toric surface $X$ corresponds to a regular unimodular triangulation $D$ of the polytope defining $X$. If the secant ideal of the…

Algebraic Geometry · Mathematics 2010-12-14 Elisa Postinghel

We introduce \textcolor{red}{general} new techniques for computing the geometric index of a link $L$ in the interior of a solid torus $T$. These techniques simplify and unify previous ad hoc methods used to compute the geometric index in…

Geometric Topology · Mathematics 2017-11-15 Kathryn B. Andrist , Dennis J. Garity , Dušan D. Repovš , David G. Wright

Suppose $<A_i, \vec{c}_i>$ are planar (convex) H-polyhedra, that is, $A_i \in \mathbb{R}^{n_i \times 2}$ and $\vec{c}_i \in \mathbb{R}^{n_i}$. Let $P_i = \{\vec{x} \in \mathbb{R}^2 \mid A_i\vec{x} \leq \vec{c}_i \}$ and $n = n_1 + n_2$. We…

Computational Geometry · Computer Science 2007-05-23 Axel Simon , Andy King

The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…

Geometric Topology · Mathematics 2017-12-12 Stavros Garoufalidis , Ezra Getzler

A unit-vector field n on a convex three-dimensional polyhedron P is tangent if, on the faces of P, n is tangent to the faces. A homotopy classification of tangent unit-vector fields continuous away from the vertices of P is given. The…

Mathematical Physics · Physics 2009-11-10 JM Robbins , M Zyskin

In the paper we develop new methods for calculating the two well-known topological indices, the degree-distance and the Gutman index. Firstly, we prove that the Wiener index of a double vertex-weighted graph can be computed from the Wiener…

Combinatorics · Mathematics 2019-04-09 Simon Brezovnik , Niko Tratnik

We consider the following problem in computational geometry: given, in the d-dimensional real space, a set of points marked as positive and a set of points marked as negative, such that the convex hull of the positive set does not intersect…

Optimization and Control · Mathematics 2024-07-30 Michele Barbato , Alberto Ceselli , Rosario Messana

Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors…

Computational Geometry · Computer Science 2008-12-13 Alain Finkel , Jérôme Leroux

The standard approach for computing the trace of the inverse of a very large, sparse matrix $A$ is to view the trace as the mean value of matrix quadratures, and use the Monte Carlo algorithm to estimate it. This approach is heavily used in…

High Energy Physics - Lattice · Physics 2013-02-19 Andreas Stathopoulos , Jesse Laeuchli , Kostas Orginos

The canonical polyadic decomposition (CPD) is a fundamental tensor decomposition which expresses a tensor as a sum of rank one tensors. In stark contrast to the matrix case, with light assumptions, the CPD of a low rank tensor is…

Numerical Analysis · Mathematics 2022-02-24 Eric Evert , Michiel Vandecappelle , Lieven De Lathauwer

We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…

Combinatorics · Mathematics 2022-12-16 Chris Godsil , Krystal Guo , Gordon Royle

We elaborate an explicit version of the relative trace formula on $\PGL(2)$ over a totally real number field for the toral periods of Hilbert cusp forms along the diagonal split torus. As an application, we prove (i) a spectral…

Number Theory · Mathematics 2022-10-19 Shingo Sugiyama , Masao Tsuzuki

We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in…

Metric Geometry · Mathematics 2007-05-23 Alexander Barvinok , Ellen Veomett

Given any finite simplicial complex \Delta, we show how to construct a new simplicial complex \Delta_{\chi} that is balanced and vertex decomposable. Moreover, we show that the h-vector of the simplicial complex \Delta_{\chi} is precisely…

Commutative Algebra · Mathematics 2012-07-19 Jennifer Biermann , Adam Van Tuyl

We introduce the notion of a weighted $\delta$-vector of a lattice polytope. Although the definition is motivated by motivic integration, we study weighted $\delta$-vectors from a combinatorial perspective. We present a version of Ehrhart…

Combinatorics · Mathematics 2009-07-10 Alan Stapledon

Let $G$ be a finite graph allowing loops, having no multiple edge and no isolated vertex. We associate $G$ with the edge polytope ${\cal P}_G$ and the toric ideal $I_G$. By classifying graphs whose edge polytope is simple, it is proved that…

Commutative Algebra · Mathematics 2018-08-22 Hidefumi Ohsugi , Takayuki Hibi

In a previous article, we proved tight lower bounds for the coefficients of the generalized $h$-vector of a centrally symmetric rational polytope using intersection cohomology of the associated projective toric variety. Here we present a…

Algebraic Geometry · Mathematics 2007-05-23 Annette A'Campo-Neuen

We compute the new supersymmetric index of a large class of N=2 heterotic compactifications with torsion, corresponding to principal two-torus bundles over warped K3 surfaces with H-flux. Starting from a UV description as a (0,2) gauged…

High Energy Physics - Theory · Physics 2016-01-27 Dan Israel , Matthieu Sarkis

We study the natural extended-variable formulation for the disjunction of $n+1$ polytopes in $\mathbb{R}^d$. We demonstrate that the convex hull $D$ in the natural extended-variable space $\mathbb{R}^{d+n}$ is given by full optimal big-M…

Optimization and Control · Mathematics 2024-11-01 Yushan Qu , Jon Lee

Given a hypergraph $\mathcal{H}$, we introduce a new class of evaluation toric codes called edge codes derived from $\mathcal{H}$. We analyze these codes, focusing on determining their basic parameters. We provide estimations for the…

Commutative Algebra · Mathematics 2024-04-04 Delio Jaramillo-Velez