Polynomial factorization over

We describe algorithms for polynomial factorization over the binary field , and their implementation. They allow polynomials of degree up to to be factored in about one day of CPU time, distributing the work on two processors.

     

Polynomial parametrization of integer matrices with given determinant

We give a polynomial parametrization for the set of all integer square matrices of given size and determinant.     

On the factorization of polynomial matrices over the domain of principal ideals

We consider the problem of decomposition of polynomial matrices over the domain of principal ideals into a product of factors of lower degrees with given characteristic polynomials. We establish necessary and, under certain restrictions, sufficient conditions for the existence of the required factorization.     

The number of irreducible polynomials over finite fields of characteristic 2 with given trace and subtrace

In this paper we obtained the formula for the number of irreducible polynomials with degree n over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al. (2003) [2].     

The existence of matrices with prescribed characteristic and permanental polynomials

Let d(λ) and p(λ) be monic polynomials of degree n?2 with coefficients in F, an algebraically closed field or the field of all real numbers. Necessary and sufficient conditions for the existence of an n-square matrix A over F such that det(λI?A)=d(λ) and per(λI?A=p(λ) are given in terms of the coefficients of d(λ) and p(λ).     

Integer-valued polynomials over matrices and divided differences

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided differences. A necessary and sufficient condition on $f\in K[X]$ to be integer-valued over $M_n(D)$ is that, for each $k$ less than $n$ , the $k$ th divided difference of $f$ is integral-valued on every subset of the roots of any monic polynomial over $D$ of degree $n$ . If in addition $D$ has zero Jacobson radical then it is sufficient to check the above conditions on subsets of the roots of monic irreducible polynomials of degree $n$ , that is, conjugate integral elements of degree $n$ over $D$ .     

Undecidability in matrices over Laurent polynomials

We show that it is undecidable for finite sets S of upper triangular (4×4)-matrices over Z[x,x⁻¹] whether or not all elements in the semigroup generated by S have a nonzero constant term in some of the Laurent polynomials of the first row. This result follows from a representations of the integer weighted finite automata by matrices over Laurent polynomials.     

Central polynomials for matrices over finite fields

Let c(x ₁,?…?,?x _d ) be a multihomogeneous central polynomial for the n?×?n matrix algebra M _n (K) over an infinite field K of positive characteristic p. We show that there exists a multihomogeneous polynomial c ₀(x ₁,?…?,?x _d ) of the same degree and with coefficients in the prime field 𝔽 _p which is central for the algebra M _n (F) for any (possibly finite) field F of characteristic p. The proof is elementary and uses standard combinatorial techniques only.     

Polynomial functions and permutation polynomials over some finite commutative rings

We extend some classical results on polynomial functions . We prove all results in algebraic methods avoiding any combinatorial calculation. As applications of our methods, we obtain some interesting new results on permutation polynomials in several variables over some finite commutative rings.     

Polynomial identities for matrices over the Grassmann algebra

We determine minimal Cayley–Hamilton and Capelli identities for matrices over a Grassmann algebra of finite rank. For minimal standard identities, we give lower and upper bounds on the degree. These results improve on upper bounds given by L. Márki, J. Meyer, J. Szigeti and L. van Wyk in a recent paper.     

On zeros of polynomials orthogonal over a convex domain

We establish a discrepancy theorem for signed measures, with a given positive part, which are supported on an arbitrary convex curve. As a main application, we obtain a result concerning the distribution of zeros of polynomials orthogonal on a convex domain.     

Windmill polynomials over fields of characteristic two

Chambers andSmeets [3] have designed a windmill arrangement of linear feedback shift registers (LFSRs) to generate pn-sequences overGF(2) with high speed. When the windmill hasv vanes, the associated minimal feedback polynomial (having degreen, relatively prime tov) can be taken to have the shapef ₁(x ^v )+x ⁿ f ₂(x ^–v ), where the polynomialsf ₁ andf ₂ have degree [n/v]. Their numerical evidence, whenv is divisible by 4, suggests that, surprisingly, there areno such windmill polynomials which are irreducible ifn±3 (mod 8), while about twice as many irreducible and primitive windmill polynomials as they expected occur ifn±1 (mod 8). A discussion of this behaviour is presented here with proofs. The brief explanation is that the Galois group of the underlying generic windmill polynomial overGF (4) is equal to the alternating groupA _n .     

Degenerate Bernoulli polynomials, generalized factorial sums, and their applications

We prove a general symmetric identity involving the degenerate Bernoulli polynomials and sums of generalized falling factorials, which unifies several known identities for Bernoulli and degenerate Bernoulli numbers and polynomials. We use this identity to describe some combinatorial relations between these polynomials and generalized factorial sums. As further applications we derive several identities, recurrences, and congruences involving the Bernoulli numbers, degenerate Bernoulli numbers, generalized factorial sums, Stirling numbers of the first kind, Bernoulli numbers of higher order, and Bernoulli numbers of the second kind.     

Cauchy型矩阵及其逆矩阵的快速三角分解

Abstract, In this paper,algorithms for determining the triangular factorization of Cauchy typematrices and their inverses are derived by using O(n2) operations.     

随机矩阵特征多项式的相关函数的多项式表示

利用正交多项式的性质给出了高斯辛系综中酉辛群上的随机矩阵特征多项式的相关函数和矩的简洁的行列式表示,且行列式的元为正交多项式.     

Universal similarity factorization equalities for commutative quaternions and their matrices

In this work, we have established universal similarity factorization equalities over the commutative quaternions and their matrices. Based on these equalities, real matrix representations of commutative quaternions and their matrices have been derived, and their algebraic properties and fundamental equations have been determined. Moreover, illustrative examples are provided to support our results.