Related papers: An algorithm for Egyptian fraction representations…
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
The fractional calculus is useful to model non-local phenomena. We construct a method to evaluate the fractional Caputo derivative by means of a simple explicit quadratic segmentary interpolation. This method yields to numerical resolution…
In this article, we deal with the efficient computation of the Wright function in the cases of interest for the expression of solutions of some fractional differential equations. The proposed algorithm is based on the inversion of the…
An efficient method is proposed for computing the structure of Jordan blocks of a matrix of integers or rational numbers by exact computation. We have given a method for computing Jordan chains of a matrix with exact computation. However,…
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number…
Refining an estimate of Croot, Dobbs, Friedlander, Hetzel and Pappalardi, we show that for all $k \geq 2$, the number of integers $1 \leq a \leq n$ such that the equation $a/n = 1/m_1 + \dotsc + 1/m_k$ has a solution in positive integers…
Fracterms are introduced as a proxy for fractions. A precise definition of fracterms is formulated and on that basis reasonably precise definitions of various classes of fracterms are given. In the context of the meadow of rational numbers…
For fixed natural numbers $r$ and $s$, where $2\leq s \leq r$, we consider a representation of numbers from the interval $[0;\frac{r}{s-1}]$ obtained by encoding numbers by means of the alphabet $A=\{0,1,...,r\}$ via the expansion…
This chapter presents some numerical methods to solve problems in the fractional calculus of variations and fractional optimal control. Although there are plenty of methods available in the literature, we concentrate mainly on approximating…
We propose an algorithm for reduction of the problem of maximization of fraction of two functionals to the equivalent procedure including maximization of difference between the functionals and the solution of an equation of scalar unknown.…
How data is represented and operationalized is critical for building computational solutions that are both effective and efficient. A common approach is to represent data objects as binary vectors, denoted \textit{hash codes}, which require…
We present a super-high-efficiency approximate computing scheme for series sum and discrete Fourier transform. The summation of a series sum or a discrete Fourier transform is approximated by summing over part of the terms multiplied by…
We study the rational dynamics of the map $\mathcal{T}(x)=\lfloor x\rfloor(1+\{x\})$, which appears in the recursive construction of the prime-representing constant of Fridman, Garbulsky, Glecer, Grime and Florentin. For a rational number…
The fractional calculus of variations and fractional optimal control are generalizations of the corresponding classical theories, that allow problem modeling and formulations with arbitrary order derivatives and integrals. Because of the…
We introduce the Ceiling Continued Fractions (FCT) framework for constructing three-term Egyptian fraction representations in the Erd\H{o}s-Straus conjecture. The approach exploits divisor structures of shifted integers p+i rather than…
In this paper we deal with a classical problem in elementary number theory, namely repeating decimals. We show how the digits of the period of the decimal representation of any fraction $\frac{k}{m}$, where $k$ and $m$ are positive integers…
In 2012 Chen and Singer introduced the notion of discrete residues for rational functions as a complete obstruction to rational summability. More explicitly, for a given rational function f(x), there exists a rational function g(x) such…
In this work we study the encoding of smooth, differentiable multivariate functions in quantum registers, using quantum computers or tensor-network representations. We show that a large family of distributions can be encoded as…
Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…
The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and…