Related papers: Substring compatibility of permutation statistics

The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation…

Motivated by Kitaev and Zhang's recent work on non-overlapping ascents in stack-sortable permutations and Dumont's permutation interpretation of the Jacobi elliptic functions, we investigate some parity statistics on restricted…

Analogue to commutants in the theory of associative algebras, one can construct a new subalgebra of vertex algebra known as a vertex algebra commutant. In this paper, for the adjoint representation $V$ of Lie algebra $sl(2,\C)$, we describe…

We introduce a new $P$ basis for the Hopf algebra of quasisymmetric functions that refine the symmetric powersum basis. Unlike the quasisymmetric power sums of types 1 and 2, our basis is defined combinatorially: its expansion in…

We introduce a framework for $\mathbb{Z}$-gradings on cluster algebras (and their quantum analogues) that are compatible with mutation. To do this, one chooses the degrees of the (quantum) cluster variables in an initial seed subject to a…

We extend recent remarkable progress in the comparison of the dynamical energy spectrum of rotating closed strings in AdS_5xS^5 and the scaling weights of the corresponding non-near-BPS operators in planar N=4 supersymmetric gauge theory.…

We introduce a new function on the set of pairs of cluster variables via $f$-vectors, which we call it the compatibility degree (of cluster complexes). The compatibility degree is a natural generalization of the classical compatibility…

Let ${\mathcal S}(\mathfrak g)$ be the symmetric algebra of a reductive Lie algebra $\mathfrak g$ equipped with the standard Poisson structure. If ${\mathcal C}\subset\mathcal S(\mathfrak g)$ is a Poisson-commutative subalgebra, then ${\rm…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

A permutation class $C$ is splittable if it is contained in a merge of two of its proper subclasses, and it is 1-amalgamable if given two permutations $\sigma$ and $\tau$ in $C$, each with a marked element, we can find a permutation $\pi$…

I discuss motivations for introducing Hopf algebra symmetries in noncommutative field theories and briefly describe twisting of main symmetry transformations. New results include an extended list of twisted gauge invariants (which may help…

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

We study relationships between permutation statistics and pattern-functions, counting the number of times particular patterns occur in a permutation. This allows us to write several familiar statistics as linear combinations of pattern…

This paper considers the problem of subspace clustering under noise. Specifically, we study the behavior of Sparse Subspace Clustering (SSC) when either adversarial or random noise is added to the unlabelled input data points, which are…

We construct a non-commutative, non-cocommutative, graded bialgebra $\mathbf{\Pi}$ with a basis indexed by the permutations in all finite symmetric groups. Unlike the formally similar Malvenuto-Poirier-Reutenauer Hopf algebra, this…

The zx-calculus and related theories are based on so-called interacting Frobenius algebras, where a pair of dagger-special commutative Frobenius algebras jointly form a pair of Hopf algebras. In this setting we introduce a generalisation of…

We study the query complexity of exactly reconstructing a string from adaptive queries, such as substring, subsequence, and jumbled-index queries. Such problems have applications, e.g., in computational biology. We provide a number of new…

There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…

Visontai conjectured in 2013 that the joint distribution of ascent and distinct nonzero value numbers on the set of subexcedant sequences is the same as that of descent and inverse descent numbers on the set of permutations. This conjecture…

If a tuple of matrices has a common invariant subspace, its projective joint spectrum has an algebraic component. In general, the converse is not true, and there might be algebraic components in the projective joint spectrum without…