Related papers: New parameters of subsets in polynomial schemes

First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…

A complete intersection of n polynomials in n indeterminates has only a finite number of zeros. In this paper we address the following question: how do the zeros change when the coefficients of the polynomials are perturbed? In the first…

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

This paper investigates the zero distribution of a sequence of polynomials $\left\{ P_{m}(z)\right\} _{m=0}^{\infty}$ generated by the reciprocal of $1+ct+B(z)t^{2}+A(z)t^{3}$ where $c\in\mathbb{R}$ and $A(z)$, $B(z)$ are real linear…

Nowhere dense classes of graphs are very general classes of uniformly sparse graphs with several seemingly unrelated characterisations. From an algorithmic perspective, a characterisation of these classes in terms of uniform quasi-wideness,…

The q-Legendre polynomials can be treated as some special "functions in the quantum double cosets $U(1)\setminus SU_q(2)/U(1)$". They form a family (depending on a parameter $q$) of polynomials in one variable. We get their further…

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a…

Subspace clustering, the task of clustering high dimensional data when the data points come from a union of subspaces is one of the fundamental tasks in unsupervised machine learning. Most of the existing algorithms for this task require…

We prove that star-like limit cycles of any planar polynomial system can also be seen either as solutions defined on a given interval of a new associated planar non-autonomous polynomial system or as heteroclinic solutions of a…

The classification problem of $P$- and $Q$-polynomial association schemes has been one of the central problems in algebraic combinatorics. Generalizing the concept of $P$- and $Q$-polynomial association schemes to multivariate cases, namely…

Simply put, a sparse polynomial is one whose zero coefficients are not explicitly stored. Such objects are ubiquitous in exact computing, and so naturally we would like to have efficient algorithms to handle them. However, with this compact…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

In this paper, we obtain several new classes of irreducible polynomials having integer coefficients whose zeros lie inside an open disk around the origin or outside a closed annular region in the complex plane. Such irreducible polynomials…

We show that, for a system of univariate polynomials given in sparse encoding, we can compute a single polynomial defining the same zero set, in time quasi-linear in the logarithm of the degree. In particular, it is possible to determine…

If f is a polynomial with integer coefficients and q is an integer, we may regard f as a map from Z/qZ to Z/qZ. We show that the distribution of the (normalized) spacings between consecutive elements in the image of these maps becomes…

We evaluate the variance of coefficients of the characteristic polynomial for binary quantum graphs using a dynamical approach. This is the first example where a spectral statistic can be evaluated in terms of periodic orbits for a system…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

We study the vanishing sets of slice regular polynomials in several quaternionic variables. We obtain a geometric description of the vanishing sets in two variables, which leads to a new version of the Strong Hilbert Nullstellensatz in the…