integer sequence periodicity
- To: mathgroup at smc.vnet.net
- Subject: [mg39744] integer sequence periodicity
- From: "Michal Kvasnicka" <michal.kvasnicka at NoSpam.quick.cz>
- Date: Wed, 5 Mar 2003 00:05:00 -0500 (EST)
- Sender: owner-wri-mathgroup at wolfram.com
I am looking for best, in the statistical sense, basic (longest but shorter
than length of the whole sequence, of course) period estimation of the
integer sequence. The integer sequence may be corrupted by fading (randomly
missing sequence elements).
The integer sequence with the basic period P has length L and contain every
integer numbers i = 1,2, ..., N at least once. Where N<=P<L.
In the real application will be L ~ 100-10000, N ~ 3-100 and P ~ 3-100
Are there any suitable, robust and efficient algorithms?
Thanks for any relevant hints,
Prev by Date:
How do i call a function written in mathematica from python
Next by Date:
Problem :mathematica building help browser index
Previous by thread:
Re: How do i call a function written in mathematica from python
Next by thread:
Re: integer sequence periodicity