English
Related papers

Related papers: Un invariant remarquable des polytopes simples

200 papers

We solve a Lehmer-type question about the Mahler measure of integer-valued polynomials.

Number Theory · Mathematics 2022-07-15 Berend Ringeling

We describe a congruence property of solvable polynomials over Q, based on the irreducibility of cyclotomic polynomials over number fields that meet certain conditions.

Commutative Algebra · Mathematics 2022-05-11 Nicholas Phat Nguyen

We expand on a result of Barvinok and Hartigan to derive asymptotic formulas for the number of integer and binary integer points in a wide class of multi-index $k_1\times k_2\times \ldots \times k_{\nu}$ transportation polytopes. A simple…

Combinatorics · Mathematics 2014-11-14 David Benson-Putnins

We present the theory of higher order invariants and higher order automorphic forms in the simplest case, that of a compact quotient. In this case many things simplify and we are thus able to prove a more precise structure theorem than in…

Number Theory · Mathematics 2017-09-04 Anton Deitmar

We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This…

Combinatorics · Mathematics 2021-08-12 Hongyi Jiang , Amitabh Basu

Computations involving invariant random vectors are directly related to the theory of invariants (cf. e.g \cite{Weing_1}). Some simple observations along these lines are presented in this paper. We note in particular that sum of elements of…

Numerical Analysis · Mathematics 2023-03-13 Alexander Kushkuley

We apply tropical geometry to study the image of a map defined by Laurent polynomials with generic coefficients. If this image is a hypersurface then our approach gives a construction of its Newton polytope.

Combinatorics · Mathematics 2012-02-13 Bernd Sturmfels , Jenia Tevelev , Josephine Yu

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

Combinatorics · Mathematics 2007-05-23 Richard Arratia , Bela Bollobas , Gregory B. Sorkin

Some Dirichlet-like functions, attached to a pair (periodic function, polynomial) are introduced and studied. These functions generalize the standard Dirichlet L-functions of Dirichlet characters. They have similar properties, being…

Number Theory · Mathematics 2025-03-25 Frédéric Chapoton

A construction of polytopes is given based on integers. These geometries are constructed through a mapping to pure numbers and have multiple applications, including statistical mechanics and computer science. The number form is useful in…

General Physics · Physics 2007-05-23 Gordon Chalmers

The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials. We formulate some basic properties of unitary cyclotomic polynomials and study how they are connected with cyclotomic, inclusion-exclusion and…

Number Theory · Mathematics 2019-11-06 Pieter Moree , László Tóth

Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has at least two such pairs, which can be chosen to be disjoint. Using this result, we…

Combinatorics · Mathematics 2012-08-28 Benjamin A. Burton

We study the PBW filtration on irreducible finite--dimensional representations for the Lie algebra of type $\tt B_n$. We prove in several cases, including all multiples of the adjoint representation and all irreducible finite--dimensional…

Representation Theory · Mathematics 2018-08-22 Teodor Backhaus , Deniz Kus

We discuss methods to construct a polynomial parametrization of some interesting knotted surfaces (knotted spheres, knotted tori and knotted planes) and provide examples.

Geometric Topology · Mathematics 2026-02-17 Louis H. Kauffman , Tumpa Mahato , Rama Mishra

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 real representation of a finite group naturally determines a polytope, generalizing the well-known Birkhoff polytope. This paper determines the structure of the polytope corresponding to the natural permutation representation of a general…

Combinatorics · Mathematics 2011-02-07 John Collins , David Perkinson

We use ideas from our previous work to obtain some theorems that will allow us to obtain the integer solution of a quadratic polynomial in two variables that represents a natural number

Number Theory · Mathematics 2020-06-05 B. Martin Cerna Maguiña

A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann , Michael Joswig

We characterise and investigate co-Higgs sheaves and associated algebraic and combinatorial invariants on toric varieties. In particular, we compute explicit examples.

Algebraic Geometry · Mathematics 2020-10-20 Klaus Altmann , Frederik Witt

Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.

Discrete Mathematics · Computer Science 2007-11-04 Sergey Gubin