Abstract
Decomposable combinatorial structures are studied with restricted patterns. We focus on the decomposable structures in the exp-log class. Using the method of analysis of singularities introduced by Flajolet and Odlyzko [5], we provide an estimate for the probability that a decomposable structure of size n has a given restricted pattern. We exemplify with several decomposable structures like permutations and polynomials over finite fields.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
