Add to ORKGWe 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 self-contained
C. Greene (J. Combin. Theory Ser. A 47 (1988), 126-131) studied a family of lattices denoted m,n. In...
Abstract. The Classical Shuffle Conjecture of Haglund et al. (2005) has a symmetric function side an...
Summary. We present an overview of different approaches to define shuffles and synchro-nized shuffle...
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural...
AbstractC. Greene (J. Combin. Theory Ser. A 47 (1988), 126–131) studied a family of lattices denoted...
In this paper we survey some recent researches concerning the shuffle operation that arise both in F...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
AbstractWe consider the shuffle operation on paths and study some parameters. In the case of square ...
Shuffle operads were introduced to make explicit the actions of symmetric groups on symmetric operad...
In this paper, we study the shuffle operator on concurrent processes (represented as trees) using an...
AbstractWe give a new bijective proof of Stanley's Shuffling Theorem using a more elementary approac...
The crux of a card trick performed with a deck of cards usually depends on understanding how shuffle...
In this paper we study random orderings of the integers with a certain invariance property. We descr...
By assigning a distinct positive integer to each join-irreducible of a lattice, with each element of...
AbstractWe study posets defined by Stanley as a multiset generalization of Greene's posets of shuffl...
C. Greene (J. Combin. Theory Ser. A 47 (1988), 126-131) studied a family of lattices denoted m,n. In...
Abstract. The Classical Shuffle Conjecture of Haglund et al. (2005) has a symmetric function side an...
Summary. We present an overview of different approaches to define shuffles and synchro-nized shuffle...
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural...
AbstractC. Greene (J. Combin. Theory Ser. A 47 (1988), 126–131) studied a family of lattices denoted...
In this paper we survey some recent researches concerning the shuffle operation that arise both in F...
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 20...
AbstractWe consider the shuffle operation on paths and study some parameters. In the case of square ...
Shuffle operads were introduced to make explicit the actions of symmetric groups on symmetric operad...
In this paper, we study the shuffle operator on concurrent processes (represented as trees) using an...
AbstractWe give a new bijective proof of Stanley's Shuffling Theorem using a more elementary approac...
The crux of a card trick performed with a deck of cards usually depends on understanding how shuffle...
In this paper we study random orderings of the integers with a certain invariance property. We descr...
By assigning a distinct positive integer to each join-irreducible of a lattice, with each element of...
AbstractWe study posets defined by Stanley as a multiset generalization of Greene's posets of shuffl...
C. Greene (J. Combin. Theory Ser. A 47 (1988), 126-131) studied a family of lattices denoted m,n. In...
Abstract. The Classical Shuffle Conjecture of Haglund et al. (2005) has a symmetric function side an...
Summary. We present an overview of different approaches to define shuffles and synchro-nized shuffle...