We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize shuffles in terms of open sets in a topological space associated to a pair of trees. Our notion of shuffle is motivated by the theory of operads and occurs in the theory of dendroidal sets, but our presentation is independent and entirely selfcontained
. The p-shuffle is a natural generalization of the dovetail shuffle that is defined as follows. Firs...
AbstractThere are two ways to perfectly shuffle a deck of 2n cards. Both methods cut the deck in hal...
By assigning a distinct positive integer to each join-irreducible of a lattice, with each element of...
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural...
C. Greene (J. Combin. Theory Ser. A 47 (1988), 126-131) studied a family of lattices denoted m,n. In...
In this paper we survey some recent researches concerning the shuffle operation that arise both in F...
Summary. We present an overview of different approaches to define shuffles and synchro-nized shuffle...
The shuffle operation on strings is a fundamental operation, well studied in the theory of formal la...
AbstractC. Greene (J. Combin. Theory Ser. A 47 (1988), 126–131) studied a family of lattices denoted...
The crux of a card trick performed with a deck of cards usually depends on understanding how shuffle...
International audienceIn this paper, we study the shuffle operator on concurrent processes (represen...
AbstractWe consider the shuffle operation on paths and study some parameters. In the case of square ...
AbstractType A affine shuffles are compared with riffle shuffles followed by a cut. Although these p...
AbstractWe study posets defined by Stanley as a multiset generalization of Greene's posets of shuffl...
An intention of MapReduce Sets for Shuffling expressions analysis has to suggest criteria how Shuffl...
. The p-shuffle is a natural generalization of the dovetail shuffle that is defined as follows. Firs...
AbstractThere are two ways to perfectly shuffle a deck of 2n cards. Both methods cut the deck in hal...
By assigning a distinct positive integer to each join-irreducible of a lattice, with each element of...
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural...
C. Greene (J. Combin. Theory Ser. A 47 (1988), 126-131) studied a family of lattices denoted m,n. In...
In this paper we survey some recent researches concerning the shuffle operation that arise both in F...
Summary. We present an overview of different approaches to define shuffles and synchro-nized shuffle...
The shuffle operation on strings is a fundamental operation, well studied in the theory of formal la...
AbstractC. Greene (J. Combin. Theory Ser. A 47 (1988), 126–131) studied a family of lattices denoted...
The crux of a card trick performed with a deck of cards usually depends on understanding how shuffle...
International audienceIn this paper, we study the shuffle operator on concurrent processes (represen...
AbstractWe consider the shuffle operation on paths and study some parameters. In the case of square ...
AbstractType A affine shuffles are compared with riffle shuffles followed by a cut. Although these p...
AbstractWe study posets defined by Stanley as a multiset generalization of Greene's posets of shuffl...
An intention of MapReduce Sets for Shuffling expressions analysis has to suggest criteria how Shuffl...
. The p-shuffle is a natural generalization of the dovetail shuffle that is defined as follows. Firs...
AbstractThere are two ways to perfectly shuffle a deck of 2n cards. Both methods cut the deck in hal...
By assigning a distinct positive integer to each join-irreducible of a lattice, with each element of...
DOI
Add to ORKG