The estimate of the number of permutationally-ordered sets

DOI10.3103/S0027132215030055MaRDI QIDQ253952zbMATH OpenFDO

Authors M. I. Kharitonov

Publication date 8 March 2016

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/S0027132215030055

zbMATH Keywords

integer matricestwo-dimensional integer arraysYoung diagrams

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Recommendations

• Partially ordered sets and k-decomposability
• scientific article; zbMATH DE number 905031
• Enumerating orientations of ordered sets
• scientific article; zbMATH DE number 4016962
• On the maximum number of permutations with given maximal or minimal distance

Cites work

• Complexity of nonmatrix varieties of associative algebras. II
• Finite basis property of identities of associative algebras
• Gesetze in Ringen. I
• scientific article; zbMATH DE number 1567831 (Why is no real title available?)
• scientific article; zbMATH DE number 1567835 (Why is no real title available?)
• scientific article; zbMATH DE number 1567845 (Why is no real title available?)
• scientific article; zbMATH DE number 3401109 (Why is no real title available?)
• Longest Increasing and Decreasing Subsequences
• Permutations, matrices, and generalized Young tableaux
• Subexponential estimates in the height theorem and estimates on numbers of periodic parts of small periods.
• Symmetric functions and P-recursiveness

Cited in

(5)

• An ordering in \(\mathbb{R}^ n\) of a set of permutations
• On the number of orderings of \(n\) items
• Partially ordered sets and k-decomposability
• The enumeration of permutations whose posets have a maximum element
• The number of depth-first searches of an ordered set

This page was built for publication: The estimate of the number of permutationally-ordered sets

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