Counting invariant subspaces and decompositions of additive polynomials

DOI10.1016/j.jsc.2020.06.008zbMath1480.12002arXiv1912.00212OpenAlexW3035888103MaRDI QIDQ1994893

Konstantin Ziegler, Joachim von zur Gathen, Mark W. Giesbrecht

Publication date: 18 February 2021

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.00212

zbMATH Keywords

finite fieldsadditive polynomialsrational Jordan formunivariate polynomial decomposition

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational methods for problems pertaining to field theory (12-08)

Related Items (1)

Counting decomposable polynomials with integer coefficients

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new faster algorithm for factoring skew polynomials over finite fields
• On \(x^{q+1}+ax+b\)
• Factorization of a class of polynomials over finite fields
• Functional decomposition of polynomials: the tame case
• Functional decomposition of polynomials: the wild case
• On permutation polynomials of prescribed shape
• Solvability by radicals is in polynomial time
• The cycle structure of a linear transformation over a finite field
• Factoring in skew-polynomial rings over finite fields
• On \(x^6+x+a\) in characteristic three
• Prime and composite polynomials
• Faster polynomial multiplication over finite fields using cyclotomic coefficient rings
• The number of invariant subspaces under a linear operator on finite vector spaces
• \(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\))
• Self-dual skew codes and factorization of skew polynomials
• On the invariance of chains of fields
• Modern Computer Algebra
• Composition collisions and projective polynomials
• Ritt's Second Theorem in arbitrary characteristic.
• Hyperquadratic power series of degree four
• Powers of tensors and fast matrix multiplication
• m-Sequences of Lengths 22k − 1 and 2 k  − 1 with at Most Four-Valued Cross Correlation
• On additive polynomials over a finite field
• Projective polynomials
• Explicit formulas for strong Davenport pairs
• On decomposition of sub-linearised-polynomials
• Nearly Optimal Algorithms for Canonical Matrix Forms
• Fast Multiplication for Skew Polynomials
• Compositions and collisions at degree p ²
• A polynomial time algorithm for computing all minimal decompositions of a polynomial
• Counting Decomposable Univariate Polynomials
• The Invariant Subspace Lattice of a Linear Transformation
• Polynomial decomposition algorithms
• Polynomial decomposition algorithms
• Tame decompositions and collisions

This page was built for publication: Counting invariant subspaces and decompositions of additive polynomials