Related papers: Formal series and numerical integrators: some hist…
The algebra Mul[[B]] of formal multilinear function series over an algebra B and its quotient SymMul[[B]] are introduced, as well as corresponding operations of formal composition. In the setting of Mul[[B]], the unsymmetrized R- and…
In this paper we study the number $r_{bwt}$ of equal-letter runs produced by the Burrows-Wheeler transform ($BWT$) when it is applied to purely morphic finite words, which are words generated by iterating prolongable morphisms. Such a…
Time series classification is an application of particular interest with the increase of data to monitor. Classical techniques for time series classification rely on point-to-point distances. Recently, Bag-of-Words approaches have been used…
This paper is devoted to the computation of the number of ordered factorizations of a long cycle in the symmetric group where the number of factors is arbitrary and the cycle structure of the factors is given. Jackson (1988) derived the…
A new class of rational parametrization has been developed and it was used to generate a new family of rational functions B-splines $\displaystyle{{\left({}^{\alpha}{\mathbf B}_{i}^{k} \right)}_{i=0}^{k}}$ which depends on an index $\alpha…
Cartesian tree matching is a form of generalized pattern matching where a substring of the text matches with the pattern if they share the same Cartesian tree. This form of matching finds application for time series of stock prices and can…
We define generalized de Bruijn words as those words having a Burrows-Wheeler transform that is a concatenation of permutations of the alphabet. We show that generalized de Bruijn words are in 1-to-1 correspondence with Hamiltonian cycles…
We introduce a systematic framework for counting and finding independent operators in effective field theories, taking into account the redundancies associated with use of the classical equations of motion and integration by parts. By…
We introduce a rigorous arithmetic--spectral construction associating planar geometric objects with additive prime factor statistics. Let $\mathrm{sopfr}(n)$ denote the sum of prime factors of $n$, counted with multiplicity, and define the…
The complex numbers are an important part of quantum theory, but are difficult to motivate from a theoretical perspective. We describe a simple formal framework for theories of physics, and show that if a theory of physics presented in this…
Circuit representations are becoming the lingua franca to express and reason about tractable generative and discriminative models. In this paper, we show how complex inference scenarios for these models that commonly arise in machine…
For a Riemann integrable function on an interval and for a point therein,we define 'Fourier series at the point on the interval' and bring out how and when the function element becomes expressible as Fourier series.In this process,we also…
In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…
Many algorithms in numerical analysis are affine equivariant: they are immune to changes of affine coordinates. This is because those algorithms are defined using affine invariant constructions. There is, however, a crucial ingredient…
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…
We use the classical interpretation of the braid group $B_3$ as a central extension of the modular group $\text{PSL}_2\left(\mathbb{Z}\right)$ to establish new and fundamental properties of $B_3$ using the theory of continued fractions. In…
Motivated by challenges in pangenomic read alignment, we propose a generalization of Wheeler graphs that we call Wheeler maps. A Wheeler map stores a text $T[1..n]$ and an assignment of tags to the characters of $T$ such that we can…
Given a string of characters, the Burrows-Wheeler Transform rearranges the characters in it so as to produce another string of the same length which is more amenable to compression techniques such as move to front, run-length encoding, and…
We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…
Using generalized hypergeometric functions to perform symbolic manipulation of equations is of great importance to pure and applied scientists. There are in the literature a great number of identities for the Meijer-G function. On the other…