Advanced Elementary Symmetric Polynomials Calculation Algorithm
نویسنده
چکیده
The main objective of this article is to construct a totally new, effective algorithm, for the calculations of all series of elementary symmetric polynomials at once for the arbitrary order of the general polynomial. We proved that the effectiveness of the advanced algorithm proposed in this article is by the linear term better than the algorithms existing in the literature so far. Moreover, we proved that the algorithm we proposed has the best possible computational complexity in the task of elementary symmetrical polynomials algorithm calculation. Key-Words: Linear Algebra, Elementary Symmetric Polynomials
منابع مشابه
When is the Algebra of Multisymmetric Polynomials Generated by the Elementary Multisymmetric Polynomials?
Multisymmetric polynomials are the r-fold diagonal invariants of the symmetric group Sn. Elementary multisymmetric polynomials are analogues of the elementary symmetric polynomials, in the multisymmetric setting. In this paper, we give a necessary and sufficient condition on a ring A for the algebra of multisymmetric polynomials with coefficients in A to be generated by the elementary multisymm...
متن کاملInequalities and tail bounds for elementary symmetric polynomial with applications
This paper studies the elementary symmetric polynomials Sk(x) for x ∈ Rn. We show that if |Sk(x)|, |Sk+1(x)| are small for some k > 0 then |Sl(x)| is also small for all l > k. We use this to prove probability tail bounds for the symmetric polynomials when the inputs are only t-wise independent, that may be useful in the context of derandomization. We also provide examples of t-wise independent ...
متن کاملLimit Cycle bifurcations from Centers of Symmetric Hamiltonian Systems perturbed by cubic polynomials
In this paper, we consider some cubic near-Hamiltonian systems obtained from perturbing the symmetric cubic Hamiltonian system with two symmetric singular points by cubic polynomials. First, following Han [2012] we develop a method to study the analytical property of the Melnikov function near the origin for near-Hamiltonian system having the origin as its elementary center or nilpotent center....
متن کاملEvaluation techniques and symmetric polynomials
Standard algorithms for dealing with symmetric polynomials are presented using rewriting techniques. This is for instance the case of the ”fundamental theorem of symmetric polynomials”, which states that any symmetric polynomial is a polynomial in the elementary symmetric ones, and whose proof involves rewriting using a suitable elimination order. This kind approach usually spoils useful featur...
متن کاملThe Descent Monomials and a Basis for the Diagonally Symmetric Polynomials
Abstract Let R(X) = Q[x1,x2 xn] be the ring of polynomials in the variables X = {x1, X2,..., xn} and R*(X) denote the quotient of R(X) by the ideal generated by the elementary symmetric functions. Given a a e Sn, we let g a ( X ) = Yai>ai+1 (xa1,xa2 ... xai). In the late 1970s I. Cessel conjectured that these monomials, called the descent monomials, are a basis for R*(X). Actually, this result ...
متن کامل