Sciweavers

2597 search results - page 5 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
DM
2008
105views more  DM 2008»
13 years 7 months ago
Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope
We determine the number of alternating parity sequences that are subsequences of an increasing m-tuple of integers. For this and other related counting problems we find formulas th...
C. M. da Fonseca, E. Marques De Sá
SSC
2007
Springer
147views Cryptology» more  SSC 2007»
14 years 1 months ago
Remarks on a Sequence of Minimal Niven Numbers
In this short note we introduce two new sequences defined using the sum of digits in the representation of an integer in a certain base. A connection to Niven numbers is proposed ...
H. Fredricksen, E. J. Ionascu, Florian Luca, Pante...
COMBINATORICS
1999
61views more  COMBINATORICS 1999»
13 years 7 months ago
A Fibonacci-like Sequence of Composite Numbers
In 1964, Ronald Graham proved that there exist relatively prime natural numbers a and b such that the sequence {An} defined by An = An-1 + An-2 (n 2; A0 = a, A1 = b) contains no ...
John W. Nicol
FM
2005
Springer
98views Formal Methods» more  FM 2005»
14 years 27 days ago
Retrenching the Purse: Finite Sequence Numbers, and the Tower Pattern
The Mondex Electronic Purse system [18] is an outstanding example of formal refinement techniques applied to a genuine industrial scale application, and notably, was the first ve...
Richard Banach, Michael Poppleton, Czeslaw Jeske, ...
ICC
2007
IEEE
14 years 1 months ago
Packet-Symbol Decoding for Reliable Multipath Reception with No Sequence Numbers
This paper presents a new decoding method inspired by Mitzenmacher’s idea of adding a different pseudo-random number to each packet, in a packet-symbol (n, k) code, for verificat...
John J. Metzner