English
Related papers

Related papers: On One Function Defined on the Cartesian Product a…

200 papers

Ultrafunctions are a particular class of functions defined on a Non Archimedean field E. They have been introduced and studied in some previous works. In this paper we develop the notion of fine ultrafunctions which improves the older…

Analysis of PDEs · Mathematics 2022-03-14 Vieri Benci

Time evolution equations for dynamical systems can often be derived from generating functionals. Examples are Newton's equations of motion in classical dynamics which can be generated within the Lagrange or the Hamiltonian formalism. We…

Neurons and Cognition · Quantitative Biology 2014-04-23 Claudius Gros

We introduce a class of convolutions on arithmetical functions that are regular in the sense of of Narkiewicz, homogeneous in the sense of Burnett et al, and bounded, in the sense that there exists a common finite bound for the rank of…

Number Theory · Mathematics 2025-04-30 Jan Snellman

Among three natural numbers there is always one which is larger than or equal to the Nim sum of the remaining two numbers. This amazing fact has many applications.

Combinatorics · Mathematics 2015-03-05 Christoph Hering

As far as algebraic properties are concerned, the usual addition on the class of ordinal numbers is not really well behaved; for example, it is not commutative, nor left cancellative etc. In a few cases, the natural Hessemberg sum is a…

Logic · Mathematics 2017-02-28 Paolo Lipparini

We prove that several results in different areas of number theory such as the divergent series, summation of arithmetic functions, uniform distribution modulo one and summation over prime numbers which are currently considered to be…

Number Theory · Mathematics 2011-03-30 Nilotpal Kanti Sinha , Marek Wolf

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…

Logic in Computer Science · Computer Science 2007-05-23 J. V. Tucker , J. I. Zucker

We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…

Combinatorics · Mathematics 2013-01-22 Milan Janjic , Boris Petkovic

The main aim of this paper is to provide a novel approach to deriving identities for the Bernstein polynomials using functional equations. We derive various functional equations and differential equations using generating functions.…

Classical Analysis and ODEs · Mathematics 2018-11-19 Yilmaz Simsek

We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…

Combinatorics · Mathematics 2026-01-27 Dušan Dragutinović

A new class of Semantic Numeration Systems, namely, positive rational Semantic Numeration Systems is introduced. For cardinal semantic operators, differences in the formation of carry (common carry) and remainders are defined. The…

Logic in Computer Science · Computer Science 2026-05-01 Alexander Chunikhin

The basic mathematical properties of Green's functions used in statistical mechanics as well as the equations defining these functions and the techniques of solving these equations are reviewed. An approach is presented called the…

Statistical Mechanics · Physics 2007-05-23 V. I. Yukalov

We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obtained as a limit of an infinite computation of a quantum…

Logic in Computer Science · Computer Science 2015-04-14 Stefano Guerrini , Simone Martini , Andrea Masini

The classical Goodstein process gives rise to long but finite sequences of natural numbers whose termination is not provable in Peano arithmetic. In this manuscript we consider a variant based on the Ackermann function. We show that…

This is a compendium of generating functions involving single, double sums and definite integrals. These generating functions also involve special functions in both the summand function and closed form solution.

General Mathematics · Mathematics 2024-05-03 Robert Reynolds

It is shown that any finitely generated subring of a global field has a universal first-order definition in its fraction field. This covers Koenigsmann's result for the ring of integers and its subsequent extensions to rings of integers in…

Number Theory · Mathematics 2023-01-06 Nicolas Daans

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

Logic · Mathematics 2017-07-19 Dmytro Taranovsky

The Hirsch function of a given continuous function is a new function depending on a parameter. It exists provided some assumptions are satisfied. If this parameter takes the value one, we obtain the well-known h-index. We prove some…

General Mathematics · Mathematics 2022-12-20 Leo Egghe

First we define a new kind of function over $\mathbb{N}$. For each $i\in\mathbb{N}$ we have an associated function, which will be called $S_i$ . Then we define a new kind of sequence, to be made from the functions $S_i$ . Finally, we will…

General Mathematics · Mathematics 2016-07-22 Felipe Bottega Diniz

All the already known results on self descriptive numbers, together with the demonstration of the uniqueness for bases greater than 6, are here obtained through a systematic scheme of proof and not trial and error. The proof is also…

Combinatorics · Mathematics 2021-05-05 Orazio Sorgoná