Related papers: Substring compatibility of permutation statistics

Snakes are analogues of alternating permutations defined for any Coxeter group. We study these objects from the point of view of combinatorial Hopf algebras, such as noncommutative symmetric functions and their generalizations. The main…

We consider the problem of clustering a set of high-dimensional data points into sets of low-dimensional linear subspaces. The number of subspaces, their dimensions, and their orientations are unknown. We propose a simple and low-complexity…

A half-commutative orthogonal Hopf algebra is a Hopf *-algebra generated by the self-adjoint coefficients of an orthogonal matrix corepresentation $v=(v_{ij})$ that half commute in the sense that $abc=cba$ for any $a,b,c \in \{v_{ij}\}$.…

The variety of skew braces contains several interesting subcategories as subvarieties, as for instance the varieties of radical rings, of groups and of abelian groups. In this article the methods of non-abelian homological algebra are…

In a series of recent talks Richard Stanley introduced a symmetric function associated to digraphs called the Redei-Berge symmetric function. This symmetric function enumerates descent sets of permutations corresponding to digraphs. We show…

We introduce a natural Hopf algebra structure on the space of noncommutative symmetric functions which was recently studied as a vector space by Rosas and Sagan. The bases for this algebra are indexed by set partitions. We show that there…

Let a Lie algebra $\mathfrak q$ be a linear sum of two complementary subalgebras $\mathfrak h$ and $\mathfrak r$. We continue our investigations initiated in (J. London Math. Soc. 103 (2021), 1577-1595), where compatible Poisson brackets…

We introduce proof terms for string rewrite systems and, using these, show that various notions of equivalence on reductions known from the literature can be viewed as different perspectives on the notion of causal equivalence. In…

We investigate topological mixing of compatible random substitutions. For primitive random substitutions on two letters whose second eigenvalue is greater than one in modulus, we identify a simple, computable criterion which is equivalent…

Hierarchical clustering is a popular method for analyzing data which associates a tree to a dataset. Hartigan consistency has been used extensively as a framework to analyze such clustering algorithms from a statistical point of view.…

In this paper, we give several necessary conditions for non-cosemisimple coalgebras being admissible. The implications simplify the classification problems for Hopf algebras of dimension 45, 105 and a few others.

We propose an algebraic study of the simple graph isomorphism problem. We define a Hopf algebra from an explicit realization of its elements as formal power series. We show that these series can be evaluated on graphs and count occurrences…

Deciding whether there is a single tree -a supertree- that summarizes the evolutionary information in a collection of unrooted trees is a fundamental problem in phylogenetics. We consider two versions of this question: agreement and…

S. Montgomery and S. Witherspoon proved that upper and lower semisolvable, semisimple, finite dimensional Hopf algebras are of Froebenius type when their dimensions are not divisible by the characteristic of the base field. In this note we…

Scales, sets of discrete pitches that form the basis of melodies, are thought to be one of the most universal hallmarks of music. But we know relatively little about cross-cultural diversity of scales or how they evolved. To remedy this, we…

Spectral clustering refers to a family of unsupervised learning algorithms that compute a spectral embedding of the original data based on the eigenvectors of a similarity graph. This non-linear transformation of the data is both the key of…

I describe how superstring theory may violate spin-statistics in an experimentally observable manner. Reviewing the basics of superstring interactions and how to utilize these to produce a statistical phase, I then apply these ideas to two…

Stanley and Grinberg introduced the symmetric function associated to digraphs, called the Redei-Berge symmetric function. In [8] is shown that this symmetric function arises from a suitable structure of combinatorial Hopf algebra on…

In this note we expose some surprising connections between string theory and statistical inference. We consider a large collective of agents sweeping out a family of nearby statistical models for an M-dimensional manifold of statistical…

The problem of clustering noisy and incompletely observed high-dimensional data points into a union of low-dimensional subspaces and a set of outliers is considered. The number of subspaces, their dimensions, and their orientations are…