The problem of ranking (or perfect hashing) is well known in Combinatorial Analysis, Computer Science, and Information Theory. There are widely used methods for ranking permutations of numbers {1, 2, ..., n}, n ≥ 1, for ranking binary words of length n with a fixed number of ones and for many other combinatorial problems. Many of these methods have nonexponential memory size and the time of enu...

Lagrangian reduction by stages is used to derive the Euler-Poincaré equations for the nondissipative coupled motion and micromotion of complex fluids. We mainly treat perfect complex fluids (PCFs) whose order parameters are continuous material variables. These order parameters may be regarded geometrically either as objects in a vector space, or as coset spaces of Lie symmetry groups with respe...

whether or not there is a verbal passive construction in persian has been ‎highly controversial. traditional grammarians and most linguists have ‎argued that there is a structural passive construction in persian, similar to ‎that observed in english. within the framework of the minimalist ‎program, but more in the spirit of emonds’s (2006) division of analytic ‎passives into verbal and adjectiv...