Related papers: Arithmetic Digit Manipulation and The Conway Base-…
Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not…
Although being powerful, the differential transform method yet suffers from a drawback which is how to compute the differential transform of nonlinear non-autonomous functions that can limit its applicability. In order to overcome this…
In this paper we compute the closure of the numerical range of certain periodic tridiagonal operators. This is achieved by showing that the closure of the numerical range of such operators can be expressed as the closure of the convex hull…
Fold functions are a general mechanism for computing over recursive data structures. First-order folds compute results bottom-up. With higher-order folds, computations that inherit attributes from above can also be expressed. In this paper,…
Conway's real closed field $\mathbf{No}$ of surreal numbers is a sweeping generalization of the real numbers and the ordinals to which a number of elementary functions such as log and exponentiation have been shown to extend. The problems…
For some research questions that involve Spin(p, q) representation theory, using symbolic algebra based techniques might be an attractive option for simplifying and manipulating expressions. Yet, for some such problems, especially as they…
Two sets of mutually commuting $q-$difference operators $x_i$ and $y_j$, $i,j=1, ...,N$ such that $x_i$ and $y_i$ generate a homomorphic image of the $q-$Onsager algebra for each $i$ are introduced. The common polynomial eigenfunctions of…
We present a new general theory of function-based hypergraph transformations on finite families of finite hypergraphs. A function-based hypergraph transformation formalises the action of structurally modifying hypergraphs from a family in a…
In the present paper we explore a way to represent numbers with respect to the base $-\frac32$ using the set of digits $\{0,1,2\}$. Although this number system shares several properties with the classical decimal system, it shows remarkable…
Functions satisfying the functional equation \begin{align*} \sum_{r=0}^{n-1} (-1)^r f(x+ry, ny) = f(x,y), \quad \text{for any positive odd integer $n$}, \end{align*} are named the alternating invariant functions. Examples of such functions…
Multimodular functions, primarily used in the literature of queueing theory, discrete-event systems, and operations research, constitute a fundamental function class in discrete convex analysis. The objective of this paper is to clarify the…
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…
We consider the following "partition and sum" operation on a natural number: Treating the number as a long string of digits insert several plus signs in between some of the digits and carry out the indicated sum. This results in a smaller…
This current article aims to study a new subclass of meromorphic functions with positive coefficients by reconstructing a new operator in the punctured open disc. Also, some geometric properties are considered and investigated, such results…
The unprecedented performance achieved by deep convolutional neural networks for image classification is linked primarily to their ability of capturing rich structural features at various layers within networks. Here we design a series of…
In this paper, we introduced the theory of the sieve function transformation. Using the principle of sieve function transformation, we improved sieve method, and obtained the difference range of similar sieve function values. For this, we…
We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…
Employing the Orlicz functions we extend the Buzano's inequality which is a refinement of the Cauchy-Schwarz inequality. Also using the Orlicz functions we obtain several numerical radius inequalities for a bounded linear operator as well…
Given an operator convex function $f(x)$, we obtain an operator-valued lower bound for $cf(x) + (1-c)f(y) - f(cx + (1-c)y)$, $c \in [0,1]$. The lower bound is expressed in terms of the matrix Bregman divergence. A similar inequality is…
Error correction will add so much overhead to large quantum computations that we suspect the most efficient algorithms will use a classical co-processor to do as much work as possible. We present a method to offload portions of a quantum…