A review of Costas arrays.
Drakakis, Konstantinos (2006)
Journal of Applied Mathematics
Similarity:
Displaying similar documents to “Cross-correlation properties of Costas arrays and their images under horizontal and vertical flips.”
A review of Costas arrays.
A generalization of an IMO problem.
Fink, Alex (2006)
Integers
Similarity:
A new formulation of the law of octic reciprocity for primes =+-3 (mod 8) and its consequences.
Hudson, Richard H., Williams, Kenneth S. (1982)
International Journal of Mathematics and Mathematical Sciences
Similarity:
When are subset sums equidistributed modulo ?
Wagon, Stan, Wilf, Herbert S. (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Divisibility by 2 and 3 of certain Stirling numbers.
Davis, Donald M. (2008)
Integers
Similarity:
On powerful numbers.
Mollin, R.A., Walsh, P.G. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Regularity properties of the Stern enumeration of the rationals.
Reznick, Bruce (2008)
Journal of Integer Sequences [electronic only]
Similarity:
Restricted walks in regular trees.
Ciobanu, Laura, Radomirović, Saša (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cryptanalysis of a public-key cryptosystem based on Dickson-polynomials
Rupert Nöbauer (1988)
Mathematica Slovaca
Similarity:
Extensions of the Gauss-Wilson theorem.
Cosgrave, John B., Dilcher, Karl (2008)
Integers
Similarity:
On the D0L Repetition Threshold
Ilya Goldstein (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
The repetition threshold is a measure of the extent to which there need to be consecutive (partial) repetitions of finite words within infinite words over alphabets of various sizes. Dejean's Conjecture, which has been recently proven, provides this threshold for all alphabet sizes. Motivated by a question of Krieger, we deal here with the analogous threshold when the infinite word is restricted to be a D0L word. Our main result is that, asymptotically, this threshold does not exceed...
Non-repetitive tilings.
Currie, James D., Simpson, Jamie (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity: