Related papers: Substring compatibility of permutation statistics
Multiples zeta values (MZV's for short) in positive characteristic were introduced by Thakur as analogues of classical multiple zeta values of Euler. In this paper we give a systematic study of algebraic structures of MZV's in positive…
Binary jumbled pattern matching asks to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of length $i$ and has exactly $j$ 1-bits. This problem naturally generalizes to…
Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a leaf of the tree, i.e. below a previously placed number.…
We investigate the Hopf algebra structure in string worldsheet theory and give a unified formulation of the quantization of string and the space-time symmetry. We reformulate the path integral quantization of string as a Drinfeld twist at…
In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…
This paper is concerned with two generalizations of the Hopf algebra of symmetric functions that have more or less recently appeared. The Hopf algebra of noncommutative symmetric functions and its dual, the Hopf algebra of quasisymmetric…
We identify a subclass of the regular commutative languages that is closed under the iterated shuffle, or shuffle closure. In particular, it is regularity-preserving on this subclass. This subclass contains the commutative group languages…
We construct new superstring actions which are distinguished from standard superstrings by being space-time scale invariant. Like standard superstrings, they are also reparametrization invariant, space-time supersymmetric, and invariant…
We study hierarchical clusterings of metric spaces that change over time. This is a natural geometric primitive for the analysis of dynamic data sets. Specifically, we introduce and study the problem of finding a temporally coherent…
This paper studies the \emph{subset sampling} problem. The input is a set $\mathcal{S}$ of $n$ records together with a function $\textbf{p}$ that assigns each record $v\in\mathcal{S}$ a probability $\textbf{p}(v)$. A query returns a random…
Many important statistics of signed permutations are realized in the corresponding permutation tableaux or bare tableaux of type $B$: Alignments, crossings and inversions of signed permutations are realized in the corresponding permutation…
The adjunction between coalgebras and Hopf algebras, first described by Takeuchi, allows one to prove that the semi-abelian category of cocommutative Hopf algebras has enough $\mathcal E$-projective objects with respect to the class…
A criterion for subcoalgebras to be invariant under the adjoint action is given generalizing Masuoka's criterion for normal Hopf subalgebras. At the level of characters, the image of the induction functor from a normal Hopf subalgebra is…
Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$. Our central example is a two-parameter family of random permutations that are…
We consider the question of computing the distribution of a permutation statistics over restricted permutations via enumeration schemes. The restricted permutations are those avoiding sets of vincular patterns (which include both classical…
Clustering data objects into homogeneous groups is one of the most important tasks in data mining. Spectral clustering is arguably one of the most important algorithms for clustering, as it is appealing for its theoretical soundness and is…
Permutation tests are a distribution free way of performing hypothesis tests. These tests rely on the condition that the observed data are exchangeable among the groups being tested under the null hypothesis. This assumption is easily…
This is a survey on spherical Hopf algebras. We give criteria to decide when a Hopf algebra is spherical and collect examples. We discuss tilting modules as a mean to obtain a fusion subcategory of the non-degenerate quotient of the…
Discrete statistical models supported on labelled event trees can be specified using so-called interpolating polynomials which are generalizations of generating functions. These admit a nested representation. A new algorithm exploits the…
A switching method is a graph operation that results in cospectral graphs (graphs with the same spectrum). Work by Wang and Xu [Discrete Math. 310 (2010)] suggests that most cospectral graphs with cospectral complements can be constructed…