You will find here some raw research code and a demo related to the following series of papers: [1] C. Ceballos and V. Pons. The s-weak order and s-permutahedra I: Combinatorics and Lattice Structure [2] C. Ceballos and V. Pons. The s-weak order and s-permutahedra . In 31st International Conference on "Formal Power Series and Algebraic Combinatorics" (FPSAC 2019), volume 82B, Art. 76. Hanover, United States, 2019. Séminaire Lotharingien de Combinatoire. They present examples and implementations of the computations and algorithms described in the papers
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
There has been considerable interest recently in the subject of patterns in permutations and words, ...
This is the first contribution of a sequence of papers introducing the notions of $s$-weak order and...
International audienceWe introduce the s-weak order on decreasing trees, a lattice which generalizes...
International audienceWe introduce the s-weak order on decreasing trees, a lattice which generalizes...
International audienceWe introduce the s-weak order on decreasing trees, a lattice which generalizes...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
International audienceNoncrossing arc diagrams provide a powerful combinatorial model for the equiva...
AbstractWe define a partial order on the set of faces of the permutohedron, which extends the weak B...
International audienceNoncrossing arc diagrams provide a powerful combinatorial model for the equiva...
Cette thèse se situe dans le domaine de la combinatoire algébrique et porte sur l'étude et les appli...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
There has been considerable interest recently in the subject of patterns in permutations and words, ...
This is the first contribution of a sequence of papers introducing the notions of $s$-weak order and...
International audienceWe introduce the s-weak order on decreasing trees, a lattice which generalizes...
International audienceWe introduce the s-weak order on decreasing trees, a lattice which generalizes...
International audienceWe introduce the s-weak order on decreasing trees, a lattice which generalizes...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
In algebraic combinatorics, lattices are partially ordered sets which possess both meet and join ope...
International audienceNoncrossing arc diagrams provide a powerful combinatorial model for the equiva...
AbstractWe define a partial order on the set of faces of the permutohedron, which extends the weak B...
International audienceNoncrossing arc diagrams provide a powerful combinatorial model for the equiva...
Cette thèse se situe dans le domaine de la combinatoire algébrique et porte sur l'étude et les appli...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
There has been considerable interest recently in the subject of patterns in permutations and words, ...