Singleton mesh patterns in multidimensional permutations.

Sergey V. Avgustinovich

Sergey V. Avgustinovich Sergey Kitaev Jeffrey Liese Vladimir N. Potapov Anna A. Taranenko Singleton mesh patterns in multidimensional permutations. 105801 2024 January 201 J. Comb. Theory A https://doi.org/10.1016/j.jcta.2023.105801 db/journals/jcta/jcta201.html#AvgustinovichKLPT24

Sergey V. Avgustinovich Sergey Kitaev Anna A. Taranenko On Five Types of Crucial Permutations with Respect to Monotone Patterns. 2023 30 Electron. J. Comb. 1 https://doi.org/10.37236/11500 db/journals/combinatorics/combinatorics30.html#AvgustinovichKT23

Sergey V. Avgustinovich Julien Cassaigne Juhani Karhumäki Svetlana Puzynina Aleksi Saarela On abelian saturated infinite words. 154-160 2019 792 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2018.05.013 https://www.wikidata.org/entity/Q129785482 db/journals/tcs/tcs792.html#AvgustinovichCK19

Sergey V. Avgustinovich Anna E. Frid Svetlana Puzynina Minimal complexity of equidistributed infinite permutations. 24-36 2017 65 Eur. J. Comb. https://doi.org/10.1016/j.ejc.2017.05.003 db/journals/ejc/ejc65.html#AvgustinovichFP17

Sergey V. Avgustinovich Svetlana Puzynina Weak Abelian Periodicity of Infinite Words. 161-179 2016 59 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-015-9629-1 db/journals/mst/mst59.html#AvgustinovichP16

Sergey V. Avgustinovich Sergey Kitaev Vladimir N. Potapov Vincent Vajnovszki Gray coding cubic planar maps. 59-69 2016 616 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.12.013 db/journals/tcs/tcs616.html#AvgustinovichKP16

Sergey V. Avgustinovich Anna E. Frid Svetlana Puzynina Canonical Representatives of Morphic Permutations. 59-72 2015 WORDS https://doi.org/10.1007/978-3-319-23660-5_6 conf/cwords/2015 db/conf/cwords/words2015.html#AvgustinovichFP15 Sergey V. Avgustinovich Anna E. Frid Svetlana Puzynina Ergodic Infinite Permutations of Minimal Complexity. 71-84 2015 DLT https://doi.org/10.1007/978-3-319-21500-6_5 conf/dlt/2015 db/conf/dlt/dlt2015.html#AvgustinovichFP15

Sergey V. Avgustinovich Anna E. Frid Svetlana Puzynina Ergodic infinite permutations of minimal complexity. 2015 abs/1503.06188 CoRR http://arxiv.org/abs/1503.06188 db/journals/corr/corr1503.html#AvgustinovichFP15

Sergey V. Avgustinovich Sergey Kitaev Vladimir N. Potapov Vincent Vajnovszki Gray coding planar maps. 2015 abs/1509.05807 CoRR http://arxiv.org/abs/1509.05807 db/journals/corr/corr1509.html#AvgustinovichKP15

Sergey V. Avgustinovich Anna E. Frid Svetlana Puzynina Canonical Representatives of Morphic Permutations. 2015 abs/1510.08371 CoRR http://arxiv.org/abs/1510.08371 db/journals/corr/corr1510.html#AvgustinovichFP15a

Sergey V. Avgustinovich Sergey Kitaev Alexandr Valyuzhenich Avoidance of boxed mesh patterns on permutations. 43-51 2013 161 Discret. Appl. Math. 1-2 https://doi.org/10.1016/j.dam.2012.08.015 db/journals/dam/dam161.html#AvgustinovichKV13

Sergey V. Avgustinovich Svetlana Puzynina Weak Abelian Periodicity of Infinite Words. 258-270 2013 CSR https://doi.org/10.1007/978-3-642-38536-0_23 conf/csr/2013 db/conf/csr/csr2013.html#AvgustinovichP13

Sergey V. Avgustinovich Svetlana Puzynina Weak abelian periodicity of infinite words http://arxiv.org/abs/1302.4359 2013 CoRR abs/1302.4359 db/journals/corr/corr1302.html#abs-1302-4359

Sergey V. Avgustinovich Juhani Karhumäki Svetlana Puzynina On abelian versions of critical factorization theorem. 3-15 2012 46 RAIRO Theor. Informatics Appl. 1 https://doi.org/10.1051/ita/2011121 db/journals/ita/ita46.html#AvgustinovichKP12

Sergey V. Avgustinovich Sergey Kitaev Artem V. Pyatkin Alexandr Valyuzhenich On Square-Free Permutations. 3-10 2011 16 J. Autom. Lang. Comb. 1 db/journals/jalc/jalc16.html#AvgustinovichKPV11 https://doi.org/10.25596/jalc-2011-003

Sergey V. Avgustinovich Anna E. Frid Teturo Kamae Pavel Salimov Infinite permutations of lowest maximal pattern complexity. 2911-2921 2011 412 Theor. Comput. Sci. 27 https://doi.org/10.1016/j.tcs.2010.12.062 db/journals/tcs/tcs412.html#AvgustinovichFKS11

Sergey V. Avgustinovich Amy Glen Bjarni V. Halldórsson Sergey Kitaev On shortest crucial words avoiding abelian powers. 605-607 2010 158 Discret. Appl. Math. 6 https://doi.org/10.1016/j.dam.2009.11.010 db/journals/dam/dam158.html#AvgustinovichGHK10

Sergey V. Avgustinovich Sergey Kitaev On uniquely k-determined permutations. 1500-1507 2008 308 Discret. Math. 9 https://doi.org/10.1016/j.disc.2007.03.079 db/journals/dm/dm308.html#AvgustinovichK08

S. A. Puzynina Sergey V. Avgustinovich On periodicity of two-dimensional words. 178-187 2008 391 Theor. Comput. Sci. 1-2 https://doi.org/10.1016/j.tcs.2007.10.038 db/journals/tcs/tcs391.html#PuzyninaA08

Denis S. Krotov Sergey V. Avgustinovich On the Number of 1-Perfect Binary Codes: A Lower Bound. 1760-1765 2008 54 IEEE Trans. Inf. Theory 4 https://doi.org/10.1109/TIT.2008.917692 db/journals/tit/tit54.html#KrotovA08

Sergey V. Avgustinovich Ivan Yu. Mogilnykh Perfect 2-Colorings of Johnson Graphs J(6, 3) and J(7, 3). 11-19 2008 ICMCTA https://doi.org/10.1007/978-3-540-87448-5_2 conf/icmcta/2008 db/conf/icmcta/icmcta2008.html#AvgustinovichM08

Yuriy Vasil'ev Sergey V. Avgustinovich Denis S. Krotov On mobile sets in the binary hypercube http://arxiv.org/abs/0802.0003 2008 CoRR abs/0802.0003 db/journals/corr/corr0802.html#abs-0802-0003

Sergey V. Avgustinovich Denis S. Krotov Embedding in a perfect code http://arxiv.org/abs/0804.0006 2008 CoRR abs/0804.0006 db/journals/corr/corr0804.html#abs-0804-0006

Sergey V. Avgustinovich Faina I. Solov'eva Olof Heden On partitions of an <i>n</i>-cube into nonequivalent perfect codes. 310-315 2007 43 Probl. Inf. Transm. 4 https://doi.org/10.1134/S0032946007040047 db/journals/poit/poit43.html#AvgustinovichSH07

Sergey V. Avgustinovich Olof Heden Faina I. Solov'eva On Intersection Problem for Perfect Binary Codes. 317-322 2006 39 Des. Codes Cryptogr. 3 https://doi.org/10.1007/s10623-005-4982-8 db/journals/dcc/dcc39.html#AvgustinovichHS06

Sergey V. Avgustinovich Julien Cassaigne Anna E. Frid Sequences of low arithmetical complexity. 569-582 2006 40 RAIRO Theor. Informatics Appl. 4 https://doi.org/10.1051/ita:2006041 db/journals/ita/ita40.html#AvgustinovichCF06

Sergey V. Avgustinovich Anna E. Frid Canonical Decomposition of a Regular Factorial Language. 18-22 2006 conf/csr/2006 CSR https://doi.org/10.1007/11753728_5 db/conf/csr/csr2006.html#AvgustinovichF06 Sergey V. Avgustinovich Anastasia Yu. Vasil'eva Testing Sets for 1-Perfect Code. 938-940 2006 conf/gtitc/2006 GTIT-C https://doi.org/10.1007/11889342_59 db/conf/gtitc/gtitc2006.html#AvgustinovichV06

Sergey V. Avgustinovich Anastasia Yu. Vasil'eva Testing sets for 1-perfect codes. 233-236 2005 21 Electron. Notes Discret. Math. https://doi.org/10.1016/j.endm.2005.07.032 db/journals/endm/endm21.html#AvgustinovichV05

Sergey V. Avgustinovich Anna E. Frid A Unique Decomposition Theorem for Factorial Languages. 149-160 2005 15 Int. J. Algebra Comput. 1 https://doi.org/10.1142/S0218196705002116 db/journals/ijac/ijac15.html#AvgustinovichF05

Sergey V. Avgustinovich Faina I. Solov'eva Olof Heden On the Structure of Symmetry Groups of Vasil'ev Codes. 105-112 2005 41 Probl. Inf. Transm. 2 https://doi.org/10.1007/s11122-005-0015-5 db/journals/poit/poit41.html#AvgustinovichSH05

Sergey V. Avgustinovich Olof Heden Faina I. Solov'eva The Classification of Some Perfect Codes. 313-318 2004 31 Des. Codes Cryptogr. 3 https://doi.org/10.1023/B:DESI.0000015891.01562.c1 db/journals/dcc/dcc31.html#AvgustinovichHS04

Sergey V. Avgustinovich Faina I. Solov'eva To the Metrical Rigidity of Binary Codes. 178-183 2003 39 Probl. Inf. Transm. 2 https://doi.org/10.1023/A%3A1025148221096 db/journals/poit/poit39.html#AvgustinovichS03

Sergey V. Avgustinovich Faina I. Solov'eva Olof Heden On the Ranks and Kernels Problem for Perfect Codes. 341-345 2003 39 Probl. Inf. Transm. 4 https://doi.org/10.1023/B%3APRIT.0000011272.10614.8c db/journals/poit/poit39.html#AvgustinovichSH03

Sergey V. Avgustinovich Anna E. Frid Words Avoiding Abelian Inclusions. 3-9 2002 7 J. Autom. Lang. Comb. 1 db/journals/jalc/jalc7.html#AvgustinovichF02 https://doi.org/10.25596/jalc-2002-003

Sergey V. Avgustinovich Perfect binary (n, 3) codes: the structure of graphs of minimum distances. 9-11 2001 114 Discret. Appl. Math. 1-3 db/journals/dam/dam114.html#Avgustinovich01 https://doi.org/10.1016/S0166-218X(00)00356-5

Sergey V. Avgustinovich Faina I. Solov'eva On the metrical rigidity of binary codes. 444-451 2001 6 Electron. Notes Discret. Math. https://doi.org/10.1016/S1571-0653(04)00196-9 db/journals/endm/endm6.html#AvgustinovichS01

Sergey V. Avgustinovich Antoine Lobstein Faina I. Solov'eva Intersection matrices for partitions by binary perfect codes. 1621-1624 2001 47 IEEE Trans. Inf. Theory 4 db/journals/tit/tit47.html#AvgustinovichLS01 https://doi.org/10.1109/18.923749

Sergey V. Avgustinovich Dmitry Fon-Der-Flaass Cartesian Products of Graphs and Metric Spaces. 847-851 2000 21 Eur. J. Comb. 7 https://doi.org/10.1006/eujc.2000.0401 db/journals/ejc/ejc21.html#AvgustinovichF00

Sergey V. Avgustinovich Dmitry Fon-Der-Flaass Anna E. Frid Arithmetical Complexity of Infinite Words. 51-62 2000 Words, Languages & Combinatorics conf/dlt/2000 db/conf/dlt/wlc2000.html#AvgustinovichFF00 Anna E. Frid Sergey V. Avgustinovich On Bispecial Words and Subword Complexity of DOL Sequences. 191-204 1998 SETA https://doi.org/10.1007/978-1-4471-0551-0_13 conf/seta/1998 db/conf/seta/seta1998.html#FridA98

Sergey V. Avgustinovich Sergey Vasil'evich Sevast'janov Vector Summation within Minimal Angle. 235-239 1992 2 Comput. Geom. db/journals/comgeo/comgeo2.html#AvgustinovichS92 https://doi.org/10.1016/0925-7721(93)90020-7

Julien Cassaigne Dmitry Fon-Der-Flaass Anna E. Frid Amy Glen Bjarni V. Halldórsson Olof Heden Teturo Kamae Juhani Karhumäki Sergey Kitaev Denis S. Krotov Jeffrey Liese Antoine Lobstein Ivan Yu. Mogilnykh Vladimir N. Potapov Svetlana PuzyninaS. A. Puzynina Artem V. Pyatkin Aleksi Saarela Pavel Salimov Sergey SevastyanovSergey Vasil'evich Sevast'janov Faina I. Solov'eva Anna A. Taranenko Vincent Vajnovszki Alexandr Valyuzhenich Yuriy Vasil'ev Anastasia Yu. Vasil'eva