Related papers: Multiplicative function instead of logarithm (an e…
A general classification of linear differential and finite-difference operators possessing a finite-dimensional invariant subspace with a polynomial basis is given. The main result is that any operator with the above property must have a…
In this article, we characterize the bounded and the compact multiplication operators between distinct iterated logarithmic Lipschitz spaces, and between the Lipschitz space and an iterated logarithmic Lipschitz space of an infinite tree.…
In this note, we introduce a new finite difference approximation called the Black-Box Logarithmic Expansion Numerical Derivative (BLEND) algorithm, which is based on a formal logarithmic expansion of the differentiation operator. BLEND…
Recently V.I.Arnold have formulated a geometrical concept of monads and apply it to the study of difference operators on the sets of $\{0,1\}$-valued sequences of length $n$. In the present note we show particular examples of these monads…
It is known that multiplication of linear differential operators over ground fields of characteristic zero can be reduced to a constant number of matrix products. We give a new algorithm by evaluation and interpolation which is faster than…
There has been always an ambiguity in division when zero is present in the denominator. So far this ambiguity has been neglected by assuming that division by zero as a non-allowed operation. In this paper, I have derived the new set of…
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…
In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…
Complex systems are composed of a large number of simple components connected to each other in the form of a network. It is shown that, for some network configurations, the equivalent dynamic behavior of the system is governed by an…
Differential operators usually result in derivatives expressed as a ratio of differentials. For all but the simplest derivatives, these ratios are typically not algebraically manipulable, but must be held together as a unit in order to…
We introduce real vector spaces composed of set-valued maps on an open set. They are also complete metric spaces, lattices, commutative rings. The set of differentiable functions is a dense subset of these spaces and the classical gradient…
We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…
A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…
Multiplicative order of an element $a$ of group $G$ is the least positive integer $n$ such that $a^n=e$, where $e$ is the identity element of $G$. If the order of an element is equal to $|G|$, it is called generator or primitive root. This…
On an infinite set some closure operators are finitary (algebraic) while others are not. We can generalize this idea for a complete algebraic lattice letting the compact elements act as the finite sets. With this in mind, we will consider…
Scientific studies often require the precise calculation of derivatives. In many cases an analytical calculation is not feasible and one resorts to evaluating derivatives numerically. These are error-prone, especially for higher-order…
We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…
We consider chaining multiplicative-inverse operations in finite fields under alternating polynomial bases. When using two distinct polynomial bases to alternate the inverse operation we obtain a partition of $\mathbb F_{p^n}\setminus…
Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special,…
We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.