Speciality: 01.01.01 (Real analysis, complex analysis, and functional analysis)
E-mail:
Website: https://math.nsc.ru/~potapov
Keywords: boolean cube; matching; Hamiltonian cycles; Latin squares; $n$-quasigroups; perfect codes; perfect coloring, source coding; data retrieval; hash-functions; combinatorics on words; genetic sequences; entropy and widths; wavelets.

Main publications:

1. V. N. Potapov, “On the number of SQSs, latin hypercubes and MDS codes”, Journal of Combinatorial Designs, 26:5 (2018), 237–248          
2. D. S. Krotov, V. N. Potapov, “Propelinear 1-perfect codes from quadratic functions”, IEEE Trans. Inform. Theory, 60:4 (2014), 2065–2068            
3. V. N. Potapov, Vvedenie v teoriyu informatsii, NITs “Regulyarnaya i khaoticheskaya dinamika”, Izhevsk, 2014 , 152 pp.
4. V. N. Potapov, “Clique matchings in the $k$-ary $n$-dimensional cube”, Siberian Math. J., 52:2 (2011), 303–310                  
5. D. S. Krotov, V. N. Potapov, “n-Ary quasigroups of order 4”, SIAM J. Discrete Math., 23:2 (2009), 561–570            

Recent publications

Presentations in Math-Net.Ru

Personal pages:

• 
• 
• 
• 
• 
• 
• 
• 
• 

Organisations:

• Novosibirsk State University, Mechanics and Mathematics Department
• Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk