Related papers: Further developements in finite fibonomial calculu…
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…
We introduce full diffeomorphism-invariant Colombeau algebras with added $\varepsilone$-dependence in the basic space. This unites the full and special settings of the theory into one single framework. Using locality conditions we find the…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…
The present paper is a continuation of our work [11], where we introduced a fractional operator calculus related to a fractional ${\psi}-$Fueter operator in the one-dimensional Riemann-Liouville derivative sense in each direction of the…
Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…
In this paper, we find the closed sums of certain type of Fibonacci related convergent series. In particular, we generalize some results already obtained by Brousseau, Popov, Rabinowitz and others.
In this book for the first time the authors introduce the notion of real neutrosophic complex numbers. Further the new notion of finite complex modulo integers is defined. For every $C(Z_n)$ the complex modulo integer $i_F$ is such that…
Let $\alpha = (1+\sqrt{5})/2$ and define the lower and upper Wythoff sequences by $a_i = \lfloor i \alpha \rfloor$, $b_i = \lfloor i \alpha^2 \rfloor$ for $i \geq 1$. In a recent interesting paper, Kawsumarng et al. proved a number of…
We introduce a symbolic method for the evaluation of definite integrals containing combinations of various functions, including exponentials, logarithm and products of Bessel functions of different types. The method we develop is naturally…
Mathematical structure of the reflection coefficients for the one-dimensional Fokker-Planck equation is studied. A new formalism using differential operators is introduced and applied to the analysis in high- and low-energy regions.…
The classical Ruckert-Lefschetz scheme of analysis of implicit functions (defined by finite systems of n analytical equations with n unknowns) is studied from the point of view of calculations with finite number coefficients in Taylor…
A one-parameter generalized fermion algebra ${\cal B}_{\kappa}(1)$ is introduced. The Fock representation is studied. The associated coherent states are constructed and the polynomial representation, in the Bargmann sense, is derived. A…
We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset…
The factorizable vectors of a complete Boolean algebra of type I factors, acting on a separable Hilbert space, are shown to be total, resolving a conjecture of Araki and Woods. En route, the spectral theory of noise-type Boolean algebras of…
Our research builds upon Halmos's foundational work on functional monadic Boolean algebras and our previous work on tense operators to develop three essential constructions, including the important concepts of fuzzy sets and powerset…
We continue to investigate combinatorial properties of functions $f_m$ and $c_m$ considered in our previous papers. They depend on an initial arithmetic function $f_0$. In this paper, the values of $f_0$ are the binomial coefficients. We…
The optimal cube factor of a graph, a special kind of component factor, is first introduced. Furthermore, the optimal cube factors of Fibonacci and matchable Lucas cubes are studied; and some results on the Padovan sequence and binomial…