On finding a particular class of combinatorial identities
| dc.creator | Iordjev, Krassimir Yankov | |
| dc.creator | Kovachev, Dimiter Stoichkov | |
| dc.date | 2009-02-06 | |
| dc.date | 2009-02-09 | |
| dc.date.accessioned | 2026-07-07T12:38:54Z | |
| dc.date.available | 2026-07-07T12:38:54Z | |
| dc.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. | |
| dc.description | 5 pages | |
| dc.identifier | https://arxiv.org/abs/0902.1045 | |
| dc.identifier | http://arxiv.org/abs/0902.1045 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/218924 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | G.2.1 | |
| dc.title | On finding a particular class of combinatorial identities | |
| dc.type | text |