相关论文: Substring compatibility of permutation statistics
Consistency is a key property of all statistical procedures analyzing randomly sampled data. Surprisingly, despite decades of work, little is known about consistency of most clustering algorithms. In this paper we investigate consistency of…
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…
The Goulden$\unicode{x2013}$Jackson cluster method, adapted to permutations by Elizalde and Noy, reduces the problem of counting permutations by occurrences of a prescribed consecutive pattern to that of counting clusters, which are special…
We investigate numerically the configurational statistics of strings. The algorithm models an ensemble of global $U(1)$ cosmic strings, or equivalently vortices in superfluid $^4$He. We use a new method which avoids the specification of…
By computing Frobenius-Schur indicators of modules of certain weak Hopf algebras, we give a formula for the number of involutions in symmetric groups, which are contained in a given coset with respect to a given Young subgroup.
We derive functional equations for distributions of six classical statistics (ascents, descents, left-to-right maxima, right-to-left maxima, left-to-right minima, and right-to-left minima) on separable and irreducible separable…
A consecutive pattern in a permutation $\pi$ is another permutation $\sigma$ determined by the relative order of a subsequence of contiguous entries of $\pi$. Traditional notions such as descents, runs and peaks can be viewed as particular…
Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network…
We extend the previously established zesting techniques from fusion categories to general tensor categories. In particular we consider the category of comodules over a Hopf algebra, providing a detailed translation of the categorical…
For any vertex algebra V and any subalgebra A of V, there is a new subalgebra of V known as the commutant of A in V. This construction was introduced by Frenkel-Zhu, and is a generalization of an earlier construction due to Kac-Peterson and…
While a broad range of techniques have been proposed to tackle distribution shift, the simple baseline of training on an $\textit{undersampled}$ balanced dataset often achieves close to state-of-the-art-accuracy across several popular…
We study the symmetric function and polynomial combinatorial invariants of Hopf algebras of permutations, posets and graphs. We investigate their properties and the relations among them. In particular, we show that the chromatic symmetric…
By extending some classical results known for groups and skew braces, we define and investigate central series of cocommutative Hopf braces. Both left and right central series are defined using a $\star$-product that measures the difference…
We study the category of graded Hopf algebras that are free noncommutative, cocommutative, graded and connected from the perspective of the sequences of dimensions of the graded pieces. We show that a Hopf algebra exists with a given…
Rational Hopf algebras (certain quasitriangular weak quasi-Hopf $^*$-algebras) are expected to describe the quantum symmetry of rational field theories. In this paper methods are developped which allow for a classification of all rational…
We show that any sequence of measurements on a permutationally-symmetric (pure or mixed) multi-qubit string leaves the unmeasured qubit substring also permutationally-symmetric. In addition, we show that the measurement probabilities for an…
In his work on P-partitions, Stembridge defined the algebra of peak functions Pi, which is both a subalgebra and a retraction of the algebra of quasi-symmetric functions. We show that Pi is closed under coproduct, and therefore a Hopf…
The quasi-shuffle product and mixable shuffle product are both generalizations of the shuffle product and have both been studied quite extensively recently. We relate these two generalizations and realize quasi-shuffle product algebras as…
We generalize the problem of reconstructing strings from their substring compositions first introduced by Acharya et al. in 2015 motivated by polymer-based advanced data storage systems utilizing mass spectrometry. Namely, we see strings as…
In this paper, we solve a classical counting problem for non-degenerate forms of symplectic and hermitian type defined on a vector space: given a subspace $\pi$, we find the number of non-singular subspaces that are trivially intersecting…