On finding a particular class of combinatorial identities
Discrete Mathematics
2009-02-09 v2
Abstract
In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two ways". The principle of inclusion and exclusion is used for obtaining a class of (0,1)-matrices.
Keywords
Cite
@article{arxiv.0902.1045,
title = {On finding a particular class of combinatorial identities},
author = {Krassimir Yankov Iordjev and Dimiter Stoichkov Kovachev},
journal= {arXiv preprint arXiv:0902.1045},
year = {2009}
}
Comments
5 pages