Strongly asymmetric sequences generated by four elements
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.
Erdös, "Some unsolved problems," Magyar Tud. Akad. Mat. Kutató Int. Közl., v. 6, 1961, pp. 221-254; Russian transl., Matematika, v. 7, 1963, no. 4, p. 128. MR 31 #2106.
A. A. Evdokimov, "Strongly asymmetric sequences generated by a finite number of symbols," Dokl. Akad. Nauk SSSR, v. 179, 1968, pp. 1268-1271 = Soviet Math. Dokl., v. 9, 1968, pp. 536-539. MR 38 #3156.
Retrieve articles in Mathematics of Computation with MSC: 05B30
Retrieve articles in all journals with MSC: 05B30