Combinatorial problems connected with P. Hall's collection process

DOI10.33048/SEMI.2020.17.064MaRDI QIDQ779146zbMATH OpenOpenAlexFDO

Authors Vladimir Markovich Leontiev

Publication date 21 July 2020

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/semi.2020.17.064

zbMATH Keywords

Cartesian productcollection processbinary weight

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Factorials, binomial coefficients, combinatorial functions (05A10)

Recommendations

• Covering a set by subsets
• scientific article; zbMATH DE number 4075073
• The counting formulas of a class of combinatorial sets with some inequality constraints
• scientific article; zbMATH DE number 3645102
• Counting common representatives and symmetric chain decompositions

Cites work

• scientific article; zbMATH DE number 3137403 (Why is no real title available?)
• A Contribution to the Theory of Groups of Prime-Power Order
• On the Collection Process
• Two collection formulas

Cited in

(4)

• Integral Representation and the Computation of Multiple Combinatorial Sums from Hall’s Commutator Theory
• The counting formulas of a class of combinatorial sets with some inequality constraints
• Construction of Bayer's theorem in the sample space \(S^p_{N,r} (S^c_{N,r})\) of \(r\)-permutations/\(r\)-combinations
• On the collection process for positive words

This page was built for publication: Combinatorial problems connected with P. Hall's collection process

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