Related papers: Substring compatibility of permutation statistics

In this article we consider the graph alignment problem from the perspective of high-dimensional statistics: we aim to estimate an unknown permutation $\pi^*$ from the observation of two correlated random adjacency matrices $A_1$, $A_2$. We…

We consider a q-analogue of the standard bilinear form on the commutative ring of symmetric functions. The q=-1 case leads to a Z-graded Hopf superalgebra which we call the algebra of odd symmetric functions. In the odd setting we describe…

We investigate the interplay between algebraic and categorical notions of non-invertible symmetries. In particular, a fusion categorical symmetry $\mathcal{C}$ is shown to induce an algebraic symmetry encoded in a weak Hopf algebra $H$…

Ensuring that analyses performed on a dataset are representative of the entire population is one of the central problems in statistics. Most classical techniques assume that the dataset is independent of the analyst's query and break down…

We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several common permutation statistics, including the number of…

This is a set of working notes which give a second proof of the Shareshian--Wachs conjecture, the first (and recent) proof being by Brosnan and Chow in November 2015. The conjecture relates some symmetric functions constructed…

A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show…

We call an operator algebra A {\em reversible} if A with reversed multiplication is also an abstract operator algebra (in the modern operator space sense). This class of operator algebras is intimately related to the {\em symmetric operator…

Savage and Sagan have recently defined a notion of st-Wilf equivalence for any permutation statistic st and any two sets of permutations $\Pi$ and $\Pi'$. In this paper we give a thorough investigation of st-Wilf equivalence for the charge…

In 2000 Babson and Steingr{\'\i}msson introduced the notion of vincular patterns in permutations. They shown that essentially all well-known Mahonian permutation statistics can be written as combinations of such patterns. Also, they proved…

We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation sigma = sigma_1sigma_2...sigma_n defined as the set of indices…

This paper addresses the statistical significance of structures in random data: Given a set of vectors and a measure of mutual similarity, how likely does a subset of these vectors form a cluster with enhanced similarity among its elements?…

We show that a variety $\mathcal V$ is congruence distributive if and only if there is some $h$ such that the inclusion (1) $\Theta \cap ( \sigma \circ \sigma ) \subseteq ( \Theta \cap \sigma ) \circ ( \Theta \cap \sigma ) \circ \dots $…

The abelian pattern matching problem consists in finding all substrings of a text which are permutations of a given pattern. This problem finds application in many areas and can be solved in linear time by a naive sliding window approach.…

In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…

In 2020, Bloom and Sagan defined subsets of the symmetric group $\mathfrak{S}_n$ called partial shuffles, and proved a formula for the Schur expansion of the pattern quasisymmetric function associated with a partial shuffle. In their proof,…

The goal of our work is to study the spaces of primitive elements of the Hopf algebras associated to the permutaedra and the associaedra. We introduce the notion of shuffle and preshuffle bialgebras, and compute the subpaces of primitive…

In this paper we classify triangular semisimple and cosemisimple Hopf algebras over any algebraically closed field k. Namely, we construct, for each positive integer N, relatively prime to the characteristic of k if it is positive, a…

We show that the set $SCL^{rp}$ of stable commutator lengths on recursively presented groups equals the set of non-negative right-computable numbers. Hence all non-negative algebraic or computable numbers are in $SCL^{rp}$ and $SCL^{rp}$ is…

The permutation pattern Hopf algebra is a commutative filtered and connected Hopf algebra. Its product structure stems from counting patterns of a permutation, interpreting the coefficients as permutation quasi-shuffles. The Hopf algebra…