Related papers: Decomposable shuffles

We focus in this text on the adaptation to the study of shuffles of the main combinatorial tool in the theory of free Lie algebras, namely the existence of a universal algebra of endomorphisms for tensor and other cocommutative Hopf…

We define and investigate a family of permutations matrices, called shuffling matrices, acting on a set of $N=n_1\cdots n_m$ elements, where $m\geq 2$ and $n_i\geq 2$ for any $i=1,\ldots, m$. These elements are identified with the vertices…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

In order to extend the Sch\"utzenberger's factorization to general perturbations, the combinatorial aspects of the Hopf algebra of the $\phi$-deformed stuffle product is developed systematically in a parallel way with those of the shuffle…

Choreographies describe possible sequences of interactions among a set of agents. We aim to join two lines of research on choreographies: the use of the shuffle on trajectories operator to design more expressive choreographic languages, and…

We carry on the investigation initiated in [15] : we describe new shuffle products coming from some special functions and group them, along with other products encountered in the literature, in a class of products, which we name…

The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software construction, hardware design, and more. We propose a simple…

We relate shuffle algebras, as defined by Nichols, Feigin-Odesskii and Rosso, to perverse sheaves on symmetric products of the complex line (i.e., on the spaces of monic polynomials stratified by multiplicities of roots). More precisely, we…

We introduce and analyze the $S_k$ shuffle on $N$ cards, a natural generalization of the celebrated random adjacent transposition shuffle. In the $S_k$ shuffle, we choose uniformly at random a block of $k$ consecutive cards, and shuffle…

We define iteration of functions that map n-dimensional vector spaces into m-dimensional vector spaces (m at most equal to n). It happens that usual iteration and Fibonacci iterative methods become special cases of this generalized…

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

We give a simple iterative procedure to compute the classical conformal blocks on the sphere to all order in the modulus.

We classify one-element extensions of a hyperplane arrangement by the induced adjoint arrangement. Based on the classification, several kinds of combinatorial invariants including Whitney polynomials, characteristic polynomials, Whitney…

Given partial information about a set, we are interested in fully recovering the original set from what is given. If a set encodes itself robustly, any partial information about the set suffices to fully recover the information about the…

Let $\mathcal{A}$ be an affine hyperplane arrangement, $L(\mathcal{A})$ its intersection poset, and $\chi_{\mathcal{A}}(t)$ its characteristic polynomial. This paper aims to propose combinatorial structures for the factorization of…

A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…

Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based sorting algorithms and leads to many links with permutation patterns. We present…

We introduce a class of orbits which may have $0$ Lyapunov exponents, but still demonstrate some sensitivity to initial conditions. We construct a countable Markov partition with a finite-to-one almost everywhere induced coding, and which…

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

Juggling patterns can be described by a sequence of cards which keep track of the relative order of the balls at each step. This interpretation has many algebraic and combinatorial properties, with connections to Stirling numbers, Dyck…