Article
Licensed
Unlicensed
Requires Authentication
On a constructive approach to the calculation of cardinality of the Ryser classes
-
V. S. Krotkin
Published/Copyright:
October 19, 2009
Abstract
We consider the problem of calculation of cardinality of the classes of square matrices consisting of zeros and ones with given values of row and column sums. We obtain a recurrence relation which gives a possibility to calculate the cardinalities of these classes. In the proofs, we use a constructive approach, that is, we construct the combinatorial objects with given characteristics and calculate the number of distinct objects. An example of the use of the obtained relation is given.
Received: 2009-04-29
Published Online: 2009-10-19
Published in Print: 2009-October
© de Gruyter 2009
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
- On the limit distributions of the vertex degrees of conditional Internet graphs
- On the estimation of the periods of noisy binary periodic sequences
- On a constructive approach to the calculation of cardinality of the Ryser classes
- Positively closed classes of three-valued logic generated by one-place functions
- On combinatorial Gray codes with distance 3
- Optimal paths in oriented graphs and eigenvectors in max-⊗ systems
- The factorisation of one-generated partially foliated formations
- On finite lattices of topologies of commutative unary algebras
Articles in the same Issue
- On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
- On the limit distributions of the vertex degrees of conditional Internet graphs
- On the estimation of the periods of noisy binary periodic sequences
- On a constructive approach to the calculation of cardinality of the Ryser classes
- Positively closed classes of three-valued logic generated by one-place functions
- On combinatorial Gray codes with distance 3
- Optimal paths in oriented graphs and eigenvectors in max-⊗ systems
- The factorisation of one-generated partially foliated formations
- On finite lattices of topologies of commutative unary algebras
