The estimate of the number of permutationally-ordered sets

DOI10.3103/S0027132215030055zbMath1331.05009MaRDI QIDQ253952

M. I. Kharitonov

Publication date: 8 March 2016

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

zbMATH Keywords

integer matricesYoung diagramstwo-dimensional integer arrays

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subexponential estimates in the height theorem and estimates on numbers of periodic parts of small periods.
• Symmetric functions and P-recursiveness
• Finite basis property of identities of associative algebras
• Complexity of nonmatrix varieties of associative algebras. II
• Permutations, matrices, and generalized Young tableaux
• Gesetze in Ringen. I
• Longest Increasing and Decreasing Subsequences

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