Related papers: Extended Central Factorial Numbers and the Flicker…
We present an algorithm for factoring linear differential operators with coefficients in a finite separable extension of F p (x). Our methods rely on specific tools arising in positive characteristic: p-curvature, structure of simple…
We introduce Flashback, a reversible string decomposition that repeatedly peels the maximal leading and trailing character runs from a sentinel-wrapped input, recording each pair as one bilateral token. Decomposition and reconstruction both…
Let $\mathcal{H}$ and $\mathcal{H}_0$ be Hilbert spaces and $\{A_n\}_n$ be a sequence of bounded linear operators from $\mathcal{H}$ to $\mathcal{H}_0$. The study frames for Hilbert spaces initiated the study of operators of the form…
We review aspects of an important paper by Robert Strichartz concerning reverse iterated function systems (i.f.s.) and fractal blowups. We compare the invariant sets of reverse i.f.s. with those of more standard i.f.s. and with those of…
Continued fractions are linked to Stern's diatomic sequence 0,1,1,2,1,3,2,3,1,4,... (given by the recursion relation a_2n=a_n and a_{2n+1} = a_n + a_{n+1}, where a_0=0 and a_1=1), which has long been known. Using a particular…
We introduce and study a three-folded linear operator depending on three parameters that has associated a triangular number tilling of the plane. As a result the set of all triples of integers is decomposed in classes of equivalence…
Based on the author's previous work on the Jacobi identity for twisted relative vertex operator algebras and modules and on the generating function identities for affine Lie algebras, we interpret the second difference sequence of the…
An Engel series is a sum of reciprocals of a non-decreasing sequence $(x_n)$ of positive integers, which is such that each term is divisible by the previous one, and a Pierce series is an alternating sum of the reciprocals of a sequence…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
We define and study multivariate exponential functions, symmetric with respect to the alternating group A_n, which is a subgroup of the permutation (symmetric) group S_n. These functions are connected with multivariate exponential…
An integer adder for integers in the binary representation is one of the basic operations of any digital processor. For adding two integers of N bits each, the serial adder takes as many clock ticks. For achieving higher speeds, parallel…
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…
We report on a recent conjecture by Gisin on a restriction of physical processes in sets of finite information numbers (FIN) and further analyze the entropic constraint associated with the proposed algorithm. In the course, we provide a…
We introduce a continuous-order integral analog of the Maclaurin expansion that reconstructs analytic functions from fractional derivative data. The operator integrates over continuous order, replacing the discrete sum of integer…
We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…
In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a…
The fractional polylogarithms, depending on a complex parameter $\a$, are defined by a series which is analytic inside the unit disk. After an elementary conversion of the series into an integral presentation, we show that the fractional…
This paper investigates a class of non-autonomous highly oscillatory ordinary differential equations characterized by a linear component inversely proportional to a small parameter $\varepsilon$, with purely imaginary eigenvalues, and an…
We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} =…
The sequence A000975 in OEIS can be defined by $A_1=1$, $A_{n+1}=2A_n$ if $n$ is odd, and $A_{n+1}=2A_n+1$ if $n$ is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several…