Results 1 to 10 of about 63,525 (216)
Problems for combinatorial numbers satisfying a class of triangular arrays
Numbers satisfying a class of triangular arrays, defined by a bivariate first-order linear difference equation with linear coefficients, include a wide range of combinatorial numbers: binomial coefficients, Morgan numbers, Stirling numbers of the first ...
Igoris Belovas
doaj +3 more sources
The paper extends the investigations of limit theorems for numbers satisfying a class of triangular arrays. We obtain analytical expressions for the semiexponential generating function the numbers, associated with Hermite polynomials.
Igoris Belovas
doaj +1 more source
Some Algebraic Aspects of MorseCode Sequences [PDF]
Morse code sequences are very useful to give combinatorial interpretations of various properties of Fibonacci numbers. In this note we study some algebraic and combinatorial aspects of Morse code sequences and obtain several q-analogues of Fibonacci
Johann Cigler
doaj +2 more sources
SOME NATURAL PHENOMENA AND SIGN COMBINATORIAL SPACES
The literature describes many natural phenomena associated with combinatorial numbers, including the «gold» number that is represented by Fibonacci numbers. This suggests that the laws of combinatorics are inherent in nature.
Н.К. Тимофієва
doaj +1 more source
Remixed Eulerian numbers are a polynomial q-deformation of Postnikov’s mixed Eulerian numbers. They arose naturally in previous work by the authors concerning the permutahedral variety and subsume well-known families of polynomials such as q-binomial ...
Philippe Nadeau, Vasu Tewari
doaj +1 more source
Combinatorial Models of the Distribution of Prime Numbers
This work is divided into two parts. In the first one, the combinatorics of a new class of randomly generated objects, exhibiting the same properties as the distribution of prime numbers, is solved and the probability distribution of the combinatorial ...
Vito Barbarani
doaj +1 more source
Mixed volumes of hypersimplices [PDF]
In this extended abstract we consider mixed volumes of combinations of hypersimplices. These numbers, called mixed Eulerian numbers, were first considered by A.
Gaku Liu
doaj +1 more source
New combinatorial proof of the multiple binomial coefficient identity
Introduction/purpose: In this paper a new combinatorial proof of an already existing multiple sum with multiple binomial coefficients is given. The derived identity is related to the Fibonacci numbers. Methods: Combinatorial reasoning is used to obtain
Vuk N. Stojiljković
doaj +1 more source
A Combinatorial Model for $q$-Generalized Stirling and Bell Numbers [PDF]
We describe a combinatorial model for the $q$-analogs of the generalized Stirling numbers in terms of bugs and colonies. Using both algebraic and combinatorial methods, we derive explicit formulas, recursions and generating functions for these $q ...
Miguel Méndez, Adolfo Rodríguez
doaj +1 more source
On Fibonacci (k,p)-Numbers and Their Interpretations
In this paper, we define new kinds of Fibonacci numbers, which generalize both Fibonacci, Jacobsthal, Narayana numbers and Fibonacci p-numbers in the distance sense, using the definition of a distance between numbers by a recurrence relation according to
Berke Cengiz, Yasemin Taşyurdu
doaj +1 more source

