Related papers: Generalized Compositions of Natural Numbers
In this paper, we establish an identity for Bernoulli's generalized polynomials. We deduce generalizations for many relations involving classical Bernoulli numbers or polynomials. In particular, we generalize a recent Gessel identity.
We investigate bicomplex analogues of fundamental notions from classical algebraic number theory. In particular, we show that the primitive element theorem admits a natural generalization to bicomplex extensions, giving rise to two distinct…
In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence…
We give a combinatorial characterization of nodal curves admitting a natural d-th Abel map to their Picard scheme, for any positive integer d. "Natural" here means compatible with and independent of specialization.
In the present article, real number representations, that are generalizations of classical positive and alternating representations of numbers, are introduced and investigated. The main metric relation, properties of cylinder sets are…
In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.
We establish a connection between constructible representations (arising in the study of left cells in Weyl groups) and Catalan numbers.
In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…
This paper examines the recursive sequence of polynomials $p_n(x)$, defined by $p_0(x) = x^2 - 2$ and $p_n(x) = p_{n-1}(x)^2 - 2$ for $n \geq 1$. It describes the field-theoretic motivations behind this sequence, derives a recursive formula…
For any integer $k \geq 2$, let $\{Q_{n}^{(k)} \}_{n \geq -(k-2)}$ denote the $k$-generalized Pell-Lucas sequence which starts with $0, \dots ,2,2$($k$ terms) where each next term is the sum of the $k$ preceding terms. In this paper, we…
Compositionality is a widely discussed property of natural languages, although its exact definition has been elusive. We focus on the proposal that compositionality can be assessed by measuring meaning-form correlation. We analyze…
We point out that the recursive formula that appears in Erickson's presentation "Fusible Numbers" is incorrect, and pose an alternate conjecture about the structure of fusible numbers. Although we are unable to solve the conjecture, we…
In this paper, we provide new applications of Fibonacci and Lucas numbers. In some circumstances, we find algebraic structures on some sets defined with these numbers, we generalize Fibonacci and Lucas numbers by using an arbitrary binary…
We conjecture that the structure of Bernoulli numbers can be explicitly given in the closed form $$ B_n = (-1)^{\frac{n}{2}-1} \prod_{p-1 \nmid n} |n|_p^{-1} \prod\limits_{(p,l)\in\Psi^{\rm irr}_1 \atop n \equiv l \mods{p-1}} |p…
A generalization of numeration system in which the set N of the natural numbers is recognizable by finite automata can be obtained by describing a lexicographically ordered infinite regular language. Here we show that if P belonging to Q[x]…
Lexicographic composition is a natural way to build an aggregate choice function from component choice functions. As the name suggests, the components are ordered and choose sequentially. The sets that subsequent components select from are…
In this paper we investigate congruence relationships of particular finite generalized harmonic numbers sums. We suggest more transparent and simpler method to analyse these sums and present several additional results for certain special…
We prove astonishing identities generated by compositions of positive integers. In passing, we obtain two new identities for Stirling numbers of the first kind. In the two last sections we clarify an algebraic sense of these identities and…
A code of the natural numbers is a uniquely-decodable binary code of the natural numbers with non-decreasing codeword lengths, which satisfies Kraft's inequality tightly. We define a natural partial order on the set of codes, and show how…
Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl that generates all unique permutations of a list of elements which…