Counting polynomials with distinct roots using subset sum

DOI10.1007/978-3-031-81824-0_11MaRDI QIDQ6996918zbMATH OpenFDO

Authors Simon Kuttner, Zhicheng Gao, Qiang Wang

Publication date 15 April 2025

Full work available at URL https://doi.org/10.1007/978-3-031-81824-0_11

zbMATH Keywords

subset sumprescribed coefficientsdistinct roots

Mathematics Subject Classification ID

Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Additive bases, including sumsets (11B13)

Cites work

• scientific article; zbMATH DE number 3404329 (Why is no real title available?)
• Counting polynomials over finite fields with prescribed leading coefficients and linear factors
• Counting subset sums of finite Abelian groups
• Hamming weights in irreducible cyclic codes
• On the subset sum problem over finite fields
• Subset sums of quadratic residues over finite fields
• The subset sum problem for finite abelian groups

This page was built for publication: Counting polynomials with distinct roots using subset sum

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