English
Related papers

Related papers: Inequalities and Ehrhart $\delta$-Vectors

200 papers

In the paper, we provide an effective method for the Lipschitz equivalence of two-branch Cantor sets and three-branch Cantor sets by studying the irreducibility of polynomials. We also find that any two Cantor sets are Lipschitz equivalent…

Geometric Topology · Mathematics 2019-10-07 Jun Jason Luo , Huo-Jun Ruan , Yi-Ling Wang

In this paper we investigate the Ehrhart Theory of the independence matroid polytope of uniform matroids. It is proved that these polytopes have an Ehrhart polynomial with positive coefficients. To do that, we prove that indeed all…

Combinatorics · Mathematics 2021-05-24 Luis Ferroni

We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…

Combinatorics · Mathematics 2013-09-23 Victor Batyrev , Johannes Hofscheier

We describe a genetic algorithm to find candidates for $h^*$-vectors satisfying given properties in the space of integers vectors of finite length. We use an implementation of such algorithm to find a 52-dimensional lattice polytope having…

Combinatorics · Mathematics 2024-10-25 Gabriele Balletti

It is shown in the paper that each Hecke symmetry R with the R-symmetric algebra freely generated by 3 commuting elements is determined by a bivector and a symmetric bilinear form on a 3-dimensional vector space. A general formula for such…

Rings and Algebras · Mathematics 2022-10-10 Serge Skryabin

The band structure of the Lam\'e equation, viewed as a one-dimensional Schr\"odinger equation with a periodic potential, is studied. At integer values of the degree parameter l, the dispersion relation is reduced to the l=1 dispersion…

Mathematical Physics · Physics 2008-02-04 Robert S. Maier

We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…

Logic in Computer Science · Computer Science 2024-09-05 Eike Neumann , Arno Pauly , Cécilia Pradic

Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…

Functional Analysis · Mathematics 2023-03-01 Sriram Balasubramanian , Neha Hotwani , Scott McCullough

Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…

Numerical Analysis · Mathematics 2012-07-27 Dario A. Bini , V. Noferini

The characterization of lattice polytopes based upon information about their Ehrhart $h^*$-polynomials is a difficult open problem. In this paper, we finish the classification of lattice polytopes whose $h^*$-polynomials satisfy two…

Combinatorics · Mathematics 2015-03-20 Akihiro Higashitani , Benjamin Nill , Akiyoshi Tsuchiya

We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…

Rings and Algebras · Mathematics 2021-10-08 Hua-Lin Huang , Huajun Lu , Yu Ye , Chi Zhang

We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…

Combinatorics · Mathematics 2017-06-20 Nicholas Proudfoot , Ben Young , Yuan Xu

The Ehrhart function $L_P(t)$ of a polytope $P$ is usually defined only for integer dilation arguments $t$. By allowing arbitrary real numbers as arguments we may also detect integer points entering (or leaving) the polytope in fractional…

Combinatorics · Mathematics 2017-12-13 Tiago Royer

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

Algebraic Geometry · Mathematics 2017-05-01 Saugata Basu , Cordian Riener

For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…

Combinatorics · Mathematics 2012-12-21 Gábor Hegedüs , Alexander M. Kasprzyk

This paper establishes some equivalent conditions of a uninorm, extending an arbitrary triangular norm on [0, e] or an arbitrary triangular conorm on [e, 1] to the whole lattice.

General Mathematics · Mathematics 2020-03-24 Xinxing Wu , Guanrong Chen

The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…

Classical Analysis and ODEs · Mathematics 2014-04-16 Charles F. Dunkl

For an integral convex polytope $\mathcal{P} \subset \mathbb{R}^d$, we recall $L_\mathcal{P}(n)=|n\mathcal{P} \cap \mathbb{Z}^d|$ the Ehrhart polynomial of $\mathcal{P}$. Let $g_r(\mathcal{P})$ be the $r$th coefficients of…

Combinatorics · Mathematics 2020-09-08 Akiyoshi Tsuchiya

A complete classification of unimodular valuations on the set of lattice polygons with values in the spaces of polynomials and formal power series, respectively, is established. The valuations are classified in terms of their behaviour with…

Metric Geometry · Mathematics 2026-01-14 Ansgar Freyer , Monika Ludwig , Martin Rubey

We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynomials are to be distinguished, we call them /periodic/ and…

Symbolic Computation · Computer Science 2010-05-05 Manuel Kauers , Carsten Schneider
‹ Prev 1 8 9 10 Next ›