Related papers: Additive transform of an arithmetic function : Par…
Functionals are an important research subject in Mathematics and Computer Science as well as a challenge in Information Technologies where the current programming paradigm states that only symbolic computations are possible on higher order…
First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…
The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…
In this paper, we extend the classical arithmetic defined over the set of natural numbers N, to the set of all finite directed connected multigraphs having a pair of distinct distinguished vertices. Specifically, we introduce a model F on…
In this paper we talk about the so-called SuperMathematics Functions (SMF), which often constiture the base for generating technical neo-geometrical objects.
Associated Legendre functions of fractional degree appear in the solution of boundary value problems in wedges or in toroidal geometries, and elsewhere in applied mathematics. In the classical case when the degree is half an odd integer,…
Let $\Omega$ be a set of positive integers and let $f:\Omega \rightarrow \Omega$ be an arithmetic function. Let $V = (v_i)_{i=1}^n$ be a finite sequence of positive integers. An integer $m \in \Omega$ has \textit{increasing-decreasing…
Let $R$ be a commutative ring $R$ with $1_R$ and with group of units $R^{\times}$. Let $\Phi = \Phi(t_1,\ldots, t_h) = \sum_{i=1}^h \varphi_it_i$ be an $h$-ary linear form with nonzero coefficients $\varphi_1,\ldots, \varphi_h \in R$. Let…
The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…
We consider the summatory function of the number of prime factors for integers $\leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg…
A function $f:\mathbb{Z}_n \to \mathbb{C}$ can be represented as a linear combination $f(x)=\sum_{\alpha \in \mathbb{Z}_n}\widehat{f}(\alpha) \chi_{\alpha,n}(x)$ where $\widehat{f}$ is the (discrete) Fourier transform of $f$. Clearly, the…
We prove a classification of additive polynomial superfunctors, which allows us to compute some extensions of a superfunctor of the form $F \circ A$ where $F$ is a classical polynomial functor and $A$ is additive. We get a formula which…
The paper presents derivation and interpretation of one type of variable order derivative definitions. For mathematical modelling of considering definition the switching and numerical scheme is given. The paper also introduces a numerical…
In this paper we propose an extension of the notion of deviation-based aggregation function tailored to aggregate multidimensional data. Our objective is both to improve the results obtained by other methods that try to select the best…
Digital System Research has pioneered the mathematics and design for a new class of computing machine using residue numbers. Unlike prior art, the new breakthrough provides methods and apparatus for general purpose computation using several…
This paper describes an algorithm for the computation of FIRST and FOLLOW sets for use with feature-theoretic grammars in which the value of the sets consists of pairs of feature-theoretic categories. The algorithm preserves as much…
A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and…
Best possible bounds are obtained for the concentration function of an additive arithmetic function on sequences of shifted primes.
Discrete analogs of the classical Mehler-Fock transforms are introduced and investigated. It involves series with the associated Legendre function $P^\mu_{in-1/2}(x), x > 1,\ {\rm Re} \mu < 1/2, \ n \in \mathbb{N}, i $ is the imaginary…
A new $\theta$ function primitive is proposed that almost achieves the combined efficiency of the addition, multiplication and successor growth operations. This $\theta$ function symbol enables the constructing of an "IQFS(PA+)" axiom…