...
首页> 外文期刊>Journal of symbolic computation >Counting invariant subspaces and decompositions of additive polynomials
【24h】

Counting invariant subspaces and decompositions of additive polynomials

机译:计数不变子空间和附加多项式的分解

获取原文
获取原文并翻译 | 示例

摘要

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 = g circle h 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. (C) 2020 Elsevier Ltd. All rights reserved.
机译:多项式的功能(de)组成是纯粹和计算机代数的主题,具有许多应用。在F场F上的(适当归一化)多项式F = G圈H的分解结构在许多情况下很好地理解,但是当F的阳性特征P被F的阳性特性P即,较少工作调查R-添加剂多项式的分解,其中每个指数和场大小是R的功率,它本身就是P的力量。R-添加剂多项式F的分解与Frobenius-FunAliant子空间密切相关它的根空间V在F的代数封闭中。我们提出了一种有效的算法来计算V. Fripertinger(2011)的公式计算Frobenius自动形式的Rational Jordan形式,然后计算给定维度的Frobenius-Invariant子空间的数量我们从规定的程度派生了分解的数量。 (c)2020 elestvier有限公司保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号