Counting invariant subspaces and decompositions of additive polynomials
From MaRDI portal
Publication:1994893
Abstract: The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f(x) = g(h(x)) in F[x] over a field F is well understood in many cases, but less well when the degree of f is divisible by the positive characteristic p of F. This work investigates the decompositions of r-additive polynomials, where every exponent and also the field size is a power of r, which itself is a power of p. The decompositions of an r-additive polynomial f are intimately linked to the Frobenius-invariant subspaces of its root space V in the algebraic closure of F. We present an efficient algorithm to compute the rational Jordan form of the Frobenius automorphism on V. A formula of Fripertinger (2011) then counts the number of Frobenius-invariant subspaces of a given dimension and we derive the number of decompositions with prescribed degrees.
Recommendations
Cites work
- \(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\))
- A new faster algorithm for factoring skew polynomials over finite fields
- A polynomial time algorithm for computing all minimal decompositions of a polynomial
- Composition collisions and projective polynomials: statement of results
- Compositions and collisions at degree p^2
- Counting decomposable univariate polynomials
- Explicit formulas for strong Davenport pairs
- Factoring in skew-polynomial rings over finite fields
- Factorization of a class of polynomials over finite fields
- Fast Multiplication for Skew Polynomials
- Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
- Functional decomposition of polynomials: the tame case
- Functional decomposition of polynomials: the wild case
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 4202411 (Why is no real title available?)
- scientific article; zbMATH DE number 4033867 (Why is no real title available?)
- scientific article; zbMATH DE number 3765914 (Why is no real title available?)
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 1222351 (Why is no real title available?)
- scientific article; zbMATH DE number 1273634 (Why is no real title available?)
- scientific article; zbMATH DE number 1467743 (Why is no real title available?)
- scientific article; zbMATH DE number 1867224 (Why is no real title available?)
- scientific article; zbMATH DE number 3095858 (Why is no real title available?)
- Hyperquadratic power series of degree four
- m-Sequences of Lengths 22k − 1 and 2 k − 1 with at Most Four-Valued Cross Correlation
- Modern computer algebra
- Nearly Optimal Algorithms for Canonical Matrix Forms
- On \(x^6+x+a\) in characteristic three
- On \(x^{q+1}+ax+b\)
- On additive polynomials over a finite field
- On decomposition of sub-linearised-polynomials
- On permutation polynomials of prescribed shape
- On the invariance of chains of fields
- Polynomial decomposition algorithms
- Polynomial decomposition algorithms
- Powers of tensors and fast matrix multiplication
- Prime and composite polynomials
- Projective polynomials
- Ritt's Second Theorem in arbitrary characteristic.
- Self-dual skew codes and factorization of skew polynomials
- Solvability by radicals is in polynomial time
- Tame decompositions and collisions
- The cycle structure of a linear transformation over a finite field
- The Invariant Subspace Lattice of a Linear Transformation
- The number of invariant subspaces under a linear operator on finite vector spaces
Cited in
(3)
This page was built for publication: Counting invariant subspaces and decompositions of additive polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994893)
