Related papers: Root separation for reducible monic polynomials of…

We consider a modification of the classical number theoretic question about the gaps between consecutive primitive roots modulo a prime $p$, which by the well-known result of Burgess are known to be at most $p^{1/4+o(1)}$. Here we measure…

Given a polynomial $p$ of degree $d$ and a bound $\kappa$ on a condition number of $p$, we present the first root-finding algorithms that return all its real and complex roots with a number of bit operations quasi-linear in $d…

We show that the degree of the Alexander polynomial of an irreducible plane algebraic curve with nodes and cusps as the only singularities does not exceed ${5 \over 3}d-2$ where $d$ is the degree of the curve. We also show that the…

We present algorithms revealing new families of polynomials allowing sub-exponential detection of p-adic rational roots, relative to the sparse encoding. For instance, we show that the case of honest n-variate (n+1)-nomials is doable in NP…

We use the method of steepest descents to study the root distribution of the Ehrhart polynomial of the $d$-dimensional cross-polytope, namely $\mathcal{L}_{d}$, as $d\rightarrow \infty$. We prove that the distribution function of the roots,…

Let $N$ be a positive integer and let $S_N$ be the set of polynomials with integer coefficients, degree less than $N$, and minimal positive integral over $[0,1]$. D. Bazzanella initiated the study of $S_N$ because of its relation to the…

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

In this paper we present a new technique to construct neighborly polytopes, and use it to prove a lower bound of ((r+d)^((r/2+d/2)^2))/(r^((r/2)^2)d^((d/2)^2)e^(3rd/4)) for the number of combinatorial types of vertex-labeled neighborly…

Let $p_{\textrm{dsd}} (n)$ be the number of partitions of $n$ into distinct squarefree divisors of $n$. In this note, we find a lower bound for $p_{\textrm{dsd}} (n)$, as well as a sequence of $n$ for which $p_{\textrm{dsd}} (n)$ is…

The Ehrhart polynomial of the $d$-th hypersimplex $\Delta(d,n)$ of order $n$ is studied. By computational experiments and a known result for $d=2$, we conjecture that the real part of every roots of the Ehrhart polynomial of $\Delta(d,n)$…

We prove some separation results for the roots of the generalized Fibonacci polynomials and their absolute values

This monograph considers a few topics in the theory of primitive roots g(p) modulo a prime p>=2. A few estimates of the least primitive roots g(p) and the least prime primitive roots g^*(p) modulo p, a large prime, are determined. One of…

For a given set of integers $\mathcal{S}$, let $\mathcal{R}_n^*(\mathcal{S})$ denote the set of reducible polynomials $f(X)=a_nX^n+a_{n-1}X^{n-1}+\cdots+a_1X+a_0$ over $\mathbb{Z}[X]$ with $a_i\in\mathcal{S}$ and $a_0a_n\ne 0$. In this…

We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

Goppa codes form an important class of alternant codes with wide applications in algebraic coding theory and code-based cryptography. Determining the true minimum distance of a Goppa code is a difficult problem. In this paper, we provide a…

Let $p:R^n\to R$ be a polynomial map. Consider the complex $S'\Omega^*(\RR^n)$ of tempered currents on $R^n$ with the twisted differential $d_p=d-dp$ where $d$ is the usual exterior differential and $dp$ stands for the exterior…

Let $p$ be a prime and $b(x)$ be an irreducible polynomial of degree $k$ over $\mathbb{F}_p$. Let $d\geq 1$ be an integer. Consider the following question: Is $b(x^d)$ irreducible? We derive necessary conditions for $b(x^d)$ to be…

According to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that if the minimum distance of the code is larger than a certain threshold then the TA property implies the…