On orthogonal polynomials related to Fibonacci numbers
D. V. Jaiswal (1970)
Matematički Vesnik
Similarity:
D. V. Jaiswal (1970)
Matematički Vesnik
Similarity:
Djordjević, Gospava B. (1997)
Matematichki Vesnik
Similarity:
Zhang, Tianping, Ma, Yuankui (2005)
Journal of Integer Sequences [electronic only]
Similarity:
D. P. Shukla (1979)
Matematički Vesnik
Similarity:
Antzoulakos, Demetrios L. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
R.C.S. Chandel (1977)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Roffelsen, Pieter (2010)
SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]
Similarity:
Thomas Ernst (2014)
Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica
Similarity:
We study q-analogues of three Appell polynomials, the H-polynomials, the Apostol–Bernoulli and Apostol–Euler polynomials, whereby two new q-difference operators and the NOVA q-addition play key roles. The definitions of the new polynomials are by the generating function; like in our book, two forms, NWA and JHC are always given together with tables, symmetry relations and recurrence formulas. It is shown that the complementary argument theorems can be extended to the new polynomials...
Miloud Mihoubi, Hacène Belbachir (2011)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
Chou, Hsu and Shiue gave some applications of Faà di Bruno's formula to characterize inverse relations. Our aim is to develop some inverse relations connected to the multipartitional type polynomials involving to binomial type sequences.
Etingof, Pavel, Kirillov, Alexander jun. (1998)
Electronic Research Announcements of the American Mathematical Society [electronic only]
Similarity:
András Biró (2005)
Acta Arithmetica
Similarity:
Souad El Otmani, Armand Maul, Georges Rhin, Jean-Marc Sac-Épée (2013)
Journal de Théorie des Nombres de Bordeaux
Similarity:
In this work, we propose a new method to find monic irreducible polynomials with integer coefficients, only real roots, and span less than 4. The main idea is to reduce the search of such polynomials to the solution of Integer Linear Programming problems. In this frame, the coefficients of the polynomials we are looking for are the integer unknowns. We give inequality constraints specified by the properties that the polynomials should have, such as the typical distribution of their roots....