On a combinatorics problem

Abstract

We present a problem in arrangements, which was solved in 1934 by M. H. Martin in a constructive way, namely to obtain a sequence of n symbols so that each of the \(n^{t}\) arrangements with repetition of r symbols appears exactly once as a subsequence of length r. We then mention some of the achievements of Martin in his 100 years life, as the foundation of an institute of applied mathematics, the revitalization of a hystorical house and the prizes established for young students and researchers.

Authors

Mira-Cristiana Anisiu
Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy

Keywords

Arrangements; Martin algorithm.

Paper coordinates

M.-C. Anisiu, Asupra unei probleme de combinatorică, Didactica Mathematica 35 (2017), 1-8 (pdf file here)

PDF

About this paper

Journal

Didactica Matematica

Publisher Name
DOI
Print ISSN

2247-5060

Online ISSN

google scholar link

[1] T. van Aardenne-Ehrenfest, N. G. de Bruijn, Circuits and trees in oriented linear graphs, Simon Stevin 28 (1951), 203–217
[2] A. M. Alhakim, A simple combinatorial algorithm for de Bruijn sequences, American Mathematical Monthly, 117 (8) (2010), 728-732
[3] J. Berstel, D. Perrin, The origins of the combinatorics of words, European J. Combin. 28 (2007), 996–1022
[4] N. G. de Bruijn, A combinatorial problem, Nederl. Akad. Wetensch. Proc. 49 (1946) 758–764 = Indag. Math. 8 (1946), 461–467
[5] C. Flye Sainte-Marie, Solution to question nr. 48, l’Interm´ediaire des Math´ematiciens, 1 (1894), 107–110
[6] L. R. Ford, Jr., A cyclic arrangement of M-tuples, Report No. P-1071, Rand Corporation, Santa Monica, California, April 23, 1957
[7] A. Lempel, On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers, Computers, IEEE Transactions on,100 (12) (1970),
1204-1209
[8] E. N Lorenz, Deterministic nonperiodic flow, J. Atmos. Sci. 20 (1963), 130-141
[9] M. H. Martin, A problem in arrangements, Bull. Amer. Math. Soc. 40 (1934), 859-864
[10] A. Rubin, G. Weiss, Mapping prefer-opposite to prefer-one de Bruijn sequences, Designs, Codes and Cryptography (2016), 1-9
[11] J. Yorke, Monroe H. Martin, 1907–2007, Notices AMS 54 (10), 1348
[12] http://www.ipst.umd.edu/aboutus/files/meteorology and ipst.pdf
[13] http://www.mathematics.jhu.edu/new/resources/martin.htm
[14] http://www.ipst.umd.edu/awards/
[15] https://www.newspapers.com/newspage/116116400/
[16] https://www.newspapers.com/newspage/115814617/

2017

Related Posts