Related papers: Generalized Compositions of Natural Numbers
In this paper, we study the combinatorial structures of straight and ordinary m\'enage permutations. Based on these structures, we prove four formulas. The first two formulas define a relationship between the m\'enage numbers and the…
We provide an efficient encoding of the natural numbers {0,1,2,3,...} as strings of nested parentheses {(),(()),(()()),((())),...}, or considered inversely, an efficient enumeration of such strings. The technique is based on the recursive…
Various families of octonion number sequences (such as Fibonacci octonion, Pell octonion and Jacobsthal octonion) have been established by a number of authors in many different ways. In addition, formulas and identities involving these…
The paper is an extensive and systematic study of cardinal invariants we call slalom numbers, describing the combinatorics of sequences of sets of natural numbers. Our general approach, based on relational systems, covers many such cardinal…
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…
In this paper, bicomplex Pell and bicomplex Pell-Lucas numbers are defined. Also, negabicomplex Pell and negabicomplex Pell-Lucas numbers are given. Some algebraic properties of bicomplex Pell and bicomplex Pell-Lucas numbers which are…
In 2013, Joerg Arndt recorded that the Fibonacci numbers count integer compositions where the first part is greater than the second, the third part is greater than the fourth, etc. We provide a new combinatorial proof that verifies his…
We express the set of representations from a cyclic $p$-group to a connected $p$-compact group in terms of the associated reflection group and compute its cardinality for each exotic $p$-compact group.
We considered the properties of generalized Fibonacci and Lucas numbers class. The analogues of well-known Fibonacci identities for generalized numbers are obtained. We gained a new identity of product convolution of generalized Fibonacci…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
We present several types of ordinary generating functions involving central binomial coefficients, harmonic numbers, and odd harmonic numbers. Our results complement those of Boyadzhiev from 2012 and Chen from 2016. Based on these…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
This paper grew out of the observation that the possibilities of proof by induction and definition by recursion are often confused. The paper reviews the distinctions. The von Neumann construction of the ordinal numbers includes a…
This paper shows how the study of colored compositions of integers reveals some unexpected and original connection with the Invert operator. The Invert operator becomes an important tool to solve the problem of directly counting the number…
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…
In this paper, we consider infinite sums derived from the reciprocals of the generalized Fibonacci numbers. We obtain some new and interesting identities for the generalized Fibonacci numbers.
We present a comprehensive survey of constructions of the real numbers (from either the rationals or the integers) in a unified fashion, thus providing an overview of most (if not all) known constructions ranging from the earliest attempts…
We define reflective numbers and their iterative summations. We provide classification of reflective numbers based on their iterative cyclical limits.
Carlitz considered integer compositions in which adjacent parts must be unequal. Arndt recently initiated the study of restricted compositions based on conditions applied to certain pairs of parts rather than to individual parts. Here, we…
An integer composition of a nonnegative integer $n$ is a tuple $(\pi_1,\ldots,\pi_k)$ of nonnegative integers whose sum is $n$; the $\pi_i$'s are called the parts of the composition. For fixed number $k$ of parts, the number of $f$-weighted…