Related papers: Cyclic shuffle-compatibility via cyclic shuffle al…

A permutation is so-called two stack sortable if it (i) avoids the (scattered) pattern 2-3-4-1, and (ii) contains a 3-2-4-1 pattern only as part of a 3-5-2-4-1 pattern. Here we show that the permutations on [n] satisfying condition (ii)…

Let $\pi$ be a cyclic permutation that can be expressed in its one-line form as $\pi = \pi_1\pi_2 \cdot\cdot\cdot \pi_n$ and in its standard cycle form as $\pi = (c_1,c_2, ..., c_n)$ where $c_1=1$. Archer et al. introduced the notion of…

Many features of classical Lie theory generalize to the broader context of algebras over Hopf operads. However, this idea remains largely to be developed systematically. Quasi-shuffle algebras provide for example an interesting illustration…

An instance $I$ of the Stable Matching Problem (SMP) is given by a bipartite graph with a preference list of neighbors for every vertex. A swap in $I$ is the exchange of two consecutive vertices in a preference list. A swap can be viewed as…

Probabilities of crossing on same-spin clusters, seen as order parameters, have been introduced recently for the critical 2d Ising model by Langlands, Lewis and Saint-Aubin. We extend Cardy's ideas, introduced for percolation, to obtain an…

Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…

We consider the expansion of the square of a complete homogeneous function $h_\lambda$, or of an elementary symmetric function $e_\lambda$, in the basis of Schur functions. This square also decomposes into two plethysms, $s_2[h_\lambda]$…

In this paper, we comment on the recent comparison in Azzalini et al. (2014) of two different distributions proposed in the literature for the modelling of data that have asymmetric and possibly long-tailed clusters. They are referred to as…

We show that the poset of shuffles introduced by Greene in 1988 is flag-symmetric, and we describe a "local" permutation action of the symmetric group on the maximal chains which is closely related to the flag symmetric function of the…

We prove shuffle relations which relate a product of regularised integrals of classical symbols to regularised nested (Chen) iterated integrals, which hold if all the symbols involved have non-vanishing residue. This is true in particular…

We study the relation between the cluster automorphisms and the quasi-automorphisms of a cluster algebra $\mathcal{A}$. We proof that under some mild condition, satisfied for example by every skew-symmetric cluster algebra, the…

We introduce quasi-homomorphisms of cluster algebras, a flexible notion of a map between cluster algebras of the same type (but with different coefficients). The definition is given in terms of seed orbits, the smallest equivalence classes…

Using a characterization of Mutual Complete Dependence copulas, we show that, with respect to the Sobolev norm, the MCD copulas can be approximated arbitrarily closed by shuffles of Min. This result is then used to obtain a characterization…

The block number of a permutation is the maximal number of components in its expression as a direct sum. We show that, for $321$-avoiding permutations, the set of left-to-right maxima has the same distribution when the block number is…

A homogeneous quasimorphism $\phi$ on a normal subgroup $N$ of $G$ is said to be $G$-invariant if $\phi(gxg^{-1}) = \phi(x)$ for every $g \in G$ and for every $x \in N$. Invariant quasimorphisms have naturally appeared in symplectic…

Variational inequalities have gained significant attention in machine learning and optimization research. While stochastic methods for solving these problems typically assume independent data sampling, we investigate an alternative approach…

Distance correlation has gained much recent attention in the data science community: the sample statistic is straightforward to compute and asymptotically equals zero if and only if independence, making it an ideal choice to discover any…

Contrary to previous approaches bringing together algebraic geometry and signatures of paths, we introduce a Zariski topology on the space of paths itself, and study path varieties consisting of all paths whose iterated-integrals signature…

Let pi = pi_1 pi_2 ... pi_n be a permutation in the symmetric group S_n written in one-line notation. The pinnacle set of pi, denoted Pin pi, is the set of all pi_i such that pi_{i-1} < pi_i > pi_{i+1}. This is an analogue of the…

The celebrated theorem of Chung, Graham, and Wilson on quasirandom graphs implies that if the 4-cycle and edge counts in a graph $G$ are both close to their typical number in $\mathbb{G}(n,1/2),$ then this also holds for the counts of…