Related papers: Sparse binary cyclotomic polynomials

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be any linearly independent polynomials with zero constant term. We show that there exists a $\gamma>0$ such that any subset of $\mathbb{F}_q$ of size at least $q^{1-\gamma}$ contains a nontrivial…

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.

We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…

We consider the algebra of invariants of binary forms of degree 10 with complex coefficients, construct a system of parameters with degrees 2, 4, 6, 6, 8, 9, 10, 14 and find the 106 basic invariants.

We generalize the shadow codes of Cherubini and Micheli to include basic polynomials having arbitrary degree, and show that restricting basic polynomials to have degree one or less can result in improved lower bounds on the minimum distance…

We give a complete classification of all Salem polynomials of length 5. For length 6 we show that all but finitely many Salem polynomials lie in one of 12 infinite families, and subject to Lehmer's Conjecture we give a complete list of the…

Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.

We obtain bounds for the numerical radius of $2 \times 2$ operator matrices which improve on the existing bounds. We also show that the inequalities obtained here generalize the existing ones. As an application of the results obtained here…

Solutions to equilibrium sequences of irrotational binary polytropic stars in Newtonian gravity are expanded in a power of $\epsilon=a_0/R$, where R and $a_0$ are the orbital separation of the binary system and the radius of each star for…

We give explicit upper bounds for coefficients of polynomials appearing in Gauss-Kra\"{i}tchik formula for cyclotomic polynomials. We use a certain relation between elementary symmetric polynomials and power sums polynomials.

Let $n_1 < n_2 < \cdots < n_N$ be non-negative integers. In a private communication Brian Conrey asked how fast the number of real zeros of the trigonometric polynomials $T_N(\theta) = \sum_{j=1}^N {\cos (n_j\theta)}$ tends to $\infty$ as a…

For a finite set of natural numbers $D$ consider a complex polynomial of the form $f(z) = \sum_{d \in D} c_d z^d$. Let $\rho_+(f)$ and $\rho_-(f)$ be the fractions of the unit circle that $f$ sends to the right($\operatorname{Re} f(z) > 0$)…

We present an algorithm for the classification of triples of lattice polytopes with a given mixed volume $m$ in dimension 3. It is known that the classification can be reduced to the enumeration of so-called irreducible triples, the number…

A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…

In this paper we consider the minimal polynomial $\psi_n(x)$ of $2\cos (2\pi /n)$. We introduce some polynomial sequences with the same recurrence relation as the rescaled Chebyshev polynomials $t_n(x)=2\, T_n(x/2)$ of the first kind, which…

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

We study the probability distribution of the number of common zeros of a system of $m$ random $n$-variate polynomials over a finite commutative ring $R$. We compute the expected number of common zeros of a system of polynomials over $R$.…