Displaying 2301 – 2320 of 16555

Showing per page

Cauchy, Ferrers-Jackson and Chebyshev polynomials and identities for the powers of elements of some conjugate recurrence sequences

Roman Wituła, Damian Słota (2006)

Open Mathematics

In this paper some decompositions of Cauchy polynomials, Ferrers-Jackson polynomials and polynomials of the form x 2n + y 2n , n ∈ ℕ, are studied. These decompositions are used to generate the identities for powers of Fibonacci and Lucas numbers as well as for powers of the so called conjugate recurrence sequences. Also, some new identities for Chebyshev polynomials of the first kind are presented here.

Cauchy multiplication and periodic functions (mod r).

Pentti Haukkanen, R. Sivaramakrishnan (1991)

Collectanea Mathematica

We analise periodic functions (mod r), keeping Cauchy multiplication as the basic tool, and pay particular attention to even functions (mod r) having the property f(n) = f((n,r)) for all n. We provide some new aspects into the Hilbert space structure of even functions (mod r) and make use of linera transformations to interpret the known number-theoretic formulae involving solutions of congruences.

Cayley orders

Arjeh M. Cohen, Gabriele Nebe, Wilhelm Plesken (1996)

Compositio Mathematica

Census algorithms for chinese remainder pseudorank

David Laing, Bruce Litow (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We investigate the density and distribution behaviors of the chinese remainder representation pseudorank. We give a very strong approximation to density, and derive two efficient algorithms to carry out an exact count (census) of the bad pseudorank integers. One of these algorithms has been implemented, giving results in excellent agreement with our density analysis out to 5189 -bit integers.

Census algorithms for chinese remainder pseudorank

David Laing, Bruce Litow (2007)

RAIRO - Theoretical Informatics and Applications

We investigate the density and distribution behaviors of the chinese remainder representation pseudorank. We give a very strong approximation to density, and derive two efficient algorithms to carry out an exact count (census) of the bad pseudorank integers. One of these algorithms has been implemented, giving results in excellent agreement with our density analysis out to 5189-bit integers.

Certain L-functions at s = 1/2

Shin-ichiro Mizumoto (1999)

Acta Arithmetica

Introduction. The vanishing orders of L-functions at the centers of their functional equations are interesting objects to study as one sees, for example, from the Birch-Swinnerton-Dyer conjecture on the Hasse-Weil L-functions associated with elliptic curves over number fields.    In this paper we study the central zeros of the following types of L-functions:    (i) the derivatives of the Mellin transforms of Hecke eigenforms for SL₂(ℤ),    (ii) the Rankin-Selberg...

Currently displaying 2301 – 2320 of 16555