Related papers: New type Stirling like numbers - an email style le…
We derive two new identities involving the Bernoulli numbers, the Euler numbers, and the Stirling numbers of the first kind using analytic continuation of a well known identity for the Stirling numbers of the first kind.
We explore the enumeration of some natural classes of graded posets, including all graded posets, (2+2)- and (3+1)-avoiding graded posets, (2+2)-avoiding graded posets, and (3+1)-avoiding graded posets. We obtain enumerative and structural…
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…
In this paper we study natural reconfiguration spaces associated to the problem of distributing a fixed number of resources to labeled nodes of a tree network, so that no node is left empty. These spaces turn out to be cubical complexes,…
At the first part of the paper we show how specific umbral extensions of the Stirling numbers of the second kind result in new type of Dobinski-like formulas. In the second part among others one recovers how and why Ward solution of…
We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…
The following magic trick is at the center of this paper. While the audience writes the first ten terms of a Fibonacci-like sequence (the sequence following the same recursion as the Fibonacci sequence), the magician calculates the sum of…
In this paper we elaborate on the structure of the semigroup tree and the regularities on the number of descendants of each node observed earlier. These regularites admit two different types of behavior and in this work we investigate which…
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…
For any positive integer r, the r-associated Stirling number of the second kind enumerates the number of partitions of the set{1,2,3,...,n} into k non-empty disjoint subsets such that each subset contains at least r elements. We introduce…
This work explores new arithmetic and combinatorial structures arising from the interplay between Farey-type graphs, Fibonacci expansions, and operadic constructions. We introduce Fibonadic numbers, defined as an inverse limit under the…
It's the age-old recurrence with a twist: sum the last two terms and if the result is composite, divide by its smallest prime divisor to get the next term (e.g., 0, 1, 1, 2, 3, 5, 4, 3, 7, ...). These sequences exhibit pseudo-random…
The notion of $(a,b)$-cores is closely related to rational $(a,b)$ Dyck paths due to Anderson's bijection, and thus the number of $(a,a+1)$-cores is given by the Catalan number $C_a$. Recent research shows that $(a,a+1)$ cores with distinct…
In this paper, we find an elementary approach for double sums where the inner sum is binomial but incomplete. We apply our core identity and its relatives to double sums involving famous numbers such as harmonic numbers, Fibonacci numbers,…
A new family of generalized Pell numbers was recently introduced and studied by Br\'od \cite{Dorota}. These number possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of generalized Pell numbers can…
We derive new matrix representation for higher order Daehee numbers and polynomials, the higher order lambda-Daehee numbers and polynomials and the twisted lambda-Daehee numbers and polynomials of order k. This helps us to obtain simple and…
Prime numbers are fascinating by the way they appear in the set of natural numbers. Despite several results enlighting us about their repartition, the set of prime numbers is often informally qualified as misterious. In the present paper,…
In the present paper, I describe a spiking neural network (SNN) architecture which, can be used in wide range of supervised learning classification tasks. It is assumed, that all participating signals (the classified object description,…
In this paper we introduce mixed coloured permutation, permutations with certain coloured cycles, and study the enumerative properties of these combinatorial objects. We derive the generating function, closed forms, recursions and…
We use rook placements to prove Spivey's Bell number formula and other identities related to it, in particular, some convolution identities involving Stirling numbers and relations involving Bell numbers. To cover as many special cases as…