AbstractWe consider the shuffle operation on paths and study some parameters. In the case of square lattices, shuffling with a particular periodic word (of period 2) corresponding to paperfoldings reveals some characteristic properties: closed paths remain closed; the area and perimeter double; the center of gravity moves under a 45∘ rotation and a 2 zoom factor. We also observe invariance properties for the associated Dragon curves. Moreover, replacing square lattice paths by paths involving 2kπ/N-turns, we find analogous results using more general shuffles
International audienceA permutation is said to be a square if it can be obtained by shuffling two or...
Summary. We present an overview of different approaches to define shuffles and synchro-nized shuffle...
International audienceWe analyze some enumerative and asymptotic properties of Dyck paths under a li...
AbstractWe consider the shuffle operation on paths and study some parameters. In the case of square ...
The shuffle operation on strings is a fundamental operation, well studied in the theory of formal la...
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natura...
C. Greene (J. Combin. Theory Ser. A 47 (1988), 126-131) studied a family of lattices denoted m,n. In...
AbstractType A affine shuffles are compared with riffle shuffles followed by a cut. Although these p...
AbstractWe count the number of lattice paths lying under a cyclically shifting piecewise linear boun...
In this paper, we extend the rectangular side of the shuffle conjecture by stating a rectangular ana...
AbstractThere are two ways to perfectly shuffle a deck of 2n cards. Both methods cut the deck in hal...
We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of ...
There are many ways to shuffle a card deck, but one particularly interesting way is what’s known as ...
By assigning a distinct positive integer to each join-irreducible of a lattice, with each element of...
An intention of MapReduce Sets for Shuffling expressions analysis has to suggest criteria how Shuffl...
International audienceA permutation is said to be a square if it can be obtained by shuffling two or...
Summary. We present an overview of different approaches to define shuffles and synchro-nized shuffle...
International audienceWe analyze some enumerative and asymptotic properties of Dyck paths under a li...
AbstractWe consider the shuffle operation on paths and study some parameters. In the case of square ...
The shuffle operation on strings is a fundamental operation, well studied in the theory of formal la...
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natura...
C. Greene (J. Combin. Theory Ser. A 47 (1988), 126-131) studied a family of lattices denoted m,n. In...
AbstractType A affine shuffles are compared with riffle shuffles followed by a cut. Although these p...
AbstractWe count the number of lattice paths lying under a cyclically shifting piecewise linear boun...
In this paper, we extend the rectangular side of the shuffle conjecture by stating a rectangular ana...
AbstractThere are two ways to perfectly shuffle a deck of 2n cards. Both methods cut the deck in hal...
We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of ...
There are many ways to shuffle a card deck, but one particularly interesting way is what’s known as ...
By assigning a distinct positive integer to each join-irreducible of a lattice, with each element of...
An intention of MapReduce Sets for Shuffling expressions analysis has to suggest criteria how Shuffl...
International audienceA permutation is said to be a square if it can be obtained by shuffling two or...
Summary. We present an overview of different approaches to define shuffles and synchro-nized shuffle...
International audienceWe analyze some enumerative and asymptotic properties of Dyck paths under a li...