Ilia Ponomarenko
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Ilia Ponomarenko has a total of 66 co-authors. Here are the top co-authors by number of shared publications:
- Sergei Evdokimov
St. Petersburg Branch, Steklov Mathematical Institute, Russian Academy of Sciences, Fontanka 27, 191023 St. Petersburg, Russia
21 shared publications - Andrey V. Vasil'Ev
Sobolev Institute of Mathematics, Novosibirsk, Russia
16 shared publications - Mikhail Muzychuk
Netanya Academic College
10 shared publications Sergei Evdokimov
St. Petersburg Department of Steklov, Institute of Mathematics, St. Petersburg, Russia
10 shared publications- Grigory Ryabov
School of Mathematical Sciences, Hebei Key Laboratory of Computational Mathematics and Applications, Hebei Normal University, Shijiazhuang 050024, P. R. China
7 shared publications - Roman Nedela
University of West Bohemia
7 shared publications
Latest Publications
- 17 March 2026
- Published by Springer Nature in Algorithmica
- Vol. 88 (2) , 29
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable
- 17 March 2026
- Published by Springer Nature in Algorithmica
- Vol. 88 (2) , 29
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable
- Open Access
The automorphism groups and identification of some Generalized Paley Graphs
The family of generalized Paley graphs of prime power order $q$ and degree $(q-1)/k$ is studied. It is shown that the automorphism group of a graph in this family is a subgroup of ${\mathrm{AΓL}}(1,q)$ whenever $q$ is sufficiently large relative to $k$. Furthermore, under the same conditions, the Weisfeiler-Leman dimension of these graphs is proved to be at most $5$. In particular, the same bound holds for the Van Lint-Schrijver graphs.Open AccessThe automorphism groups and identification of some Generalized Paley Graphs
The family of generalized Paley graphs of prime power order $q$ and degree $(q-1)/k$ is studied. It is shown that the automorphism group of a graph in this family is a subgroup of ${\mathrm{AΓL}}(1,q)$ whenever $q$ is sufficiently large relative to $k$. Furthermore, under the same conditions, the Weisfeiler-Leman dimension of these graphs is proved to be at most $5$. In particular, the same bound holds for the Van Lint-Schrijver graphs. - Open Access
- 1 July 2025
- Published by World Scientific Pub Co Pte Ltd in Bulletin of Mathematical Sciences
- Vol. 15 (02)
Closures of permutation groups with restricted nonabelian composition factors
Given a permutation group G on a finite set [ ], let [ ] denote the k-closure of G, that is, the largest permutation group on [ ] having the same orbits in the induced action on [ ] as G. Recall that a group is [ ]-free if it does not contain a section isomorphic to the alternating group of degree d. Motivated by some problems in computational group theory, we prove that the k-closure of an [ ]-free group is again [ ]-free for [ ] and [ ].
- 1 July 2025
- Published by World Scientific Pub Co Pte Ltd in Bulletin of Mathematical Sciences
- Vol. 15 (02)
Open AccessClosures of permutation groups with restricted nonabelian composition factors
Given a permutation group G on a finite set [ ], let [ ] denote the k-closure of G, that is, the largest permutation group on [ ] having the same orbits in the induced action on [ ] as G. Recall that a group is [ ]-free if it does not contain a section isomorphic to the alternating group of degree d. Motivated by some problems in computational group theory, we prove that the k-closure of an [ ]-free group is again [ ]-free for [ ] and [ ].
- 11 June 2025
- Published by Springer Nature in Science China Mathematics
- Vol. 68 (8) , 1969-1978
On multivalued groups of order 3
- 11 June 2025
- Published by Springer Nature in Science China Mathematics
- Vol. 68 (8) , 1969-1978
On multivalued groups of order 3
- Open Access
- 7 April 2025
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 8 (2) , #P2.10
Isomorphism testing of k-spanning tournaments is fixed parameter tractable
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- 7 April 2025
- Published by University of Primorska Press in The Art of Discrete and Applied Mathematics
- Vol. 8 (2) , #P2.10
Open AccessIsomorphism testing of k-spanning tournaments is fixed parameter tractable
The Art of Discrete and Applied Mathematics (ADAM) is a modern, dynamic, platinum open access, electronic journal that will publish high-quality articles of arbitrary length in contemporary discrete and applied mathematics in which neither the authors nor the readers incur any costs.
- 24 March 2025
- Published by Springer Nature in Combinatorica
- Vol. 45 (2) , 1-19
A Large Family of Strongly Regular Graphs with Small Weisfeiler-Leman Dimension
- 24 March 2025
- Published by Springer Nature in Combinatorica
- Vol. 45 (2) , 1-19
A Large Family of Strongly Regular Graphs with Small Weisfeiler-Leman Dimension
- Open Access
Cartesian products of graphs and their coherent configurations
The coherent configuration $\mathsf{WL}(X)$ of a graph $X$ is the smallest coherent configuration on the vertices of $X$ that contains the edge set of $X$ as a relation. The aim of the paper is to study $\mathsf{WL}(X)$ when $X$ is a Cartesian product of graphs. The example of a Hamming graph shows that, in general, $\mathsf{WL}(X)$ does not coincide with the tensor product of the coherent configurations of the factors. We prove that if $X$ is ``closed'' with respect to the $6$-dimensional Weisfeiler-Leman algorithm, then $\mathsf{WL}(X)$ is the tensor product of the coherent configurations of certain graphs related to the prime decomposition of $X$. This condition is trivially satisfied for almost all graphs. In addition, we prove that the property of a graph ``to be decomposable into a Cartesian product of $k$ connected prime graphs'' for some $k\ge 1$ is recognized by the $m$-dimensional Weisfeiler-Leman algorithm for all $m\ge 6$.Open AccessCartesian products of graphs and their coherent configurations
The coherent configuration $\mathsf{WL}(X)$ of a graph $X$ is the smallest coherent configuration on the vertices of $X$ that contains the edge set of $X$ as a relation. The aim of the paper is to study $\mathsf{WL}(X)$ when $X$ is a Cartesian product of graphs. The example of a Hamming graph shows that, in general, $\mathsf{WL}(X)$ does not coincide with the tensor product of the coherent configurations of the factors. We prove that if $X$ is ``closed'' with respect to the $6$-dimensional Weisfeiler-Leman algorithm, then $\mathsf{WL}(X)$ is the tensor product of the coherent configurations of certain graphs related to the prime decomposition of $X$. This condition is trivially satisfied for almost all graphs. In addition, we prove that the property of a graph ``to be decomposable into a Cartesian product of $k$ connected prime graphs'' for some $k\ge 1$ is recognized by the $m$-dimensional Weisfeiler-Leman algorithm for all $m\ge 6$. - 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (1) , 317-329
A Linear Programming Bound for Sum-Rank Metric Codes
We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all previously known bounds.
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (1) , 317-329
A Linear Programming Bound for Sum-Rank Metric Codes
We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all previously known bounds.
- Open Access
On multivalued groups of order 3
A complete classification of the multivalued coset groups of order $3$ is given. The proof is based on the classification of rank $3$ groups having regular normal subgroups.Open AccessOn multivalued groups of order 3
A complete classification of the multivalued coset groups of order $3$ is given. The proof is based on the classification of rank $3$ groups having regular normal subgroups. - 1 September 2024
- Published by Pleiades Publishing Ltd in Proceedings of the Steklov Institute of Mathematics
- Vol. 326 (1) , 286-288
On a Family of Multivalued Groups
For a family of \((2k+1)\)-valued groups (\(k\ge 1\)) of three elements, we prove that a group from this family is a coset group if and only if \(4k+3\) is a prime power. We also discuss the relation between three-element coset multivalued groups and finite groups of rank \(3\).- 1 September 2024
- Published by Pleiades Publishing Ltd in Proceedings of the Steklov Institute of Mathematics
- Vol. 326 (1) , 286-288
On a Family of Multivalued Groups
For a family of \((2k+1)\)-valued groups (\(k\ge 1\)) of three elements, we prove that a group from this family is a coset group if and only if \(4k+3\) is a prime power. We also discuss the relation between three-element coset multivalued groups and finite groups of rank \(3\).