Person:1385208

Available identifiers

zbMath Open avgustinovich.sergei-vladimirovichMaRDI QIDQ1385208

List of research outcomes

Publication	Date of Publication	Type
Singleton mesh patterns in multidimensional permutations	2023-11-29	Paper
On five types of crucial permutations with respect to monotone patterns	2023-03-21	Paper
On perfect colorings of paths divisible by a matching	2023-02-21	Paper
Maximum intersection of linear codes and codes equivalent to linear	2022-07-15	Paper
On five types of crucial permutations with respect to monotone patterns	2022-06-24	Paper
On perfect colorings of infinite multipath graphs	2021-02-09	Paper
Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs	2020-09-30	Paper
On abelian saturated infinite words	2019-10-07	Paper
On automorphisms of linear codes over a prime field	2017-09-11	Paper
Completely regular codes in the infinite hexagonal grid	2017-09-06	Paper
Perfect colorings of the prism graph	2017-09-06	Paper
Multiplicities of eigenvalues of the star graph	2017-09-06	Paper
Minimal complexity of equidistributed infinite permutations	2017-08-31	Paper
Weak abelian periodicity of infinite words	2017-01-18	Paper
https://portal.mardi4nfdi.de/entity/Q2819395	2016-09-29	Paper
On antipodal properties for eigenfunctions of graphs	2016-07-28	Paper
On vectors of minimal support in transitive linear spaces	2016-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q2814470	2016-06-22	Paper
Gray coding cubic planar maps	2016-01-21	Paper
In memory of Dmitriĭ Germanovich Fon-Der-Flaass	2015-11-16	Paper
Induced perfect colorings	2015-11-16	Paper
Crucial and bicrucial permutations with respect to arithmetic monotone patterns	2015-11-16	Paper
Minimal complexity of equidistributed infinite permutations	2015-11-10	Paper
Canonical Representatives of Morphic Permutations	2015-11-04	Paper
Computation complexity of a ternary linear function	2015-07-17	Paper
Distance Regular Colorings of $n$-Dimensional Rectangular Grid	2014-12-24	Paper
Weak abelian periodicity of infinite words	2013-06-14	Paper
Avoidance of boxed mesh patterns on permutations	2012-11-22	Paper
On abelian versions of critical factorization theorem	2012-08-31	Paper
https://portal.mardi4nfdi.de/entity/Q3115211	2012-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q3115253	2012-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q3115262	2012-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q3115686	2012-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q3115702	2012-02-10	Paper
Embedding in a perfect code	2010-07-13	Paper
On shortest crucial words avoiding abelian powers	2010-05-05	Paper
On the Number of $1$-Perfect Binary Codes: A Lower Bound	2009-02-24	Paper
Testing Sets for 1-Perfect Code	2009-01-22	Paper
https://portal.mardi4nfdi.de/entity/Q3545581	2008-12-11	Paper
Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)	2008-11-25	Paper
On partitions of an \(n\)-cube into nonequivalent perfect codes	2008-09-02	Paper
On uniquely \(k\)-determined permutations	2008-03-13	Paper
On periodicity of two-dimensional words	2008-03-05	Paper
Testing sets for 1-perfect codes	2007-05-29	Paper
Canonical Decomposition of a Regular Factorial Language	2007-05-02	Paper
Sequences of low arithmetical complexity	2007-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q5488372	2006-09-14	Paper
On intersection problem for perfect binary codes	2006-05-29	Paper
On the ranks and kernels problem for perfect codes	2005-09-14	Paper
On the structure of symmetry groups of Vasil'ev codes	2005-09-08	Paper
To the metrical rigidity of binary codes	2005-08-17	Paper
A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES	2005-06-07	Paper
https://portal.mardi4nfdi.de/entity/Q4675484	2005-05-04	Paper
https://portal.mardi4nfdi.de/entity/Q4664649	2005-04-08	Paper
The classification of some perfect codes	2004-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q3148506	2002-10-06	Paper
https://portal.mardi4nfdi.de/entity/Q3148518	2002-10-06	Paper
https://portal.mardi4nfdi.de/entity/Q3150246	2002-09-30	Paper
Intersection matrices for partitions by binary perfect codes	2002-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4330626	2002-05-14	Paper
Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances	2002-01-30	Paper
Cartesian products of graphs and metric spaces	2001-12-30	Paper
https://portal.mardi4nfdi.de/entity/Q2741439	2001-10-15	Paper
On distance regularity of perfect binary codes	2000-11-26	Paper
https://portal.mardi4nfdi.de/entity/Q4500972	2000-09-03	Paper
https://portal.mardi4nfdi.de/entity/Q4501019	2000-09-03	Paper
https://portal.mardi4nfdi.de/entity/Q3838665	1999-11-01	Paper
https://portal.mardi4nfdi.de/entity/Q4242209	1999-05-10	Paper
Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components	1998-11-20	Paper
https://portal.mardi4nfdi.de/entity/Q3838664	1998-11-05	Paper
On nonsystematic perfect binary codes.	1998-08-19	Paper
On the extendability of code isometries	1998-06-22	Paper
https://portal.mardi4nfdi.de/entity/Q4888928	1997-02-17	Paper
https://portal.mardi4nfdi.de/entity/Q4866343	1996-09-23	Paper
On isometry of close-packed binary codes	1996-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q4852852	1996-03-17	Paper
https://portal.mardi4nfdi.de/entity/Q3364377	1995-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3364525	1995-01-01	Paper
Vector summation within minimal angle	1993-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q3312157	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3928244	1980-01-01	Paper
Combinatorial designs, difference sets and bent functions as perfect colorings of graphs and multigraphs	0001-01-03	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Sergei V. Avgustinovich