Let $N,E,X,K>0$ be integers such that $N+E<X$ and $K\le\min(N,E)$. The author proves the inequality $${X\choose N}-\sum_{j=0}^K{X-E\choose N-j}{E\choose j}\le{X\choose N}{NE\over (K+1)X},$$ where the motivation is that the left-hand side counts those $N$-element subsets of an $X$-element set $S$ which intersect a fixed $E$-element subset $T\subset S$ in at least $K+1$ elements. The inequality is compared with another one of the same sort that was obtained by Brüdern and Perelli.

Counting sets with exceptions / G. Molteni. - In: MATHEMATICAL INEQUALITIES & APPLICATIONS. - ISSN 1331-4343. - 7:2(2004), pp. 161-164.

Counting sets with exceptions

G. Molteni
2004

Abstract

Let $N,E,X,K>0$ be integers such that $N+E
Exceptional set
Settore MAT/05 - Analisi Matematica
2004
Article (author)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/6862
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact