The n-card problem, stochastic matrices, and the extreme principle

MaRDI QIDQ456313zbMATHFDO

Authors Justin H. C. Chan, Jonathan Jedwab

Publication date 24 October 2012

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i2p53

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

stochastic matrixtracepermutation matrix\(n\)-card problemextreme principletransversal sum

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Recommendations

• Cards, permutations, and sums
• On the Asymptotic Solution of a Card-Matching Problem
• Cardinality and structure of extreme infinite doubly stochastic matrices
• Largest and smallest maximal sets of pairwise disjoint partitions
• Certain nonbarycentric cohesive matrices

Cited in

(2)

• On the fundamental theorem of card counting, with application to the game of trente et quarante
• Cards, permutations, and sums

This page was built for publication: The \(n\)-card problem, stochastic matrices, and the extreme principle

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