English
Related papers

Related papers: Gorenstein polytopes with trinomial $h^*$-polynomi…

200 papers

Let $R$ be a polynomial ring over a field and $I \subset R$ be a Gorenstein ideal of height three that is minimally generated by homogeneous polynomials of the same degree. We compute the multiplicity of the saturated special fiber ring of…

Commutative Algebra · Mathematics 2020-07-09 Yairon Cid-Ruiz , Vivek Mukundan

Let $A$, $B$ be two rings and $T=\left(\begin{smallmatrix} A & M \\ 0 & B \\\end{smallmatrix}\right)$ with $M$ an $A$-$B$-bimodule. We first construct a semi-complete duality pair $\mathcal{D}_{T}$ of $T$-modules using duality pairs in…

Category Theory · Mathematics 2022-03-01 Haiyu Liu , Rongmin Zhu

We study the Gorenstein property for phylogenetic group-based models. We prove that for the groups $\mathbb Z_3$ and $\mathbb Z_2\times \mathbb Z_2$ and trivalent trees the associated polytopes are always Gorenstein extending the results of…

Combinatorics · Mathematics 2020-03-11 Rodica Dinu , Martin Vodička

To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…

Combinatorics · Mathematics 2017-05-08 Thomas Chappell , Tobias Friedl , Raman Sanyal

We describe an algorithm for determining whether two convex polytopes P and Q, embedded in a lattice, are isomorphic with respect to a lattice automorphism. We extend this to a method for determining if P and Q are equivalent, i.e. whether…

Combinatorics · Mathematics 2013-01-29 Roland Grinis , Alexander Kasprzyk

Hibi showed that the polynomial in the numerator of the Ehrhart series of a reflexive polytope is palindromic. We proved that those in the numerator of the Ehrhart series of every graph polytope (defined later) of the bipartite graph is…

Combinatorics · Mathematics 2015-07-24 Daeseok Lee , Hyeong-Kwan Ju

Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…

Logic in Computer Science · Computer Science 2021-12-30 Eric Finster , Samuel Mimram , Maxime Lucas , Thomas Seiller

We prove that double Schubert polynomials have the Saturated Newton Polytope property. This settles a conjecture by Monical, Tokcan and Yong. Our ideas are motivated by the theory of multidegrees. We introduce a notion of standardization of…

Commutative Algebra · Mathematics 2023-10-10 Federico Castillo , Yairon Cid-Ruiz , Fatemeh Mohammadi , Jonathan Montaño

Given a lattice $L$, a full dimensional polytope $P$ is called a {\em Delaunay polytope} if the set of its vertices is $S\cap L$ with $S$ being an {\em empty sphere} of the lattice. Extending our previous work \cite{DD-hyp} on the {\em…

Metric Geometry · Mathematics 2007-05-23 M. Dutour

E. Bayer-Fluckiger gave a necessary and sufficient condition for a polynomial to be realized as the characteristic polynomial of a semisimple isometry of an even unimodular lattice, by describing the local-global obstruction, and the author…

Number Theory · Mathematics 2024-01-24 Yuta Takada

Let A and B be arbitrary sets with at least two elements. The arity gap of a function f: A^n \to B is the minimum decrease in its essential arity when essential arguments of f are identified. In this paper we study the arity gap of…

Rings and Algebras · Mathematics 2016-11-22 Miguel Couceiro , Erkko Lehtonen

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

Number Theory · Mathematics 2015-05-13 Umberto Zannier

We characterize the edges of two classes of $0/1$-polytopes. The first class corresponds to the stable set polytope of a graph $G$ and includes chain polytopes of posets, some instances of matroid independence polytopes, as well as…

Combinatorics · Mathematics 2021-10-27 Farid Aliniaeifard , Carolina Benedetti , Nantel Bergeron , Shu Xiao Li , Franco Saliola

We study singularities obtained by the contraction of the maximal divisor in compact (non kaehlerian) surfaces which contain global spherical shells. These singularities are of genus 1 or 2, may be Q-Gorenstein, numerically Gorenstein or…

Complex Variables · Mathematics 2008-01-07 Georges Dloussky

The article [14] gives a list of 51 symplectic hypergeometric monodromy groups corresponding to primitive pairs of degree four polynomials, which are products of cyclotomic polynomials, and for which, the absolute value of the leading…

Group Theory · Mathematics 2016-10-19 Sandip Singh

We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…

Combinatorics · Mathematics 2007-05-23 Volker Kaibel , Alexander Schwartz

Let $\mathcal{P} \subseteq \mathbb{R}^{n}$ be a polytope whose vertices have rational coordinates. By a seminal result of E. Ehrhart, the number of integer lattice points in the $k$th dilate of $\mathcal{P}$ ($k$ a positive integer) is a…

Combinatorics · Mathematics 2026-02-04 Tyrrell B. McAllister , Hélène O. Rochais

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

We study in detail the profinite group G arising as geometric \'etale iterated monodromy group of an arbitrary quadratic polynomial over a field of characteristic different from two. This is a self-similar closed subgroup of the group of…

Group Theory · Mathematics 2013-09-25 Richard Pink

This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…

Classical Analysis and ODEs · Mathematics 2008-03-04 Steve Fisk
‹ Prev 1 8 9 10 Next ›