Zobrazeno 1 - 10
of 334
pro vyhledávání: '"Scheepers, M."'
A special sorting operation called Context Directed Swap, and denoted \textbf{cds}, performs certain types of block interchanges on permutations. When a permutation is sortable by \textbf{cds}, then \textbf{cds} sorts it using the fewest possible blo
Externí odkaz:
http://arxiv.org/abs/2011.00706
The study of sorting permutations by block interchanges has recently been stimulated by a phenomenon observed in the genome maintenance of certain ciliate species. The result was the identification of a block interchange operation that applies only u
Externí odkaz:
http://arxiv.org/abs/1904.03287
Autor:
Watkins, L.V., Henley, W., Sun, J.J., Perera, B., Angus-Leppan, H., Sawhney, I., Purandare, K., Eyeoyibo, M., Scheepers, M., Lines, G., Winterhalder, R., Shankar, R.
Publikováno v:
In Seizure: European Journal of Epilepsy October 2022 101:15-21
Publikováno v:
Proceedings of the National Academy of Sciences of the United States of America, 2020 Sep . 117(37), 22690-22697.
Externí odkaz:
https://www.jstor.org/stable/26969194
Prior studies of the efficiency of the block interchange (swap) and the reversal sorting operations on (signed) permutations identified specialized versions of the these operations. These specialized operations are here called context directed revers
Externí odkaz:
http://arxiv.org/abs/1603.06149
Autor:
Kinney, M.O., Chester, V., Tromans, S., Alexander, R.T, Angus-Leppan, H., Bagary, M., Cock, H., Devapriam, J., Hassiotis, A., Mula, M., Reuber, M., Ring, H., Roy, A., Scheepers, M., Shankar, R. *
Publikováno v:
In Seizure: European Journal of Epilepsy October 2020 81:111-116
We introduce a game on graphs. By a theorem of Zermelo, each instance of the game on a finite graph is determined. While the general decision problem on which player has a winning strategy in a given instance of the game is unsolved, we solve the dec
Externí odkaz:
http://arxiv.org/abs/1411.5429
Autor:
Adamyk, K. L. M., Holmes, E., Mayfield, G. R., Moritz, D. J., Scheepers, M., Tenner, B. E., Wauck, H. C.
Permutation sorting, one of the fundamental steps in pre-processing data for the efficient application of other algorithms, has a long history in mathematical research literature and has numerous applications. Two special-purpose sorting operations a
Externí odkaz:
http://arxiv.org/abs/1410.2353
No convenient internal characterization of spaces that are productively Lindelof is known. Perhaps the best general result known is Alster's internal characterization, under the Continuum Hypothesis, of productively Lindelof spaces which have a basis
Externí odkaz:
http://arxiv.org/abs/1212.6122
Publikováno v:
In Topology and its Applications 15 May 2019 258:268-281