Related papers: Ordering of nested square roots of 2 according to …
Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…
We study interlacing properties of the zeros of two types of linear combinations of Laguerre polynomials with different parameters, namely $R_n=L_n^{\alpha}+aL_{n}^{\alpha'}$ and $S_n=L_n^{\alpha}+bL_{n-1}^{\alpha'}$. Proofs and numerical…
We discuss the zero sets of two-variable polynomials as they relate to an approximation problem in the Hardy space on the bidisk.
A combinatorial Gray code for a set of combinatorial objects is a sequence of all combinatorial objects in the set so that each object is derived from the preceding object by changing a small part. In this paper we design a Gray code for…
In this paper, we determine the numb er of zeros and the zero inclusion regions of a two-parameter family of harmonic quadrinomials. We also determine a curve that separates sense-preserving and sense-reversing regions for these families of…
We show that the zeroes of the Alexander polynomial of a Lorenz knot all lie in some annulus whose width depends explicitly on the genus and the braid index of the considered knot.
Using a variety of matrix techniques, the problem of locating the left eigenvalues of the quaternion companion matrices are investigated in this paper. In a recent paper, Dar et al. [6], proved that the zeros of a quaternionic polynomial…
Finding an approximate region containing all the zeros of analytic polynomials is a well-studied problem. But the numb er of the zeros and regions containing all the zeros of complex-valued harmonic polynomials is relatively a fresh…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
We design a polynomial time decoding algorithm for linearized Algebraic Geometry codes with unramified evaluation places, a family of sum-rank metric evaluation codes on division algebras over function fields. By establishing a Serre…
Cyclic codes of dimension $2$ over a finite field are shown to have at most two nonzero weights. This extends a construction of Rao et al (2010) and disproves a conjecture of Schmidt-White (2002). We compute their weight distribution, and…
We begin by considering a sequence of polynomials in three variables whose coefficients count restricted binary overpartitions with certain properties. We then concentrate on two specific subsequences that are closely related to the…
We investigate the problem of determining the zeros of quaternionic polynomials using matrix method. In a recent paper, Dar et al. \cite{RD} proved that the zeros of a quaternionic polynomial and the left eigenvalues of the corresponding…
A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…
Let $F$ be a finite field of $char F > 3$ and $sl_{2}(F)$ be the Lie algebra of traceless $2\times 2$ matrices over $F$. This paper aims for the following goals: Find a basis for the $\mathbb{Z}_{2}$-graded identities of $sl_{2}(F)$; Find a…
In this work, two algorithms are developed related to lattice codes. In the first one, an extended complete Gr\"obner basis is computed for the label code of a lattice. This basis supports all term orderings associated with a total degree…
We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the…
We show that with high probability the number of real zeroes of a random polynomial is bounded by the number of vertices on its Newton-Hadamard polygon times the cube of the logarithm of the polynomial degree. A similar estimate holds for…
We investigate Dilcher and Stolarsky's polynomial analogue of the Stern diatomic sequence. Basic information is obtained concerning the distribution of their zeros in the plane. Also, uncountably many subsequences are found which each…
It is well known that for two univariate polynomials over complex number field the number of their common roots is equal to the order of their resultant. In this paper, we show that this fundamental relationship still holds for the tropical…