English
Related papers

Related papers: Irrational mixed decomposition and sharp fewnomial…

200 papers

We consider partitions $p_{w}(n)$ of a positive integer $n$ arising from the generating functions \[ \sum_{n=1}^\infty p_{w}(n) z^n = \prod_{m \in \mathbb{N}} (1-z^m)^{-w(m)}, \] where the weights $w(m)$ are M\"{o}bius convolutions. We…

Number Theory · Mathematics 2026-03-04 Debmalya Basak , Nicolas Robles , Alexandru Zaharescu

Let ${\bf K} = (K_1, ..., K_n)$ be an $n$-tuple of convex compact subsets in the Euclidean space $\R^n$, and let $V(\cdot)$ be the Euclidean volume in $\R^n$. The Minkowski polynomial $V_{{\bf K}}$ is defined as $V_{{\bf K}}(\lambda_1, ...…

Computational Geometry · Computer Science 2009-01-19 Leonid Gurvits

Using tropical convexity Dochtermann, Fink, and Sanyal proved that regular fine mixed subdivisions of Minkowski sums of simplices support minimal cellular resolutions. They asked if the regularity condition can be removed. We give an…

Combinatorics · Mathematics 2016-08-25 Patrik Norén

Given a finite irreducible Coxeter group $W$, a positive integer $d$, and types $T_1,T_2,...,T_d$ (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions $c=\si_1\si_2 cdots\si_d$ of a Coxeter…

Combinatorics · Mathematics 2010-01-18 Christian Krattenthaler , Thomas Müller

Let $\mathcal R$ be a principal ideal domain and $\mathcal K = {\rm quot}(\mathcal R)$. Assume that $P_1,\ldots P_n\in \mathcal K[X]$ are polynomials which take $\mathcal R$ to $\mathcal R$, and $P$ is their product. If the $P_i$ satisfy…

Number Theory · Mathematics 2022-09-09 Michaël Bensimhoun

Consider a system F of n polynomials in n variables, with a total of n+k distinct exponent vectors, over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all…

Algebraic Geometry · Mathematics 2013-09-03 Kaitlyn Phillipson , J. Maurice Rojas

Let $R$ be a commutative ring, $f \in R[X_1,\ldots,X_k]$ a multivariate polynomial, and $G$ a finite subgroup of the group of units of $R$ satisfying a certain constraint, which always holds if $R$ is a field. Then, we evaluate $\sum…

Number Theory · Mathematics 2017-05-17 Paolo Leonetti , Andrea Marino

Let $P_{<n}(z)$ be the Rudin-Shapiro polynomial of degree $n-1$. We show that $|P_{<n}(z)|\le \sqrt{6n-2}-1$ for all $n\ge0$ and $|z|=1$, confirming a longstanding conjecture. This bound is sharp in the case when $n=(2\cdot 4^k+1)/3$ and…

Classical Analysis and ODEs · Mathematics 2019-09-20 Paul Balister

The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…

Combinatorics · Mathematics 2007-05-23 Alexander Postnikov

For a given decreasing positive real function $\psi$, let $\mathcal{A}_n(\psi)$ be the set of real numbers for which there are infinitely many integer polynomials $P$ of degree up to $n$ such that $\left\lvert P(x) \right\rvert \leq…

Number Theory · Mathematics 2020-08-18 Alessandro Pezzoni

We present algorithms to compute generalized root systems of Nichols algebras of diagonal type and of contragredient Lie superalgebras. As a consequence, we obtain an algorithm to compute the Lyndon words in the Kharchenko PBW basis…

Representation Theory · Mathematics 2025-06-02 Iván Angiono , Leandro Vendramin

We investigate the weighted Bojanov-Chebyshev extremal problem for trigonometric polynomials, that is, the minimax problem of minimizing $\|T\|_{w,C({\mathbb T})}$, where $w$ is a sufficiently nonvanishing, upper bounded, nonnegative weight…

Classical Analysis and ODEs · Mathematics 2023-09-13 Béla Nagy , Szilárd Gy. Révész

We consider the problem of maximizing the sum of squares of the leading coefficients of polynomials $P_{i_1}(x),\ldots ,P_{i_m}(x)$ (where $P_j(x)$ is a polynomial of degree $j$) under the restriction that the sup-norm of $\sum_{j=1}^m…

Classical Analysis and ODEs · Mathematics 2009-09-25 Holger Dette

Every polyhedron can be decomposed into a Minkowski sum (or vector sum) of a bounded polyhedron and a polyhedral cone. This paper establishes similar statements for some classes of discrete sets in discrete convex analysis, such as…

Combinatorics · Mathematics 2023-10-04 Kazuo Murota , Akihisa Tamura

We find a relation between mixed volumes of several polytopes and the convex hull of their union, deducing it from the following fact: the mixed volume of a collection of polytopes only depends on the product of their support functions…

Algebraic Geometry · Mathematics 2018-01-31 Alexander Esterov

We present a new, far simpler family of counter-examples to Kushnirenko's Conjecture. Along the way, we illustrate a computer-assisted approach to finding sparse polynomial systems with maximally many real roots, thus shedding light on the…

Algebraic Geometry · Mathematics 2007-05-23 Alicia Dickenstein , J. Maurice Rojas , Korben Rusek , Justin Shih

We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero…

Computational Complexity · Computer Science 2020-11-06 Mrinal Kumar , Ben Lee Volk

Let $K$ be a field, complete with respect to a discrete non-archimedian valuation and let $k$ be the residue field. Consider a system $F$ of $n$ polynomial equations in $K\vars$. Our first result is a reformulation of the classical Hensel's…

Algebraic Geometry · Mathematics 2011-07-07 Martin Avendano , Ashraf Ibrahim

We establish a new notion of tropical convexity for signed tropical numbers. We provide several equivalent descriptions involving balance relations and intersections of open halfspaces as well as the image of a union of polytopes over…

Optimization and Control · Mathematics 2019-10-03 Georg Loho , László A. Végh

Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…

Combinatorics · Mathematics 2017-04-18 Aleksandar Nikolov