Related papers: From the Lyndon factorization to the Canonical Inv…
In an attempt to look for the root of nonstandard Lagrangians in the theories of the inverse variational problem we introduce a logarithmic Lagrangian (LL) in addition to the so-called reciprocal Lagrangian (RL) that exists in the…
Root subgroup factorization is a refinement of triangular (or LDU) factorization. For a complex reductive Lie group, and a choice of reduced factorization of the longest Weyl group element, the forward map from root subgroup coordinates to…
We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…
The block reversal of a word $w$, denoted by $\mathtt{BR}(w)$, is a generalization of the concept of the reversal of a word, obtained by concatenating the blocks of the word in the reverse order. We characterize non-binary and binary words…
Any infinite uniformly recurrent word ${\bf u}$ can be written as concatenation of a finite number of return words to a chosen prefix $w$ of ${\bf u}$. Ordering of the return words to $w$ in this concatenation is coded by derivated word…
We consider the problem of finding repetitive structures and inherent patterns in a given string $\s{s}$ of length $n$ over a finite totally ordered alphabet. A border $\s{u}$ of a string $\s{s}$ is both a prefix and a suffix of $\s{s}$…
The fractional calculus framework will be used to invert the potential energy function from the classical scattering angle, which will be related to Riemann-Liouville fractional integral. Numerical solution of this fractional order problem…
In the study of infinite words, various notions of balancedness provide quantitative measures for how regularly letters or factors occur, and they find applications in several areas of mathematics and theoretical computer science. In this…
An abstract framework of canonical inference is used to explore how different proof orderings induce different variants of saturation and completeness. Notions like completion, paramodulation, saturation, redundancy elimination, and…
In combinatorics of words, a concatenation of $k$ consecutive equal blocks is called a power of order $k$. In this paper we take a different point of view and define an anti-power of order $k$ as a concatenation of $k$ consecutive pairwise…
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 enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…
We derive the discrete version of the classical Helmholtz condition. Precisely, we state a theorem characterizing second order finite differences equations admitting a Lagrangian formulation. Moreover, in the affirmative case, we provide…
The relationship between the perturbation theory in light-front coordinates and Lorentz-covariant perturbation theory is investigated. A method for finding the difference between separate terms of the corresponding series without their…
Using a new technique involving integration it is possible to find the exact roots of simple functions. In this case, simple functions are defined as smooth functions having an inverse, and that inverse having an antiderivative. This…
In each variant of the lambda-calculus, factorization and normalization are two key-properties that show how results are computed. Instead of proving factorization/normalization for the call-by-name (CbN) and call-by-value (CbV) variants…
In 1991 H\'ebrard introduced a factorization of words that turned out to be a powerful tool for the investigation of a word's scattered factors (also known as (scattered) subwords or subsequences). Based on this, first Karandikar and…
We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…
Current temporal forgery localization (TFL) approaches typically rely on temporal boundary regression or continuous frame-level anomaly detection paradigms to derive candidate forgery proposals. However, they suffer not only from feature…
Kitaev, Liese, Remmel, and Sagan recently defined generalized factor order on words comprised of letters from a partially ordered set $(P, \leq_P)$ by setting $u \leq_P w$ if there is a subword $v$ of $w$ of the same length as $u$ such that…