On an Extremal Problem About the Arc-Length of Algebraic Polynomials

In this work we investigate polynomials of maximal (minimal) arc-length in the interval [−1, 1] amongst all monic polynomials of fixed degree n with n real zeros in [−1, 1].     

On an Extremal Problem About the Arc-Length of Algebraic Polynomials

In this work we investigate polynomials of maximal (minimal) arc-length in the interval [−1, 1] amongst all monic polynomials of fixed degree n with n real zeros in [−1, 1].     

Uniqueness of extensions of homogeneous polynomials on c0-sum of Hilbert spaces

We study the uniqueness of norm-preserving extension of n-homogeneous polynomials on X, where X is a c₀-sum of Hilbert spaces. We show that there exists a unique norm-preserving extension for norm-attaining 2-homogeneous polynomials on X to X″, but this result fails for homogeneous polynomials of degree greater than 2.     

A resultant system as the set of coefficients of a single resultant

Explicit expressions for polynomials forming a homogeneous resultant system of a set of m+1 homogeneous polynomial equations in n+1<m+1 variables are given. These polynomials are obtained as coefficients of a homogeneous resultant for an appropriate system of n+1 equations in n+1 variables, which is explicitly constructed from the initial system. Similar results are obtained for mixed resultant systems of sets of n + 1 sections of line bundles on a projective variety of dimension n < m. As an application, an algorithm determining whether one of the orbits under an action of an affine irreducible algebraic group on a quasi-affine variety is contained in the closure of another orbit is described.     

A general method for construction of (<Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">n</Emphasis>)-threshold visual secret sharing schemes for color images

This paper is concerned with the construction of basis matrices of visual secret sharing schemes for color images under the (t, n)-threshold access structure, where n ≥ t ≥ 2 are arbitrary integers. We treat colors as elements of a bounded semilattice and regard stacking two colors as the join of the two corresponding elements. We generate n shares from a secret image with K colors by using K matrices called basis matrices. The basis matrices considered in this paper belong to a class of matrices each element of which is represented by a homogeneous polynomial of degree n. We first clarify a condition such that the K matrices corresponding to K homogeneous polynomials become basis matrices. Next, we give an algebraic scheme for the construction of basis matrices. It is shown that under the (t, n)-threshold access structure we can obtain K basis matrices from appropriately chosen K − 1 homogeneous polynomials of degree n by using simple algebraic operations. In particular, we give basis matrices that are unknown so far for the cases of t = 2, 3 and n − 1.     

A Poisson * Negative Binomial Convolution Law for Random Polynomials over Finite Fields

Let F _q[X] denote a polynomial ring over a finite field F _q with q elements. Let 𝒫_n be the set of monic polynomials over F _q of degree n. Assuming that each of the qⁿ possible monic polynomials in 𝒫_n is equally likely, we give a complete characterization of the limiting behavior of P(Ω_n=m) as n→∞ by a uniform asymptotic formula valid for m≥1 and n−m→∞, where Ω_n represents the number (multiplicities counted) of irreducible factors in the factorization of a random polynomial in 𝒫_n. The distribution of Ω_n is essentially the convolution of a Poisson distribution with mean log n and a negative binomial distribution with parameters q and q⁻¹. Such a convolution law exhibits three modes of asymptotic behaviors: when m is small, it behaves like a Poisson distribution; when m becomes large, its behavior is dominated by a negative binomial distribution, the transitional behavior being essentially a parabolic cylinder function (or some linear combinations of the standard normal law and its iterated integrals). As applications of this uniform asymptotic formula, we derive most known results concerning P(Ω_n=m) and present many new ones like the unimodality of the distribution. The methods used are widely applicable to other problems on multiset constructions. An extension to Rényi's problem, concerning the distribution of the difference of the (total) number of irreducibles and the number of distinct irreducibles, is also presented. © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 13, 17–47, 1998     

Group actions and invariants in algebras of generic matrices

We show that the fixed elements for the natural GL_m-action on the universal division algebra UD(m,n) of m generic n×n-matrices form a division subalgebra of degree n, assuming n3 and 2mn²−2. This allows us to describe the asymptotic behavior of the dimension of the space of SL_m-invariant homogeneous central polynomials p(X₁,…,X_m) for n×n-matrices. Here the base field is assumed to be of characteristic zero.     

Reproducing kernels for polyharmonic polynomials

The reproducing kernel of the space of all homogeneous polynomials of degree k and polyharmonic order m is computed explicitly, solving a question of A. Fryant and M. K. Vemuri. Received: 17 May 2007, Revised: 27 March 2008     

On the enumeration of polynomials with prescribed factorization pattern

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of monic n-smooth polynomials of degree m over a finite field, as well as the number of monic n-smooth polynomials of degree m with the prescribed trace coefficient.     

Second degree classical forms

A form (linear functional) u is called regular if there exists a sequence of polynomials {P_n}_n≥0, deg P_n = n which is orthogonal with respect to u. Such a form is said to be of second degree if there are polynomials B and C such that the Stieltjes function satisfies a relation of the form BS²(u) + CS(u) + D = 0.Classical forms correspond to classical orthogonal polynomials: sequences of polynomials whose derivatives also form an orthogonal sequence. In this paper, the authors determine all the classical forms which are of second degree. They show that Hermite, Laguerre and Bessel forms are not of second degree. Only Jacobi forms which satisfy a certain condition possess this property.     

The number of limit cycles of cubic Hamiltonian system with perturbation

In this paper, by using qualitative analysis, we investigate the number of limit cycles of perturbed cubic Hamiltonian system with perturbation in the form of (2n+2m) or (2n+2m+1)th degree polynomials . We show that the perturbed systems has at most (n+m) limit cycles, and has at most n limit cycles if m=1. If m=1, n=1 and m=1, n=2, the general conditions for the number of existing limit cycles and the stability of the limit cycles will be established, respectively. Such conditions depend on the coefficients of the perturbed terms. In order to illustrate our results, two numerical examples on the location and stability of the limit cycles are given.     

On the inequality μ(mM) ≥ μ(M) over polynomial rings

In [4], Macaulay proved that μ(mI) ≥ Q(μ(I)) ≥ μ(I) for any homogeneous ideal I in k[X ₁, …,X_n ] with minimal generators of a single degree where m is the homogeneous maximal ideal (X ₁, …,X_n ) and Q is the function called the Binomial Expansion base n - 1. The inequelity can be generalised to the case of torsion-fre modules with generators of a single degree. The proof follows the lines of Robbiano [5]. A family of counterexamples to μ(mI) ≥ μ(I) in which I has minimal generators of just two different degrees is given.     

Orthogonal polynomials on the disc

We consider the space P_n of orthogonal polynomials of degree n on the unit disc for a general radially symmetric weight function. We show that there exists a single orthogonal polynomial whose rotations through the angles , j=0,1,…,n forms an orthonormal basis for P_n, and compute all such polynomials explicitly. This generalises the orthonormal basis of Logan and Shepp for the Legendre polynomials on the disc.Furthermore, such a polynomial reflects the rotational symmetry of the weight in a deeper way: its rotations under other subgroups of the group of rotations forms a tight frame for P_n, with a continuous version also holding. Along the way, we show that other frame decompositions with natural symmetries exist, and consider a number of structural properties of P_n including the form of the monomial orthogonal polynomials, and whether or not P_n contains ridge functions.     

A miraculously commuting family of orthogonal matrix polynomials satisfying second order differential equations

We find structural formulas for a family (P_n)_n of matrix polynomials of arbitrary size orthogonal with respect to the weight matrix e^−t2e^Ate^A∗t, where A is certain nilpotent matrix. It turns out that this family is a paradigmatic example of the many new phenomena that show the big differences between scalar and matrix orthogonality. Surprisingly, the polynomials P_n, n≥0, form a commuting family. This commuting property is a genuine and miraculous matrix setting because, in general, the coefficients of P_n do not commute with those of P_m, n≠m.     

On real and complex-valued bivariate Chebyshev polynomials

In the real uniform approximation of the function x^myⁿ by the space of bivariate polynomials of total degree m + n − 1 on the unit square, the product of monic univariate Chebyshev polynomials yields an optimal error. We exploit the fundamental Noether's theorem of algebraic curves theory to give necessary and sufficient conditions for unicity and to describe the set of optimal errors in case of nonuniqueness. Then, we extend these results to the complex approximation on biellipses. It turns out that the product of Chebyshev polynomials also provides an optimal error and that the same kind of uniqueness conditions prevail in the complex case. Yet, when nonuniqueness occurs, the characterization of the set of optimal errors presents peculiarities, compared to the real problem.     

Zero subspaces of polynomials on

We provide two examples of complex homogeneous quadratic polynomials P on Banach spaces of the form ℓ₁(Γ). The first polynomial P has both separable and nonseparable maximal zero subspaces. The second polynomial P has the property that while the index-set Γ is not countable, all zero subspaces of P are separable.     

On rank and null space computation of the generalized Sylvester matrix

In this paper, we present new approaches computing the rank and the null space of the (m n + p)×(n + p) generalized Sylvester matrix of (m + 1) polynomials of maximal degrees n,p. We introduce an algorithm which handles directly a modification of the generalized Sylvester matrix, computing efficiently its rank and null space and replacing n by log ₂ n in the required complexity of the classical methods. We propose also a modification of the Gauss-Jordan factorization method applied to the appropriately modified Sylvester matrix of two polynomials for computing simultaneously its rank and null space. The methods can work numerically and symbolically as well and are compared in respect of their error analysis, complexity and efficiency. Applications where the computation of the null space of the generalized Sylvester matrix is required, are also given.     

Polynomial-time computation of the degree of a dominant morphism in zero characteristic. IV

Consider a projective algebraic variety W that is an irreducible component of the set of all common zeros of a family of homogeneous polynomials of degrees less than d in n + 1 variables in zero characteristic. Consider a dominant rational morphism from W to W′ given by homogeneous polynomials of degree d′. We suggest algorithms for constructing objects in general position related to this morphism. These algorithms are deterministic and polynomial in (dd′) ⁿ and the size of the input. This work concludes a series of four papers. Bibliography: 13 titles. Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 360, 2008, pp. 260–294.     

On the Order of the Lebesgue Constants for Interpolation by Algebraic Polynomials from Values at Uniform Nodes of a Simplex

For interpolation processes by algebraic polynomials of degree n from values at uniform nodes of an m-simplex, where m ≥ 2, we obtain the order of growth in n of the Lebesgue constants, which coincides with that in the one-dimensional case for which Turetskii obtained an asymptotics earlier.__________Translated from Matematicheskie Zametki, vol. 77, no. 6, 2005, pp. 814–831.Original Russian Text Copyright ©2005 by N. V. Baidakova.     

Polynomial-Time Computation of the Degree of a Dominant Morphism in Characteristic Zero. I

Consider a projective algebraic variety W that is an irreducible component of the set of all common zeros of a family of homogeneous polynomials of degrees less than d in n + 1 variables over the field of characteristic zero. We show how to compute the degree of a dominant rational morphism from W to W′. The morphism is given by homogeneous polynomials of degree d′.This algorithms is deterministic and polynomial in (dd′)ⁿ and the size of the input. Bibliography: 11 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 307, 2003, pp. 189–235.