The following pages link to Sergei V. Avgustinovich (Q1385208):
Displaying 50 items.
- (Q226453) (redirect page) (← links)
- (Q1587904) (redirect page) (← links)
- (Q504986) (redirect page) (← links)
- Weak abelian periodicity of infinite words (Q504987) (← links)
- In memory of Dmitriĭ Germanovich Fon-Der-Flaass (Q890843) (← links)
- Induced perfect colorings (Q890883) (← links)
- Crucial and bicrucial permutations with respect to arithmetic monotone patterns (Q890954) (← links)
- Gray coding cubic planar maps (Q906395) (← links)
- On partitions of an \(n\)-cube into nonequivalent perfect codes (Q941881) (← links)
- On shortest crucial words avoiding abelian powers (Q968182) (← links)
- On nonsystematic perfect binary codes. (Q1130122) (← links)
- Construction of perfect binary codes by sequential shifts of \(\tilde\alpha\)-components (Q1271418) (← links)
- On distance regularity of perfect binary codes (Q1282495) (← links)
- On the extendability of code isometries (Q1385209) (← links)
- Cartesian products of graphs and metric spaces (Q1587905) (← links)
- Avoidance of boxed mesh patterns on permutations (Q1759862) (← links)
- Vector summation within minimal angle (Q1803266) (← links)
- The classification of some perfect codes (Q1878299) (← links)
- On isometry of close-packed binary codes (Q1920134) (← links)
- Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs (Q2202769) (← links)
- On perfect colorings of infinite multipath graphs (Q2227017) (← links)
- On abelian saturated infinite words (Q2326392) (← links)
- On the structure of symmetry groups of Vasil'ev codes (Q2388212) (← links)
- On the ranks and kernels problem for perfect codes (Q2388457) (← links)
- Minimal complexity of equidistributed infinite permutations (Q2400969) (← links)
- Completely regular codes in the infinite hexagonal grid (Q2402205) (← links)
- Perfect colorings of the prism graph (Q2402206) (← links)
- Multiplicities of eigenvalues of the star graph (Q2402207) (← links)
- On automorphisms of linear codes over a prime field (Q2403676) (← links)
- On periodicity of two-dimensional words (Q2474236) (← links)
- On uniquely \(k\)-determined permutations (Q2477375) (← links)
- To the metrical rigidity of binary codes (Q2487088) (← links)
- On intersection problem for perfect binary codes (Q2491309) (← links)
- On antipodal properties for eigenfunctions of graphs (Q2630613) (← links)
- On vectors of minimal support in transitive linear spaces (Q2630614) (← links)
- On five types of crucial permutations with respect to monotone patterns (Q2692179) (← links)
- (Q2741439) (← links)
- (Q2814470) (← links)
- (Q2819395) (← links)
- On abelian versions of critical factorization theorem (Q2911422) (← links)
- (Q3115211) (← links)
- (Q3115253) (← links)
- (Q3115262) (← links)
- (Q3115686) (← links)
- (Q3115702) (← links)
- (Q3148506) (← links)
- (Q3148518) (← links)
- (Q3150246) (← links)
- (Q3312157) (← links)
- (Q3364377) (← links)
- (Q3364525) (← links)
