相关论文: Cyclic Resultants

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

We determine the density of monic integer polynomials of given degree $n>1$ that have squarefree discriminant; in particular, we prove for the first time that the lower density of such polynomials is positive. Similarly, we prove that the…

A method for estimating the merit factors of sequences will be provided. The result is also effective in determining the nonexistence of certain infinite collections of cyclic difference sets and cyclic matrices and associated binary…

We prove that for any degree d, there exist (families of) finite sequences a_0, a_1,..., a_d of positive numbers such that, for any real polynomial P of degree d, the number of its real roots is less than or equal to the number of the…

We obtain several Cauchy-like and Pellet-like results for the zeros of a general complex polynomial by considering similarity transformations of the squared companion matrix and the reformulation of the zeros of a scalar polynomial as the…

Leibniz algebras generated by one element, called cyclic, provide simple and illuminating examples of many basic concepts. It is the purpose of this paper to illustrate this fact.

We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…

We consider generalized closest return times of a complex polynomial of degree at least two. Most previous studies on this subject have focused on the properties of polynomials with particular return times, especially the Fibonacci numbers.…

Let $f$ be a homogeneous polynomial of even degree $d$. We study the decompositions $f=\sum_{i=1}^r f_i^2$ where $\mathrm{deg} f_i=d/2$. The minimal number of summands $r$ is called the $2$-rank of $f$, so that the polynomials having…

Let R be a complete discrete valuation ring with maximal ideal generated by pi. Let f(X) in R[X] be a monic polynomial with nonzero discriminant Delta(f). Let s >= v_pi(Delta(f)) + 1. Suppose given a factorisation of f(X) in (R/pi^s R)[X]…

In this paper, we consider sequences of polynomials that satisfy differential--difference recurrences. Our interest is motivated by the fact that polynomials satisfying such recurrences frequently appear as generating polynomials of integer…

We carry out a detailed investigation of congruence half-factorial Krull monoids with finite cyclic class group and related problems. Specifically, we determine precisely all relatively large values that can occur as a minimal distance of a…

Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…

For a polynomial in several variables depending on some parameters, we discuss some results to the effect that for almost all values of the parameters the polynomial is irreducible. In particular we recast in this perspective some results…

In this paper we study the generalized Clifford algebra defined by Pappacena of a monic (with respect to the first variable) homogeneous polynomial $\Phi(Z,X_1,\dots,X_n)=Z^d-\sum_{k=1}^d f_k(X_1,\dots,X_n) Z^{d-k}$ of degree $d$ in $n+1$…

The aim of this paper is to determine the algebraic structure of multidimensional cyclic codes over a finite chain ring $\mathfrak{R}$. An algorithm to find the generator polynomials of $n$ dimensional ($n$D) cyclic codes of length…

Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

We consider random trigonometric polynomials with general dependent coefficients. We show that under mild hypotheses on the structure of dependence, the asymptotics as the degree goes to infinity of the expected number of real zeros…

We classify all self-reciprocal polynomials arising from reversed Dickson polynomials over $\mathbb{Z}$ and $\mathbb{F}_p$, where $p$ is prime. As a consequence, we also obtain coterm polynomials arising from reversed Dickson polynomials.