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

Let $[n]$ denote $\{0,1, ... , n-1\}$. A polynomial $f(x) = \sum a_i x^i$ is a Littlewood polynomial (LP) of length $n$ if the $a_i$ are $\pm 1$ for $i \in [n]$, and $a_i = 0$ for $i \ge n$. Such an LP is said to have order $m$ if it is…

If $s$ is a positive integer and $A$ is a set of positive integers, we say that $B$ is an $s$-divisor of $A$ if $\sum_{b\in B} b\mid s\sum_{a\in A} a$. We study the maximal number of $k$-subsets of an $n$-element set that can be…

Let $\Phi_n(x)$ denote the $n$th cyclotomic polynomial. In 1968 Sister Marion Beiter conjectured that $a_n(k)$, the coefficient of $x^k$ in $\Phi_n(x)$, satisfies $|a_n(k)|\le (p+1)/2$ in case $n=pqr$ with $p<q<r$ primes (in this case…

For any two integers $k,n$, $2\leq k\leq n$, let $f:(\mathbb{C}^*)^n\rightarrow\mathbb{C}^k$ be a generic polynomial map with given Newton polytopes. It is known that points, whose fiber under $f$ has codimension one, form a finite set…

In the large rank limit, for any nonexceptional affine algebra, the graded branching multiplicities known as one-dimensional sums, are conjectured to have a simple relationship with those of type A, which are known as generalized Kostka…

We consider simplicial polytopes, and more general simplicial complexes, without missing faces above a fixed dimension. Sharp analogues of McMullen's generalized lower bounds, and of Barnette's lower bounds, are conjectured for these…

In this survey, we review the properties of minimal spectral $k$-partitions in the two-dimensional case and revisit their connections with Pleijel's Theorem. We focus on the large $k$ problem (and the hexagonal conjecture) in connection…

In this paper, we first determine the minimum possible size of an Fq-linear set of rank k in PG(1, q^n). We obtain this result by relating it to the number of directions determined by a linearized polynomial whose domain is restricted to a…

For an algebraically closed field $K$ of characteristic zero and a non-singular matrix $A\in \mbox{GL}_n(K)$, a semi-invariant polynomial of $A$ is defined to be a polynomial $p(x)=p(x_1,\dots,x_n)$ with coefficients in $K$ such that…

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

A (v,k,t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a v-set, such that each t-subset is contained in at least one of the blocks. The number of blocks is the covering's size}, and the minimum size of…

In 2005, Boman et al introduced the concept of factor width for a real symmetric positive semidefinite matrix. This is the smallest positive integer $k$ for which the matrix $A$ can be written as $A=VV^T$ with each column of $V$ containing…

Let $p$ be a prime number. As a standard application of the irreducibility criterion of Eisenstein, it is well known that the $p$-th cyclotomic polynomial $\Phi_p(t)=1+t+\dots+t^{p-1}$ is the minimal polynomial of $e^{2\pi i/p}$ over…

Let $k_i\ (i=1,2,\ldots,t)$ be natural numbers with $k_1>k_2>\cdots>k_t>0$, $k_1\geq 2$ and $t<k_1.$ Given real numbers $\alpha_{ji}\ (1\leq j\leq t,\ 1\leq i\leq s)$, we consider polynomials of the shape…

We present several approaches on finding necessary and sufficient conditions on $n$ so that $\Phi_k(x^n)$ is irreducible where $\Phi_k$ is the $k$-th cyclotomic polynomial.

Continuing our recent work we study polynomial masks of multivariate tight wavelet frames from two additional and complementary points of view: convexity and system theory. We consider such polynomial masks that are derived by means of the…

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…