English
Related papers

Related papers: Lower bounds for mask polynomials with many cyclot…

200 papers

Let $\pi:{\mathbb R}^n \to {\mathbb R}^d$ be any linear projection, let $A$ be the image of the standard basis. Motivated by Postnikov's study of postitive Grassmannians via plabic graphs and Galashin's connection of plabic graphs to slices…

Combinatorics · Mathematics 2021-11-05 Jorge Alberto Olarte , Francisco Santos

We say that a cyclotomic polynomial Phi_{n}(x) has order three if n is the product of three distinct primes, p<q<r. Let A(n) be the largest absolute value of a coefficient of Phi_{n}(x) and M(p) be the maximum of A(pqr). In 1968, Sister…

Number Theory · Mathematics 2009-10-13 Jia Zhao , Xianke Zhang

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…

Number Theory · Mathematics 2025-09-03 Richard Ehrenborg

Let $p$ be a fixed prime, and let $v(a)$ stand for the exponent of $p$ in the prime factorization of the integer $a$. Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Write $S$ for the maximum of…

Number Theory · Mathematics 2018-06-12 Péter E. Frenkel , Gergely Zábrádi

The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope - corresponding to the triangulations of A - are very…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann

Let $V$ be any vector space of multivariate degree-$d$ homogeneous polynomials with co-dimension at most $k$, and $S$ be the set of points where all polynomials in $V$ {\em nearly} vanish. We establish a qualitatively optimal upper bound on…

Machine Learning · Computer Science 2020-12-15 Ilias Diakonikolas , Daniel M. Kane

Given an integer matrix A satisfying certain regularity assumptions, we consider for a positive integer s the set F_s(A) of all integer vectors b such that the associated knapsack polytope P(A,b)={x: Ax=b, x non-negative} contains at least…

Combinatorics · Mathematics 2012-11-15 Iskander Aliev , Martin Henk , Eva Linke

We say that a cyclotomic polynomial \Phi_{n}(x) has order three if n is the product of three distinct primes, p<q<r. Let A(n) be the largest absolute value of a coefficient of \Phi_{n}(x) and M(p) be the maximum of A(pqr). In 1968, Sister…

Number Theory · Mathematics 2009-10-16 Jia Zhao , Xianke Zhang

Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$.…

Number Theory · Mathematics 2022-11-24 Jagannath Bhanja , Ram Krishna Pandey

A length $n$ cosine sum is an expression of the form $\cos a_1\theta + \cdots + \cos a_n\theta$ where $a_1 < \cdots < a_n$ are positive integers, and a length $n$ Newman polynomial is an expression of the form $z^{a_1} + \cdots + z^{a_n}$…

Number Theory · Mathematics 2017-09-21 Idris Mercer

The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials $\Phi_n^*(x)$. They can be written as certain products of cyclotomic poynomials. We study the case where $n$ has two or three distinct prime…

Number Theory · Mathematics 2019-11-06 G. Jones , P. I. Kester , L. Martirosyan , P. Moree , L. Tóth , B. B. White , B. Zhang

In the study of extensions of polytopes of combinatorial optimization problems, a notorious open question is that for the size of the smallest extended formulation of the Minimum Spanning Tree problem on a complete graph with $n$ nodes. The…

Discrete Mathematics · Computer Science 2017-02-07 Kaveh Khoshkhah , Dirk Oliver Theis

Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…

Metric Geometry · Mathematics 2022-10-25 Alexander Tolmachev , Dmitry Protasov , Vsevolod Voronov

Let $\F_q$ be a finite field of order $q$ and $P$ be a polynomial in $\F_q[x_1, x_2]$. For a set $A \subset \F_q$, define $P(A):=\{P(x_1, x_2) | x_i \in A \}$. Using certain constructions of expanders, we characterize all polynomials $P$…

Combinatorics · Mathematics 2007-05-23 Van Vu

An extended formulation of a polytope P is a polytope Q which can be projected onto P. Extended formulations of small size (i.e., number of facets) are of interest, as they allow to model corresponding optimization problems as linear…

Combinatorics · Mathematics 2012-07-10 Samuel Fiorini , Volker Kaibel , Kanstantsin Pashkovich , Dirk Oliver Theis

Define Minimum Soapy Union (MinSU) as the following optimization problem: given a $k$-tuple $(X_1, X_2,..., X_k)$ of finite integer sets, find a $k$-tuple $(t_1, t_2,..., t_k)$ of integers that minimizes the cardinality of $(X_1 + t_1) \cup…

Computational Complexity · Computer Science 2012-04-23 Francois Nicolas , Sebastian Böcker

Let $A_n$ denote the height of cyclotomic polynomial $\Phi_n$, where $n$ is a product of $k$ distinct odd primes. We prove that $A_n \le \epsilon_k\phi(n)^{k^{-1}2^{k-1}-1}$ with $-\log\epsilon_k\sim c2^k$, $c>0$. The same statement is true…

Number Theory · Mathematics 2012-07-04 Bartlomiej Bzdega

We find the minimal dimension for a truncated polynomial algebra over an arbitrary field for which there exists a "non-thin" subalgebra. Moreover, we discuss examples of subalgebras, and count them in low dimensions.

Commutative Algebra · Mathematics 2019-01-01 Francisco Franco Munoz

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

Combinatorics · Mathematics 2018-09-11 Jacob Hicks , M. A. Ollis , John. R. Schmitt