English
Related papers

Related papers: Integer decomposition property of dilated polytope…

200 papers

A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…

Combinatorics · Mathematics 2010-02-14 Barbara Baumeister , Christian Haase , Benjamin Nill , Andreas Paffenholz

In this article we obtain a general polynomial identity in $k$ variables, where $k\geq 2$ is an arbitrary positive integer. We use this identity to give a closed-form expression for the entries of the powers of a $k \times k$ matrix.…

Combinatorics · Mathematics 2019-01-01 James Mc Laughlin , B. Sury

We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of such compositions, the total number of parts…

Combinatorics · Mathematics 2012-02-08 Martin E. Malandro

The reversal of a positive integer $A$ is the number obtained by reading $A$ backwards in its decimal representation. A pair $(A,B)$ of positive integers is said to be palindromic if the reversal of the product $A \times B$ is equal to the…

Number Theory · Mathematics 2016-04-18 Martianus Frederic Ezerman , Bertrand Meyer , Patrick Sole

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

History and Overview · Mathematics 2016-12-21 Akash Jena , Binod Kumar Sahoo

To every $k$-dimensional modular invariant vector space we associate a modular form on $SL(2,\mathbb{Z})$ of weight $2k$. We explore number theoretic properties of this form and find a sufficient condition for its vanishing which yields…

Quantum Algebra · Mathematics 2007-05-23 Antun Milas

Let $P$ be a convex $d$-polytope and $0 \leq k \leq d-1$. In 2023, this author proved the following inequalities, resolving a question of B\'ar\'any: \[ \frac{f_k(P)}{f_0(P)} \geq \frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} +…

Combinatorics · Mathematics 2024-01-30 Joshua Hinman

Let $(P,\leq_P)$ and $(Q,\leq_Q)$ be finite partially ordered sets with $|P|=|Q|=d$, and $\mathcal{C}(P) \subset \mathbb{R}^d$ and $\mathcal{C}(Q) \subset \mathbb{R}^d$ their chain polytopes. The twinned chain polytope of $P$ and $Q$ is the…

Combinatorics · Mathematics 2020-09-08 Akiyoshi Tsuchiya

To begin, we find certain formulas $Q(k,\alpha)= G_1^k(\alpha) G_2^k(\alpha)$, for $k = -1, 0, 1,...,9$. These yield that part of the total separability probability, $P(k,\alpha)$, for generalized (real, complex, quaternionic,\ldots)…

Quantum Physics · Physics 2018-05-28 Paul B. Slater

In this paper, we reveal an internal structure within Dedekind numbers, demonstrating that they can be expressed as polynomials of powers of 2. This discovery is based on innovative concepts and methods, offering a new perspective on the…

Combinatorics · Mathematics 2024-03-12 YongQing Liu

We study the complexity of computing the mixed-integer hull $\operatorname{conv}(P\cap\mathbb{Z}^n\times\mathbb{R}^d)$ of a polyhedron $P$. Given an inequality description, with one integer variable, the mixed-integer hull can have…

Optimization and Control · Mathematics 2015-03-11 Robert Hildebrand , Timm Oertel , Robert Weismantel

Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…

General Mathematics · Mathematics 2020-03-23 Ya-Ping Lu , Shu-Fang Deng

We give new positive results on the long-standing open problem of geometric covering decomposition for homothetic polygons. In particular, we prove that for any positive integer k, every finite set of points in R^3 can be colored with k…

Computational Geometry · Computer Science 2014-05-30 Jean Cardinal , Kolja Knauer , Piotr Micek , Torsten Ueckerdt

Polynomials commute under composition are referred to as commuting polynomials. In this paper, we study division properties for commuting polynomials with rational (and integer) coefficients. As a consequence, we show an algebraic…

Commutative Algebra · Mathematics 2026-03-05 Kimiko Hasegawa , Rin Sugiyama

A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…

Commutative Algebra · Mathematics 2009-07-02 Joachim von zur Gathen

Algorithmic methods for the explicit inversion of the indefinite double covering maps are proposed. These are based on either the Givens decomposition or the polar decomposition of the given matrix in the proper, indefinite orthogonal group…

Mathematical Physics · Physics 2020-03-24 Francis Adjei , Mieczyslaw Dabkowski , Samreen Khan , Viswanath Ramakrishna

Let $A$ be a subset of integers and let $2\cdot A+k\cdot A=\{2a_1+ka_2 : a_1,a_2\in A\}$. Y. O. Hamidoune and J. Ru\' e proved that if $k$ is an odd prime and $A$ a finite set of integers such that $|A|>8k^k$, then $|2\cdot A+k\cdot A|\ge…

Number Theory · Mathematics 2011-03-16 Zeljka Ljujic

A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a…

Combinatorics · Mathematics 2009-11-12 Fu Liu

For a polytope P, the Chvatal closure P' is obtained by simultaneously strengthening all feasible inequalities cx <= b (with integral c) to cx <= floor(b). The number of iterations of this procedure that are needed until the integral hull…

Combinatorics · Mathematics 2012-04-27 Thomas Rothvoss , Laura Sanita