Related papers: On the complex zeros and the computational complex…
In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.
In this paper we prove that the property of being scattered for a $\mathbb{F}_q$-linearized polynomial of small $q$-degree over a finite field $\mathbb{F}_{q^n}$ is unstable, in the sense that, whenever the corresponding linear set has at…
We prove that zeros and critical points of a random polynomial $p_N$ of degree $N$ in one complex variable appear in pairs. More precisely, if $p_N$ is conditioned to have $p_N(\xi)=0$ for a fixed $\xi \in \C\backslash\set{0},$ we prove…
In this paper we study the asymptotic behavior of a family of polynomials which are orthogonal with respect to an exponential weight on certain contours of the complex plane. The zeros of these polynomials are the nodes for complex Gaussian…
In this note we investigate, as a natural continuation of [K. Castillo, Constr. Approx., 55 (2022) 605-627], the behaviour of the zeros of discrete paraorthogonal polynomials on the unit circle with respect to a real parameter.
In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…
We provide detailed local descriptions of stable polynomials in terms of their homogeneous decompositions, Puiseux expansions, and transfer function realizations. We use this theory to first prove that bounded rational functions on the…
This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…
For random polynomials with i.i.d. (independent and identically distribu-ted) zeros following any common probability distribution $\mu$ with support contained in the unit circle, the empirical measures of the zeros of their first and higher…
In this paper we present an unexpected link between the Factorial Conjecture and Furter's Rigidity Conjecture. The Factorial Conjecture in dimension $m$ asserts that if a polynomial $f$ in $m$ variables $X_i$ over $\C$ is such that ${\cal…
In this paper we present some classes of real self-reciprocal polynomials with at most two zeros outside the unit circle which are connected with a Chebyshev quasi-orthogonal polynomials of order one. We investigated the distribution,…
By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
In considering the reliability of numerical programs, it is normal to "limit our study to the semantics dealing with numerical precision" (Martel, 2005). On the other hand, there is a great deal of work on the reliability of programs that…
In this paper, we study the stability of matrix polynomials under structured perturbations of their coefficients. More precisely, we consider a family of matrix polynomials \[…
Let $p$ be an idempotent ultrafilter over $\mathbb{N}$. For a positive integer $N$, let ${\cal P}_{\leq N}$ denote the additive group of polynomials $P\in\mathbb{Z}[x]$ with ${\rm deg}\, P\leq N$ and $P(0)=0$. Given a unitary operator $U$…
In this paper, we study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is either an arc,…
The algorithms of Pan (1995) and(2002) approximate the roots of a complex univariate polynomial in nearly optimal arithmetic and Boolean time but require precision of computing that exceeds the degree of the polynomial. This causes…
Given a connected graph $G$ whose vertices are perfectly reliable and whose edges each fail independently with probability $q\in[0,1],$ the \textit{(all-terminal) reliability} of $G$ is the probability that the resulting subgraph of…
Polyhedral Lyapunov functions can approximate any norm arbitrarily well. Because of this, they are used to study the stability of linear time varying and linear parameter varying systems without being conservative. However, the…