Related papers: An infinite natural sum
A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…
The ordinal sum construction provides a very effective way to generate a new triangular norm on the real unit interval from existing ones. One of the most prominent theorems concerning the ordinal sum of triangular norms on the real unit…
In this note, we derive a finite summation formula and an infinite summation formula involving Harmonic numbers of order up to some order by means of several definite integrals
The usual nonnegative modulus function is based on addition. A natural different modulus function on the set of positive reals is introduced. Arguments for results for series through the usual modulus function are transformed to arguments…
In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…
For every natural number $n$, there exist finitely presented groups with residual finiteness depths $\omega\cdot n$ and $\omega\cdot n + 1$. The ordinals that arise as the residual finiteness depth of a finitely generated group…
We provide a pure algebraic version of the dynamical characterization of Conrad's property. This approach allows dealing with general group actions on totally ordered spaces. As an application, we give a new and somehow constructive proof…
Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…
For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
We study decompositions of natural numbers into triangular summands. For instance, we prove that any natural number can be represented as a sum of four triangular numbers, two of them having even indices and the other two having odd…
Recent results of Hindman, Leader and Strauss and of Fern\'andez-Bret\'on and Rinot showed that natural versions of Hindman's Theorem fail {\em for all} uncontable cardinals. On the other hand, Komj\'ath proved a result in the positive…
The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
In this paper we present a new mathematical conception based on a new method for ordering the integers. The method relies on the assumption that negative numbers are beyond infinity, which goes back to Wallis and Euler. We also present a…
We prove and generalize some recent conjectures of Z.-W. Sun on infinite series whose summands involve products of harmonic numbers and several binomial coefficients. We evaluate various classes of infinite sums in closed form by…
Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computations}. A logic for convergent infinite computations is…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
A semiring can be ``completed'' (i.e., embedded into a semiring in which all infinite sums are defined and satisfy some reasonable properties) iff this semiring can be naturally partially ordered. This construction is ``natural'' (a left…
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…