Related papers: Un invariant remarquable des polytopes simples
We present a method of constructing non-normal very ample polytopes as a segmental fibration of unimodular graph polytopes. In many cases we explicitly compute their invariants - Hilbert function, Ehrhart polynomial, gap vector. In…
Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how well a polytope is approximated by the use of sparse valid…
For any characteristic zero coefficient field, an irreducible representation of a finite $p$-group can be assigned a Roquette $p$-group, called the genotype. This has already been done by Bouc and Kronstein in the special cases Q and C. A…
Based on tiles and on the Coven-Meyerowitz property, we present some examples and some general constructions of spectral subsets of integers.
A classification of discrete polymatroids whose independence polytopes are reflexive will be presented.
Let G be a complex simple algebraic group. We consider invariant-theoretic properties of the simple G-module whose highest weight is the short dominant root.
We are presenting an algorithm capable of simplifying tensor polynomials with indices when the building tensors have index symmetry properties. These properties include simple symmetry, cyclicity and those due to the presence of covariant…
In this paper, we derive some interesting symmetric properties for the geenralized Euler numbers and polynomials.
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
We exhibit a change of variables that maintains the Mahler measure of a given polynomial. This method leads to the construction of highly non-trivial polynomials with given Mahler measure and settles some conjectural numerical formulas due…
We exhibit invariants of smooth projective algebraic varieties with integer values, whose nonvanishing modulo p prevents the existence of an action without fixed points of certain finite p-groups. The case of base fields of characteristic p…
An observation on Hall-Littlewood polynomials.
Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…
Starting from a finite simple graph $G$, for each eigenvalue $\theta$ of its adjacency matrix one can construct a convex polytope $P_G(\theta)$, the so called $\theta$-eigenpolytop of $G$. For some polytopes this technique can be used to…
We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.
Given positive real numbers, we prove two inequalities involving their potential energy and their power sums. We also prove an inequality involving the energy and the discriminant and apply it to deduce a result on totally positive…
We study Riemann-Lebesgue integrability of a vector function relative to an arbitrary non-negative set function. We obtain some classical integral properties. Results regarding the continuity properties of the integral and relationships…
A simplicial polytope is combinatorially rigid if its combinatorial structure is determined by its graded Betti numbers which are important invariant coming from combinatorial commutative algebra. We find a necessary condition to be…