Results 51 to 60 of about 7,865 (225)
, 2009 We show that the Conway polynomials of Fibonacci links are Fibonacci polynomials modulo 2. We deduce that, when $ n \not\equiv 0 \Mod 4$ and $(n,j) \neq (3,3),$ the Fibonacci knot $ \cF_j^{(n)} $ is not a Lissajous knot.Comment: 7p ...
Koseleff, Pierre-Vincent, Pecker, Daniel
core +2 more sources
Orthogonal polynomials and deformed oscillators
, 2015 We discuss the construction of oscillator-like systems associated with orthogonal polynomials on the example of the Fibonacci oscillator. In addition, we consider the dimension of the corresponding lie algebras.Comment: 12 pages Submited to TMF based on ...
Borzov, V. V., Damaskinsky, E. V.
core +1 more source
High‐resolution X‐ray scanning with a diffuse Huffman‐patterned probe to reduce radiation damage
Journal of Synchrotron Radiation, Volume 32, Issue 3, Page 700-717, May 2025.This paper introduces high‐resolution imaging using diffuse probes, which allow for lower energy deposition per unit area per unit time, by encoding Huffman‐like patterns onto them, enabling a tighter impulse response. The approach, demonstrated in X‐ray imaging, involves using specially fabricated masks to shape the probe and recover sharp object ...
Alaleh Aminzadeh +5 more
wiley +1 more source
A classification of infinite staircases for Hirzebruch surfaces
Journal of Topology, Volume 18, Issue 1, March 2025.Abstract The ellipsoid embedding function of a symplectic manifold gives the smallest amount by which the symplectic form must be scaled in order for a standard ellipsoid of the given eccentricity to embed symplectically into the manifold. It was first computed for the standard four‐ball (or equivalently, the complex projective plane) by McDuff and ...
Nicki Magill +2 more
wiley +1 more source
Strong bounds and exact solutions to the minimum broadcast time problem
International Transactions in Operational Research, Volume 32, Issue 1, Page 314-352, January 2025.Abstract Given a graph and a subset of its nodes, referred to as source nodes, the minimum broadcast time problem asks for the minimum number of steps in which a signal can be transmitted from the sources to all other nodes in the graph. In each step, the sources and the nodes that already have received the signal can forward it to at most one of their
Marika Ivanova +2 more
wiley +1 more source
Chebyshev polynomials and their some interesting applications
Advances in Difference Equations, 2017 The main purpose of this paper is by using the definitions and properties of Chebyshev polynomials to study the power sum problems involving Fibonacci polynomials and Lucas polynomials and to obtain some interesting divisible properties.
Chen Li, Zhang Wenpeng
doaj +1 more source
On the Chebyshev polynomials and some of their new identities
Advances in Difference Equations, 2020 The main purpose of this paper is, using the elementary methods and properties of the power series, to study the computational problem of the convolution sums of Chebyshev polynomials and Fibonacci polynomials and to give some new and interesting ...
Di Han, Xingxing Lv
doaj +1 more source
Incomplete generalized Fibonacci and Lucas polynomials [PDF]
Hacettepe Journal of Mathematics and Statistics, 2015 In this paper, we define the incomplete h(x)-Fibonacci and h(x)-Lucas polynomials, we study recurrence relations and some properties of these ...
openaire +4 more sources
On the Generalized Class of Multivariable Humbert‐Type Polynomials
International Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.The present paper deals with the class of multivariable Humbert polynomials having generalization of some well‐known polynomials like Gegenbauer, Legendre, Chebyshev, Gould, Sinha, Milovanović‐Djordjević, Horadam, Horadam‐Pethe, Pathan and Khan, a class of generalized Humbert polynomials in two variables etc.
B. B. Jaimini +4 more
wiley +1 more source
Divisors and specializations of Lucas polynomials [PDF]
, 2014 Three-term recurrences have infused stupendous amount of research in a broad spectrum of the sciences, such as orthogonal polynomials (in special functions) and lattice paths (in enumerative combinatorics).
Amdeberhan, Tewodros +2 more
core