English
Related papers

Related papers: Weighted Brianchon-Gram decomposition

200 papers

We provide a Minkowski sum decomposition of marked chain-order polytopes into building blocks associated to elementary markings and thus give an explicit minimal set of generators of an associated semi-group algebra. We proceed by…

Combinatorics · Mathematics 2020-01-28 Xin Fang , Ghislain Fourier , Christoph Pegel

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter at least three and standard module $V$. We introduce two direct sum decompositions of $V$. We call these the displacement decomposition for $\Gamma$ and the split…

Combinatorics · Mathematics 2007-05-23 Paul Terwilliger

We consider polygon and simplex equations, of which the simplest nontrivial examples are pentagon (5-gon) and Yang--Baxter (2-simplex), respectively. We examine the general structure of (2n+1)-gon and 2n-simplex equations in direct sums of…

Mathematical Physics · Physics 2021-05-04 Aristophanes Dimakis , Igor Korepanov

For any real diagonalizable matrix with complex eigenvalues we provide a real, coordinate free decomposition with a clear geometric interpretation.

History and Overview · Mathematics 2022-08-29 Cristobal Arratia

Consider an ordinary generating function $\sum_{k=0}^{\infty}c_kx^k$, of an integer sequence of some combinatorial relevance, and assume that it admits a closed form $C(x)$. Various instances are known where the corresponding truncated sum…

Number Theory · Mathematics 2017-03-08 Sandro Mattarei , Roberto Tauraso

Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…

Combinatorics · Mathematics 2018-08-02 Ricardo Diaz , Quang-Nhat Le , Sinai Robins

An asymptotic expansion formula of Riemann sums over lattice polytopes is given. The formula is an asymptotic form of the local Euler-Maclaurin formula due to Berline-Vergne. The proof given here for Delzant lattice polytopes is independent…

Combinatorics · Mathematics 2017-11-15 Tatsuya Tate

Although there are many simple proofs of Jordan's decomposition theorem in the literature (see [1], the references mentioned there, and [2]), our proof seems to be even more elementary. In fact, all we need is the theorem on the dimensions…

History and Overview · Mathematics 2007-05-23 Pawel Kroeger

A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of…

Metric Geometry · Mathematics 2007-09-14 Gennadiy Averkov , Martin Henk

A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking…

Computational Geometry · Computer Science 2017-03-03 Erik D. Demaine , Andre Schulz

We show that when integral polytopes are deformed while keeping the same facet normal vectors, the coefficients of weighted Ehrhart and $h^*$-polynomials are piecewise polynomial functions in the ``right hand sides'' of the linear…

Combinatorics · Mathematics 2025-11-14 Daniel Hwang , Juliet Whidden , Josephine Yu

A new and easy way of deriving Gauss's Generalized Hypergeometric Theorem is presented by using the Bilateral Binomial Theorem.

General Mathematics · Mathematics 2007-05-23 Martin Erik Horn

We describe an algorithm for the computation of generalized (or weighted) Ehrhart series based on Stanley decompositions as implemented in the offspring NmzIntegrate of Normaliz. The algorithmic approach includes elementary proofs of the…

Combinatorics · Mathematics 2012-11-26 Winfried Bruns , Christof Söger

The main aim of this paper is to define and investigate a new class of the degenerate poly-Frobenius-Genocchi polynomials with the help of the polyexponential functions. In this paper, we define the degenerate poly-Frobenius-Genocchi…

Number Theory · Mathematics 2020-07-17 Burak Kurt

We interpret the coefficients of the cyclotomic polynomial in terms of simplicial homology.

Combinatorics · Mathematics 2022-08-17 Gregg Musiker , Victor Reiner

For a polytope we define the {\em flag polynomial}, a polynomial in commuting variables related to the well-known flag vector and describe how to express the the flag polynomial of the Minkowski sum of $k$ standard simplices in a direct and…

Combinatorics · Mathematics 2010-07-01 Geir Agnarsson

We prove that for every complex classical group $G$ the string polytope associated to a special reduced decomposition and any dominant integral weight $\lambda$ will be a lattice polytope if and only if the highest weight representation of…

Representation Theory · Mathematics 2020-11-25 Christian Steinert

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.

Symbolic Computation · Computer Science 2015-07-14 Yong-Jin Kim , Hyon-Song Paek , Nam-Chol Kim , Chong-Il Byon

A weighted simplicial complex is a simplicial complex with values (called weights) on the vertices. In this paper, we consider weighted simplicial complexes with $\mathbb{R}^2$-valued weights. We study the weighted homology and the weighted…

Combinatorics · Mathematics 2021-03-25 Shiquan Ren , Chengyuan Wu

In this paper, we use multivariate splines to investigate the volume of polytopes. We first present an explicit formula for the multivariate truncated power, which can be considered as a dual version of the famous Brion's formula for the…

Numerical Analysis · Mathematics 2010-10-19 Zhiqiang Xu
‹ Prev 1 8 9 10 Next ›