Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Strongly asymmetric sequences generated by four elements

Author: František Fiala
Journal: Math. Comp. 25 (1971), 155-162
MSC: Primary 05B30
MathSciNet review: 0291113
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Some general properties of strongly asymmetric sequences generated by $ m \geqq 1$ elements (m-SAS) are given. Computational experience with two algorithms--for listing of all 4-SASs of a given length n and for generating the smallest 4-SAS of length $ n = 1,2, \cdots $ --supports the conjecture that there exists an infinite 4-SAS. The smallest 4-SAS of length 592 is presented.

References [Enhancements On Off] (What's this?)

  • [1] Paul Erdős, Some unsolved problems, Magyar Tud. Akad. Mat. Kutató Int. Közl. 6 (1961), 221–254. MR 0177846
  • [2] A. A. Evdokimov, Strongly asymmetric sequences generated by a finite number of symbols., Dokl. Akad. Nauk SSSR 179 (1968), 1268–1271 (Russian). MR 0234842

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 05B30

Retrieve articles in all journals with MSC: 05B30

Additional Information

Keywords: Strongly asymmetric sequences, lexicographical ordering, number systems
Article copyright: © Copyright 1971 American Mathematical Society