Ponomarenko Ilia Nikolaevich

Publications in Math-Net.Ru

1. On the Weisfeiler–Leman dimension of circulant graphs
   
   Algebra i Analiz, 37:2 (2025),  1–27
2. On a Family of Multivalued Groups
   
   Trudy Mat. Inst. Steklova, 326 (2024),  311–313
3. The closures of wreath products in product action
   
   Algebra Logika, 60:3 (2021),  286–297
4. On the separability of cyclotomic schemes over finite fields
   
   Algebra i Analiz, 32:6 (2020),  124–146
5. On schurian fusions of the association scheme of a Galois affine plane of prime order
   
   Zap. Nauchn. Sem. POMI, 478 (2019),  5–16
6. Abelian Schur groups of odd order
   
   Sib. Èlektron. Mat. Izv., 15 (2018),  397–411
7. A family of permutation groups with exponentially many nonconjugated regular elementary Abelian subgroups
   
   Algebra i Analiz, 29:4 (2017),  45–52
8. Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time
   
   Zap. Nauchn. Sem. POMI, 455 (2017),  154–180
9. On the separability problem for circulant S-rings
   
   Algebra i Analiz, 28:1 (2016),  32–51
10. The Schur–Wielandt theory for central $S$-rings
    
    Algebra Logika, 55:1 (2016),  58–74
11. On Schur $2$-groups
    
    Zap. Nauchn. Sem. POMI, 435 (2015),  113–162
12. Characterization of cyclic Schur groups
    
    Algebra i Analiz, 25:5 (2013),  61–85
13. Schurity of $\mathrm S$-rings over a cyclic group and generalized wreath product of permutation groups
    
    Algebra i Analiz, 24:3 (2012),  84–127
14. Bases of schurian antisymmetric coherent configurations and isomorphism test for schurian tournaments
    
    Zap. Nauchn. Sem. POMI, 402 (2012),  108–147
15. Schemes of relations of the finite projective plane, and their extensions
    
    Algebra i Analiz, 21:1 (2009),  90–132
16. Normal cyclotomic schemes over a finite commutative ring
    
    Algebra i Analiz, 19:6 (2007),  59–85
17. On the structure of $p$-schemes
    
    Zap. Nauchn. Sem. POMI, 344 (2007),  190–202
18. On amorphic $C$-algebras
    
    Zap. Nauchn. Sem. POMI, 340 (2006),  87–102
19. Finding the automorphism group of a circulant association scheme in polynomial time
    
    Zap. Nauchn. Sem. POMI, 321 (2005),  251–267
20. On the vertex connectivity of a relation in association scheme
    
    Zap. Nauchn. Sem. POMI, 316 (2004),  55–62
21. Polynomial time recognition and verification of isomorphism of circular graphs
    
    Algebra i Analiz, 15:6 (2003),  1–34
22. Characterization of cyclotomic schemes and normal Schur rings over a cyclic group
    
    Algebra i Analiz, 14:2 (2002),  11–55
23. On non-abelian homomorphic public-key cryptosystems
    
    Zap. Nauchn. Sem. POMI, 293 (2002),  39–58
24. Rings associated to finite projective planes and thier isomorphisms
    
    Zap. Nauchn. Sem. POMI, 289 (2002),  207–213
25. On a family of Shur rings over a finite cyclic group
    
    Algebra i Analiz, 13:3 (2001),  139–154
26. On primitive cellular algebras
    
    Zap. Nauchn. Sem. POMI, 256 (1999),  38–68
27. Algebras in Plancherel Duality and Algebraic Combinatorics
    
    Funktsional. Anal. i Prilozhen., 31:4 (1997),  34–46
28. Two inequalities for parameters of a cellular algebra
    
    Zap. Nauchn. Sem. POMI, 240 (1997),  82–95
29. $C$-algebras and algebras in Plancherel duality
    
    Zap. Nauchn. Sem. POMI, 240 (1997),  53–66
30. Combinatorial Algebras and Multivalued Involutive Groups
    
    Funktsional. Anal. i Prilozhen., 30:3 (1996),  12–18
31. Transitive groups with irreducible representations of bounded degree
    
    Zap. Nauchn. Sem. POMI, 223 (1995),  108–119
32. On estimate of the order of primitive permutation groups
    
    Zap. Nauchn. Sem. POMI, 215 (1994),  256–263
33. On computation complexity problems concerning relation algebras
    
    Zap. Nauchn. Sem. POMI, 202 (1992),  116–134
34. Polynomial-time recognizing and isomorphism testing for cyclic tournaments
    
    Zap. Nauchn. Sem. LOMI, 192 (1991),  74–111
35. The isomorphism problem for classes of graphs
    
    Dokl. Akad. Nauk SSSR, 304:3 (1989),  552–556
36. Isomorphism problem for classes of graphs closed under contractions
    
    Zap. Nauchn. Sem. LOMI, 174 (1988),  147–177
37. Polynomial isomorphism algorithm for graphs which are not contracted to $K_{3,g}$.
    
    Zap. Nauchn. Sem. LOMI, 137 (1984),  99–114