Strongly asymmetric sequences generated by four elements
HTML articles powered by AMS MathViewer
- by František Fiala PDF
- Math. Comp. 25 (1971), 155-162 Request permission
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
- Paul Erdős, Some unsolved problems, Magyar Tud. Akad. Mat. Kutató Int. Közl. 6 (1961), 221–254. MR 177846
- A. A. Evdokimov, Strongly asymmetric sequences generated by a finite number of symbols. , Dokl. Akad. Nauk SSSR 179 (1968), 1268–1271 (Russian). MR 0234842
Additional Information
- © Copyright 1971 American Mathematical Society
- Journal: Math. Comp. 25 (1971), 155-162
- MSC: Primary 05B30
- DOI: https://doi.org/10.1090/S0025-5718-1971-0291113-6
- MathSciNet review: 0291113