On finding a particular class of combinatorial identities

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
5 pages

Keywords

Discrete Mathematics, G.2.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/218924

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0902.1045
 http://arxiv.org/abs/0902.1045

Collections

arXiv