This chapter introduces a finer level of analysis for counting sequences or collections that are subject to some occupancy constraint, namely a constraint on the number of repetitions of its elements. Several problems are considered. As more unusual application in this framework, we prove the Leibniz rule for the derivatives of a product of functions, and count, in terms of the Catalan numbers, the Dyck sequences, i.e., the binary sequences of even length with equal number of 0’s and 1’s where, at each position, the number of 1’s does not exceed the number of 0’s.
Occupancy constraints
Mariconda C.;Tonolo A.
2016
Abstract
This chapter introduces a finer level of analysis for counting sequences or collections that are subject to some occupancy constraint, namely a constraint on the number of repetitions of its elements. Several problems are considered. As more unusual application in this framework, we prove the Leibniz rule for the derivatives of a product of functions, and count, in terms of the Catalan numbers, the Dyck sequences, i.e., the binary sequences of even length with equal number of 0’s and 1’s where, at each position, the number of 1’s does not exceed the number of 0’s.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.