Displaying 721 – 740 of 2016

Showing per page

Extensions of umbral calculus II: double delta operators, Leibniz extensions and Hattori-Stong theorems

Francis Clarke, John Hunton, Nigel Ray (2001)

Annales de l’institut Fourier

We continue our programme of extending the Roman-Rota umbral calculus to the setting of delta operators over a graded ring E * with a view to applications in algebraic topology and the theory of formal group laws. We concentrate on the situation where E * is free of additive torsion, in which context the central issues are number- theoretic questions of divisibility. We study polynomial algebras which admit the action of two delta operators linked by an invertible power series, and make related constructions...

Extraresolvability of balleans

Igor V. Protasov (2007)

Commentationes Mathematicae Universitatis Carolinae

A ballean is a set endowed with some family of balls in such a way that a ballean can be considered as an asymptotic counterpart of a uniform topological space. We introduce and study a new cardinal invariant of a ballean, the extraresolvability, which is an asymptotic reflection of the corresponding invariant of a topological space.

FFF. Fibonacci: di Fiore in Fiore

Paulo Ribenboim (2002)

Bollettino dell'Unione Matematica Italiana

In occasione della commemorazione dell’800-esimo anniversario della pubblicazione del Liber Abaci, desidero richiamare l’attenzione del lettore su alcuni dei fatti che preferisco riguardanti numeri di Fibonacci. Tali fatti includono la presenza di quadrati, di multipli di quadrati e di numeri potenti tra i numeri di Fibonacci, la rappresentazione di numeri reali e la costruzione di numeri trascendenti mediante numeri di Fibonacci, la possibilità di costruire una serie zeta ed un dominio a fattorizzazione...

Finding the roots of polynomial equations: an algorithm with linear command.

Bernard Beauzamy (2000)

Revista Matemática Complutense

We show how an old principle, due to Walsh (1922), can be used in order to construct an algorithm which finds the roots of polynomials with complex coefficients. This algorithm uses a linear command. From the very first step, the zero is located inside a disk, so several zeros can be searched at the same time.

Currently displaying 721 – 740 of 2016