Searcharxiv⌕ Search

arXiv subjects

Ilia Ponomarenko

Publications and source records attributed to Ilia Ponomarenko.

At least 37 records · Page 2Linked to original sources
arXiv2021

On pseudofrobenius imprimitive association schemes

An (association) scheme is said to be Frobenius if it is the scheme of a Frobenius group. A scheme which has the same tensor of intersection numbers as some Frobenius scheme is said to be pseudofrobenius. We establish a necessary and sufficient condition for an imprimitive pseudofrobenius scheme to be Frobenius. We also prove strong necessary conditions for existence of an imprimitive pseudofrobenius scheme which is not Frobenius. As a byproduct, we obtain a sufficient condition for an imprimitive Frobenius group $G$ with abelian kernel to be determined up to isomorphism only by the character table of $G$. Finally, we prove that the Weisfeiler-Leman dimension of a circulant graph with $n$ vertices and Frobenius automorphism group is equal to $2$ unless $n\in \{p,p^2,p^3,pq,p^2q\}$, where $p$ and $q$ are distinct primes.

math.CO↗
arXiv2021

On a huge family of non-schurian Schur rings

In his famous monograph on permutation groups, H.~Wielandt gives an example of a Schur ring over an elementary abelian group of order $p^2$ ($p>3$ is a prime), which is non-schurian, that is, it is the transitivity module of no permutation group. Generalizing this example, we construct a huge family of non-schurian Schur rings over elementary abelian groups of even rank.

math.GR↗
arXiv2021

Tensor products of coherent configurations

A Cartesian decomposition of a coherent configuration $\cal X$ is defined as a special set of its parabolics that form a Cartesian decomposition of the underlying set. It turns out that every tensor decomposition of $\cal X$ comes from a certain Cartesian decomposition. It is proved that if the coherent configuration $\cal X$ is thick, then there is a unique maximal Cartesian decomposition of $\cal X$, i.e., there is exactly one internal tensor decomposition of $\cal X$ into indecomposable components. In particular, this implies an analog of the Krull--Schmidt theorem for the thick coherent configurations. A polynomial-time algorithm for finding the maximal Cartesian decomposition of a thick coherent configuration is constructed.

math.CO↗
arXiv2020

On $2$-closed abelian permutation groups

A permutation group $G\le\operatorname{Sym}(Ω)$ is said to be $2$-closed if no group $H$ such that $G<H\le\operatorname{Sym}(Ω)$ has the same orbits on $Ω\timesΩ$ as $G$. A simple and efficient inductive criterion for the $2$-closedness is established for abelian permutation groups with cyclic transitive constituents.

math.GR↗
arXiv2020

A characterization of exceptional pseudocyclic association schemes by multidimensional intersection numbers

Recent classification of $\frac{3}{2}$-transitive permutation groups leaves us with three infinite families of groups which are neither $2$-transitive, nor Frobenius, nor one-dimensional affine. The groups of the first two families correspond to special actions of ${\mathrm{PSL}}(2,q)$ and ${\mathrm{PΓL}}(2,q),$ whereas those of the third family are the affine solvable subgroups of ${\mathrm{AGL}}(2,q)$ found by D. Passman in 1967. The association schemes of the groups in each of these families are known to be pseudocyclic. It is proved that apart from three particular cases, each of these exceptional pseudocyclic schemes is characterized up to isomorphism by the tensor of its $3$-dimensional intersection numbers.

math.CO↗
arXiv2020

The Weisfeiler-Leman Algorithm and Recognition of Graph Properties

The $k$-dimensional Weisfeiler-Leman algorithm ($k$-WL) is a very useful combinatorial tool in graph isomorphism testing. We address the applicability of $k$-WL to recognition of graph properties. Let $G$ be an input graph with $n$ vertices. We show that, if $n$ is prime, then vertex-transitivity of $G$ can be seen in a straightforward way from the output of 2-WL on $G$ and on the vertex-individualized copies of $G$. However, if $n$ is divisible by 16, then $k$-WL is unable to distinguish between vertex-transitive and non-vertex-transitive graphs with $n$ vertices as long as $k=o(\sqrt n)$. Similar results are obtained for recognition of arc-transitivity.

math.CO↗
arXiv2020

On the separability of cyclotomic schemes over finite field

It is proved that with finitely many possible exceptions, each cyclotomic scheme over finite field is determined up to isomorphism by the tensor of 2-dimensional intersection numbers; for infinitely many schemes, this result cannot be improved. As a consequence, the Weisfeiler-Leman dimension of a Paley graph or tournament is at most 3 with possible exception of several small graphs.

math.CO↗
arXiv2020

The Weisfeiler-Leman dimension of distance-hereditary graphs

A graph is said to be distance-hereditary if the distance function in every connected induced subgraph is the same as in the graph itself. We prove that the ordinary Weisfeiler-Leman algorithm correctly tests the isomorphism of any two graphs if one of them is distance-hereditary; more precisely, the Weisfeiler-Leman dimension of the class of finite distance-hereditary graphs is equal to $2$. The previously best known upper bound for the dimension was $7$.

math.CO↗
arXiv2019

Two-closure of supersolvable permutation group in polynomial time

The $2$-closure $\overline{G}$ of a permutation group $G$ on $Ω$ is defined to be the largest permutation group on $Ω$, having the same orbits on $Ω\timesΩ$ as $G$. It is proved that if $G$ is supersolvable, then $\overline{G}$ can be found in polynomial time in $|Ω|$. As a byproduct of our technique, it is shown that the composition factors of $\overline{G}$ are cyclic or alternating of prime degree.

math.GR↗
arXiv2019

Testing isomorphism of circular-arc graphs in polynomial time

A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be tested by the Weisfeiler-Leman algorithm after individualization of two vertices.

cs.DS↗
arXiv2019

Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm

We show that the 2-dimensional Weisfeiler-Leman algorithm stabilizes n-vertex graphs after at most O(n log n) iterations. This implies that if such graphs are distinguishable in 3-variable first order logic with counting, then they can also be distinguished in this logic by a formula of quantifier depth at most O(n log n). For this we exploit a new refinement based on counting walks and argue that its iteration number differs from the classic Weisfeiler-Leman refinement by at most a logarithmic factor. We then prove matching linear upper and lower bounds on the number of iterations of the walk refinement. This is achieved with an algebraic approach by exploiting properties of semisimple matrix algebras. We also define a walk logic and a bijective walk pebble game that precisely correspond to the new walk refinement.

cs.LO↗
arXiv2018

Testing isomorphism of circulant objects in polynomial time

Let ${\frak K}$ be a class of combinatorial objects invariant with respect to a given regular cyclic group. It is proved that the isomorphism of any two objects $X,Y\in{\frak K}$ can be tested in polynomial time in sizes of $X$ and $Y$.

math.CO↗
arXiv2018

Two-valenced association schemes and the Desargues theorem

The main goal of the paper is to establish a sufficient condition for a two-valenced association scheme to be schurian and separable. To this end, an analog of the Desargues theorem is introduced for a noncommutative geometry defined by the scheme in question. It turns out that if the geometry has enough many Desarguesian configurations, then under a technical condition the scheme is schurian and separable. This result enables us to give short proofs for known statements on the schurity and separability of quasi-thin and pseudocyclic schemes. Moreover, by the same technique we prove a new result: given a prime $p$, any $\{1,p\}$-scheme with thin residue isomorphic to an elementary abelian $p$-group of rank greater than two, is schurian and separable.

math.CO↗
arXiv2018

Schurity and separability of quasiregular coherent configurations

A permutation group is said to be quasiregular if every its transitive constituent is regular, and a quasiregular coherent configuration can be thought as a combinatorial analog of such a group: the transitive constituents are replaced by the homogeneous components. In this paper, we are interested in the question when the configuration is schurian, i.e., formed by the orbitals of a permutation group, or/and separable, i.e., uniquely determined by the intersection numbers. In these terms, an old result of Hanna Neumann is, in a sense, dual to the statement that the quasiregular coherent configurations with cyclic homogeneous components are schurian. In the present paper, we (a) establish the duality in a precise form and (b) generalize the latter result by proving that a quasiregular coherent configuration is schurian and separable if the groups associated with homogeneous components have distributive lattices of normal subgroups.

math.CO↗
arXiv2017

Abelian Schur groups of odd order

A finite group $G$ is called a Schur group if any Schur ring over $G$ is associated in a natural way with a subgroup of $Sym(G)$ that contains all right translations. It is proved that the group $C_3\times C_3\times C_p$ is Schur for any prime $p$. Together with earlier results, this completes a classification of the abelian Schur groups of odd order.

math.GR↗
arXiv2017

The Weisfeiler-Leman Dimension of Planar Graphs is at most 3

We prove that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best known upper bounds for the dimension and number of variables were 14 and 15, respectively. First we show that, for dimension 3 and higher, the WL-algorithm correctly tests isomorphism of graphs in a minor-closed class whenever it determines the orbits of the automorphism group of any arc-colored 3-connected graph belonging to this class. Then we prove that, apart from several exceptional graphs (which have WL-dimension at most 2), the individualization of two correctly chosen vertices of a colored 3-connected planar graph followed by the 1-dimensional WL-algorithm produces the discrete vertex partition. This implies that the 3-dimensional WL-algorithm determines the orbits of a colored 3-connected planar graph. As a byproduct of the proof, we get a classification of the 3-connected planar graphs with fixing number 3.

cs.DM↗