Reduction of Permutation-Invariant Polynomials A Noncommutative Case Study

ISSN： 0890-5401

Source： Information and Computation, Vol.175, Iss.2, 2002-06, pp. : 158-170

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Permutation Polynomials Modulo 2 w

By Rivest R.L.

Finite Fields and Their Applications, Vol. 7, Iss. 2, 2001-04 ,pp. : 287-292

Elsevier

Access to resources Recommend Favorite

Groups of Permutation Polynomials over Finite Fields

By Stafford R.M.

Finite Fields and Their Applications, Vol. 4, Iss. 4, 1998-10 ,pp. : 450-452

Elsevier

Access to resources Recommend Favorite

Computing the Invariant Polynomials of a Polynomial Matrix. I

By Kublanovskaya V. N.

Journal of Mathematical Sciences, Vol. 121, Iss. 4, 2004-06 ,pp. : 2508-2510

Springer Publishing Company

Access to resources Recommend Favorite

Computing the Invariant Polynomials of a Polynomial Matrix. II

By Kublanovskaya V. N.

Journal of Mathematical Sciences, Vol. 121, Iss. 4, 2004-06 ,pp. : 2511-2518

Springer Publishing Company

Access to resources Recommend Favorite

Permutation Diagrams, Fixed Points and Kazhdan-Lusztig R -Polynomials

By Incitti Federico

Annals of Combinatorics, Vol. 10, Iss. 3, 2006-12 ,pp. : 369-387

Springer Publishing Company

Access to resources Recommend Favorite