AbstractWe describe a combinatorial model which encompasses the enumeration of many types of ordered structures and determine the behavior of three random variables which record certain numerical parameters of such structures. Examples to which our results are applicable include chains in binomial posets, direct sum decompositions of finite vector spaces, binary words, and Fishburn's generalized weak orders
"Ordered sets are ubiquitous in mathematics and have significant applications in computer science, s...
In many practical applications, mathematical models of ordered random variables play an important ro...
AbstractWe investigate from probabilistic point of view the asymptotic behavior of the number of dis...
We describe a combinatorial model which encompasses the enumeration of many types of ordered structu...
AbstractWe describe a combinatorial model which encompasses the enumeration of many types of ordered...
This thesis is presented in two parts. In the first part, we study a family of models of random par...
AbstractFor any property θ of a model (or graph), let μn(θ) be the fraction of models of power n whi...
AbstractConsider the number of cycles in a random permutation or a derangement, the number of compon...
We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational langu...
AbstractGoodman and Pollack have asked to estimate the probabilities of order types by using a unifo...
Series Encyclopedia of Mathematics and Its Applications (No. 144)Ordered sets are ubiquitous in math...
We derive limit laws for random combinatorial structures using singularity analysis of generating fu...
En aquesta tesi s'estudien diferents problemes en el camp de la combinatòria i la teoria de grafs, u...
Torres F. On the probabilistic longest common subsequence problem for sequences of independent block...
AbstractA popular model of random orders is obtained by taking two disjoint n-element antichains A1 ...
"Ordered sets are ubiquitous in mathematics and have significant applications in computer science, s...
In many practical applications, mathematical models of ordered random variables play an important ro...
AbstractWe investigate from probabilistic point of view the asymptotic behavior of the number of dis...
We describe a combinatorial model which encompasses the enumeration of many types of ordered structu...
AbstractWe describe a combinatorial model which encompasses the enumeration of many types of ordered...
This thesis is presented in two parts. In the first part, we study a family of models of random par...
AbstractFor any property θ of a model (or graph), let μn(θ) be the fraction of models of power n whi...
AbstractConsider the number of cycles in a random permutation or a derangement, the number of compon...
We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational langu...
AbstractGoodman and Pollack have asked to estimate the probabilities of order types by using a unifo...
Series Encyclopedia of Mathematics and Its Applications (No. 144)Ordered sets are ubiquitous in math...
We derive limit laws for random combinatorial structures using singularity analysis of generating fu...
En aquesta tesi s'estudien diferents problemes en el camp de la combinatòria i la teoria de grafs, u...
Torres F. On the probabilistic longest common subsequence problem for sequences of independent block...
AbstractA popular model of random orders is obtained by taking two disjoint n-element antichains A1 ...
"Ordered sets are ubiquitous in mathematics and have significant applications in computer science, s...
In many practical applications, mathematical models of ordered random variables play an important ro...
AbstractWe investigate from probabilistic point of view the asymptotic behavior of the number of dis...