Related papers: A note on the Burrows-Wheeler transformation
We prove several combinatorial properties of suffix arrays, including a characterization of suffix arrays through a bijection with a certain well-defined class of permutations. Our approach is based on the characterization of…
In this study we revisit the telephone exchange problem. We discuss a generalization of the telephone exchange problem by discuss two generalizations of the Bessel polynomials. We study combinatorial properties of these polynomials, and…
In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…
The Heisenberg-Weyl algebra, which underlies virtually all physical representations of Quantum Theory, is considered from the combinatorial point of view. We provide a concrete model of the algebra in terms of paths on a lattice with some…
We use the octahedron recurrence to give a simplified statement and proof of a formula for iterated birational rowmotion on a product of two chains, first described by Musiker and Roby. Using this, we show that weights of certain chains in…
A number of new definite integrals involving Bessel functions are presented. These have been derived by finding new integral representations for the product of two Bessel functions of different order and argument in terms of the generalized…
An index transform, involving the square of Whittaker's function is introduced and investigated. The corresponding inversion formula is established. Particular cases cover index transforms of the Lebedev type with products of the modified…
We introduce a topological approach to words. Words are approximated by Gauss words and then studied up to natural modifications inspired by homotopy transformations of curves on the plane.
We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.
We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie…
We introduce the combinatorial notion of posetted trees and we use it in order to write an explicit expression of the Baker-Campbell-Hausdorff formula.
We characterize the clustering of a word under the Burrows-Wheeler transform in terms of the resolution of a bounded number of bispecial factors belonging to the language generated by all its powers. We use this criterion to compute, in…
The Burrows-Wheeler Transform (BWT) is an efficient invertible text transformation algorithm with the properties of tending to group identical characters together in a run, and enabling search of the text. This transformation has extensive…
Automata-logic connections are pillars of the theory of regular languages. Such connections are harder to obtain for transducers, but important results have been obtained recently for word-to-word transformations, showing that the three…
We prove an analogue of Beurling's theorem on the H-type groups of certain dimensions after establishing the Gutzmer's formula for the H-type groups. We also obtain some other versions of the theorem using the modified Radon transform.
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
We choose random points in the hyperbolic disc and claim that these points are already word representations. However, it is yet to be uncovered which point corresponds to which word of the human language of interest. This correspondence can…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
The Burrows-Wheeler Transform (BWT) is often taught in undergraduate courses on algorithmic bioinformatics, because it underlies the FM-index and thus important tools such as Bowtie and BWA. Its admirers consider the BWT a thing of beauty…
We realize that geometric polynomials and p-Bernoulli polynomials and numbers are closely related with an integral representation. Therefore, using geometric polynomials, we extend some properties of Bernoulli polynomials and numbers such…