论文信息 - Growing perfect cubes

Growing perfect cubes

An (n,a,b)-perfect double cube is a bxbxb sized n-ary periodic array containing all possible axaxa sized n-ary array exactly once as subarray. A growing cube is an array whose c"jxc"jxc"j sized prefix is an (n"j,a,c"j)-perfect double cube for j=1,2,..., where c"j=n"j^v^/^3,v=a^3 and n"1

Antal Iványi | Márk Horváth | A. Iványi | Márk Horváth

[1] David Thomas,et al. The Art in Computer Programming , 2001 .

[2] Kenneth G. Paterson. Perfect maps , 1994, IEEE Trans. Inf. Theory.

[3] S. Chowla. On a problem of arrangements , 1939 .

[4] Glenn H. Hurlbert,et al. On the de Bruijn Torus Problem , 1993, J. Comb. Theory, Ser. A.

[5] S. Sanders,et al. Solution of Problem , 1929 .

[6] Fan Chung Graham,et al. Universal cycles for combinatorial structures , 1992, Discret. Math..

[7] Donald E. Knuth,et al. The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .

[8] Kenneth G. Paterson,et al. New Classes of Perfect Maps I , 1996, J. Comb. Theory, Ser. A.

[9] de Ng Dick Bruijn. A combinatorial problem , 1946 .

[10] John C. Cock. Toroidal tilings from de Bruijn-Good cyclic sequences , 1988, Discret. Math..

[11] Kenneth G. Paterson,et al. On the Existence of de Bruijn Tori with Two by Two Windows , 1996, J. Comb. Theory, Ser. A.

[12] Glenn H. Hurlbert,et al. A MESHING TECHNIQUE FOR de BRUIJN TORI , 1994 .

[13] I. Good. Normal Recurring Decimals , 1946 .

[14] L. Lovász. Combinatorial problems and exercises , 1979 .