How many Boolean polynomials are irreducible?

DOI10.1142/S0218196714500520MaRDI QIDQ5175607zbMATH OpenOpenAlexFDO

Authors Ya. N. Shitov

Publication date 24 February 2015

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218196714500520

zbMATH Keywords

Boolean semiringirreducible polynomialtropical semiring

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09) Max-plus and related algebras (15A80) Boolean and Hadamard matrices (15B34)

Recommendations

• Certain problems associated with Boolean polynomials
• On the number of irreducible polynomials with 0,1 coefficients
• Counting reducible, powerful, and relatively irreducible multivariate polynomials over finite fields (extended abstract)
• On the number of roots of Boolean polynomials
• Symmetric boolean polynomials

Cites work

• Decomposition of polytopes and polynomials
• Finding all essential terms of a characteristic maxpolynomial.
• Max-algebra: The linear algebra of combinatorics?
• On the frontiers of polynomial computations in tropical geometry
• On the job rotation problem

Cited in

(4)

• How many Boolean algebras \({\mathcal P}(\mathbb{N})/{\mathcal I}\) are there?
• \(\mathbb{Z}_2\)-algebras in the Boolean function irreducible decomposition
• Indecomposability over the max-min semiring
• On algebraic properties of power monoids of numerical monoids

This page was built for publication: How many Boolean polynomials are irreducible?

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