Submultiplicative polynomials in combinatorics

DOI10.1007/S11139-026-01475-6MaRDI QIDQ7395830zbMATH OpenFDO

Authors Krystian Gajdzica, Bernhard Heim, Markus Neuhauser, Błażej Żmija

Publication date 2026

Published in The Ramanujan Journal (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11139-026-01475-6

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial inequalities (05A20) Analytic theory of partitions (11P82)

Cites work

• A bijection for tuples of commuting permutations and a log-concavity conjecture
• Maximal multiplicative properties of partitions
• On a mod 3 property of -tuples of pairwise commuting permutations
• Orbifold Euler characteristics and the number of commuting \(m\)-tuples in the symmetric groups
• Parafermionic observables and their applications to planar statistical physics models
• Polynomials related to powers of the Dedekind eta function
• Polynomization of the Bessenrodt-Ono inequality
• Polynomization of the Bessenrodt-Ono type inequalities for \(A\)-partition functions
• Polynomization of the Liu-Zhang inequality for the overpartition function
• Some inequalities for k-colored partition functions
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)

This page was built for publication: Submultiplicative polynomials in combinatorics

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