Related papers: Description of Euler bricks using Fibonacci's iden…
We introduce the notion of Fibonacci and Lucas derivations of the polynomial algebras and prove that any element of kernel of the derivations defines a polynomial identity for the Fibonacci and Lucas polynomials. Also, we prove that any…
In this paper, we give some sufficient conditions for a $n$-dimensional rectangle to be tiled with a set of bricks. These conditions are obtained by using the so-called Frobenius number.
In this paper, we deal with q-Euler numbers and q-Bernoulli numbers. We derive some interesting relations for q-Euler numbers and polynomials by using their generating function and derivative operator. Also, we show between the q-Euler…
We show that integration with respect to the Euler-Poincar\'e characteristic can be extended from the setting of definable sets to the setting of topological spaces homeomorphic to definable sets. We use that extension to generalize a…
In this paper, we study some properties of Euler polynomials arising from umbral calculus. Finally, we give some interesting identities of Euler polynomials using our results. Recently, Dere and Simsek have studied umbral calculus related…
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…
In this paper, we study umbral calculus to have alternative ways of obtaining our results. That is, we derive some interesting identities of the higher-order Bernoulli, Euler and Hermite polynomials arising from umbral calculus to have…
In this paper, we introduce a novel identity for generalized Euler polynomials, leading to further generalizations for several relations involving classical Euler numbers, Euler polynomials, Genocchi polynomials, and Genocchi numbers.
In this paper, we give some properties of the Tribonacci and Tribonacci-Lucas quaternions and obtain some identities for them.
The purpose of this paper is to present a syatemic study of some familes of higher-order Euler numbers and polynomials. In particular, by using the basis property of higher-order Euler polynomials for the space of polynomials of degree less…
By investigating a recurrence relation about functions, we first give alternative proofs of various identities on Fibonacci numbers and Lucas numbers, and then, make certain well known identities visible via certain trivalent graph…
In this work, we derive numerous identities for multivariate q-Euler polynomials by using umbral calculus.
We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the…
The Feynman identity (FI) of a planar graph relates the Euler polynomial of the graph to an infinite product over the equivalence classes of closed nonperiodic signed cycles in the graph. The main objectives of this paper are to compute the…
We study a relation between brick $n$-tuples of subspaces of a finite dimensional linear space, and irreducible $n$-tuples of subspaces of a finite dimensional Hilbert (unitary) space such that a linear combination, with positive…
These lecture notes provide a self-contained introduction to Euler integrals, which are frequently encountered in applications. In particle physics, they arise as Feynman integrals or string amplitudes. Our four selected topics demonstrate…
We consider an identity relating Fibonacci numbers to Pascal's triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, most of them rather involved or else relying on sophisticated number theoretical…
A perfect cuboid is formed when an Euler brick whose edges and face diagonals are all integers also has an integer internal diagonal. It is known that if a perfect cuboid exists the internal diagonal is odd. No perfect cuboid has been…
We present a differential-calculus-based method which allows one to derive more identities from {\it any} given Fibonacci-Lucas identity containing a finite number of terms and having at least one free index. The method has two {\it…
We discuss an algebraic identity, due to Sylvester, as well as related algebraic identities and applications.