Method to rank and unrank semi-standard Young tableau for a partition of n

Author： K. V. Dinesha   P. C. P. Bhatt  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.82, Iss.1, 2005-01, pp. : 41-45

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Tableau method for residuated logic

By MacCaull W.  

Fuzzy Sets and Systems, Vol. 80, Iss. 3, 1996-06 ,pp. : 327-337

Elsevier

Access to resources Recommend Favorite

Note on a partition limit theorem for rank and crank

By Diaconis Persi   Janson Svante   Rhoades Robert C.  

Bulletin of the London Mathematical Society, Vol. 45, Iss. 3, 2013-06 ,pp. : 551-553

Oxford University Press

Access to resources Recommend Favorite

The intrinsic partition of unity method

By Fries Thomas-Peter   Belytschko Ted  

Computational Mechanics, Vol. 40, Iss. 4, 2007-09 ,pp. : 803-814

Springer Publishing Company

Access to resources Recommend Favorite

Unrestricted vs restricted cut in a tableau method for Boolean circuits

By Järvisalo Matti  

Annals of Mathematics and Artificial Intelligence, Vol. 44, Iss. 4, 2005-08 ,pp. : 373-399

Springer Publishing Company

Access to resources Recommend Favorite

Stability of the primal-dual partition in linear semi-infinite programming

By Ochoa Pablo D.  

Optimization, Vol. 61, Iss. 12, 2012-12 ,pp. : 1449-1465

Taylor & Francis Ltd

Access to resources Recommend Favorite