An approach to normal polynomials through symmetrization and symmetric reduction

DOI10.1016/J.FFA.2024.102525MaRDI QIDQ6655751FDOQ6655751

Authors: Darien Connolly, Calvin George, Xiang-Dong Hou, Adam Madro, Vincenzo Pallozzi Lavorante 

Publication date: 27 December 2024

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Recommendations

• A criterion for the normality of polynomials over finite fields based on their coefficients
• Normal elements and irreducible polynomials in finite fields
• Normal bases and irreducible polynomials
• New recursive construction of normal polynomials over finite fields
• Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields

zbMATH Keywords

finite fieldGalois grouprepresentationsymmetrizationcharactergroup determinantnormal polynomial

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20) Separable extensions, Galois theory (12F10) Group rings of finite groups and their modules (group-theoretic aspects) (20C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Handbook of finite fields
• Primitive Normal Bases for Finite Fields
• Title not available (Why is that?)
• Representations and characters of groups.
• Optimal normal bases in \(GF(p^ n)\)
• Normal bases of cyclic fields of primepower degree
• Title not available (Why is that?)
• General formulas for solving solvable sextic equations
• Normal basis of finite field<tex>GF(2^m)</tex>(Corresp.)
• On the group determinant
• Solving Solvable Quintics
• Low Complexity Normal Elements over Finite Fields of Characteristic Two
• The origin of the theory of group characters
• New light on Frobenius' creation of the theory of group characters
• The Group Determinant Determines the Group
• Galois module structure
• Complexities of normal bases constructed from Gauss periods
• A criterion for the normality of polynomials over finite fields based on their coefficients
• An approach to normal polynomials through symmetrization and symmetric reduction

Cited In (2)

• A criterion for the normality of polynomials over finite fields based on their coefficients
• An approach to normal polynomials through symmetrization and symmetric reduction

This page was built for publication: An approach to normal polynomials through symmetrization and symmetric reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655751)