Sergei V. Avgustinovich

From MaRDI portal
Person:1385208

Available identifiers

zbMath Open avgustinovich.sergei-vladimirovichMaRDI QIDQ1385208

List of research outcomes

PublicationDate of PublicationType
Singleton mesh patterns in multidimensional permutations2023-11-29Paper
On five types of crucial permutations with respect to monotone patterns2023-03-21Paper
On perfect colorings of paths divisible by a matching2023-02-21Paper
Maximum intersection of linear codes and codes equivalent to linear2022-07-15Paper
On perfect colorings of infinite multipath graphs2021-02-09Paper
Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs2020-09-30Paper
On abelian saturated infinite words2019-10-07Paper
On automorphisms of linear codes over a prime field2017-09-11Paper
Completely regular codes in the infinite hexagonal grid2017-09-06Paper
Perfect colorings of the prism graph2017-09-06Paper
Multiplicities of eigenvalues of the star graph2017-09-06Paper
Minimal complexity of equidistributed infinite permutations2017-08-31Paper
Weak abelian periodicity of infinite words2017-01-18Paper
https://portal.mardi4nfdi.de/entity/Q28193952016-09-29Paper
On antipodal properties for eigenfunctions of graphs2016-07-28Paper
On vectors of minimal support in transitive linear spaces2016-07-28Paper
https://portal.mardi4nfdi.de/entity/Q28144702016-06-22Paper
Gray coding cubic planar maps2016-01-21Paper
In memory of Dmitriĭ Germanovich Fon-Der-Flaass2015-11-16Paper
Induced perfect colorings2015-11-16Paper
Crucial and bicrucial permutations with respect to arithmetic monotone patterns2015-11-16Paper
Minimal complexity of equidistributed infinite permutations2015-11-10Paper
Canonical Representatives of Morphic Permutations2015-11-04Paper
Computation complexity of a ternary linear function2015-07-17Paper
Weak abelian periodicity of infinite words2013-06-14Paper
Avoidance of boxed mesh patterns on permutations2012-11-22Paper
On abelian versions of critical factorization theorem2012-08-31Paper
https://portal.mardi4nfdi.de/entity/Q31152112012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152532012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31152622012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31156862012-02-10Paper
https://portal.mardi4nfdi.de/entity/Q31157022012-02-10Paper
Embedding in a perfect code2010-07-13Paper
On shortest crucial words avoiding abelian powers2010-05-05Paper
On the Number of $1$-Perfect Binary Codes: A Lower Bound2009-02-24Paper
Testing Sets for 1-Perfect Code2009-01-22Paper
https://portal.mardi4nfdi.de/entity/Q35455812008-12-11Paper
Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)2008-11-25Paper
On partitions of an \(n\)-cube into nonequivalent perfect codes2008-09-02Paper
On uniquely \(k\)-determined permutations2008-03-13Paper
On periodicity of two-dimensional words2008-03-05Paper
Testing sets for 1-perfect codes2007-05-29Paper
Canonical Decomposition of a Regular Factorial Language2007-05-02Paper
Sequences of low arithmetical complexity2007-02-20Paper
https://portal.mardi4nfdi.de/entity/Q54883722006-09-14Paper
On intersection problem for perfect binary codes2006-05-29Paper
On the ranks and kernels problem for perfect codes2005-09-14Paper
On the structure of symmetry groups of Vasil'ev codes2005-09-08Paper
To the metrical rigidity of binary codes2005-08-17Paper
A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES2005-06-07Paper
https://portal.mardi4nfdi.de/entity/Q46754842005-05-04Paper
https://portal.mardi4nfdi.de/entity/Q46646492005-04-08Paper
The classification of some perfect codes2004-08-19Paper
https://portal.mardi4nfdi.de/entity/Q31485062002-10-06Paper
https://portal.mardi4nfdi.de/entity/Q31485182002-10-06Paper
https://portal.mardi4nfdi.de/entity/Q31502462002-09-30Paper
Intersection matrices for partitions by binary perfect codes2002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q43306262002-05-14Paper
Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances2002-01-30Paper
Cartesian products of graphs and metric spaces2001-12-30Paper
https://portal.mardi4nfdi.de/entity/Q27414392001-10-15Paper
On distance regularity of perfect binary codes2000-11-26Paper
https://portal.mardi4nfdi.de/entity/Q45009722000-09-03Paper
https://portal.mardi4nfdi.de/entity/Q45010192000-09-03Paper
https://portal.mardi4nfdi.de/entity/Q38386651999-11-01Paper
https://portal.mardi4nfdi.de/entity/Q42422091999-05-10Paper
Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components1998-11-20Paper
https://portal.mardi4nfdi.de/entity/Q38386641998-11-05Paper
On nonsystematic perfect binary codes.1998-08-19Paper
On the extendability of code isometries1998-06-22Paper
https://portal.mardi4nfdi.de/entity/Q48889281997-02-17Paper
https://portal.mardi4nfdi.de/entity/Q48663431996-09-23Paper
On isometry of close-packed binary codes1996-08-20Paper
https://portal.mardi4nfdi.de/entity/Q48528521996-03-17Paper
https://portal.mardi4nfdi.de/entity/Q33643771995-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33645251995-01-01Paper
Vector summation within minimal angle1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q33121571983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39282441980-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Sergei V. Avgustinovich