866 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Steklov Mathematical InstituteRU415 papers
- St Petersburg UniversityRU162 papers
- Russian Academy of SciencesRU133 papers
- Centre National de la Recherche ScientifiqueFR23 papers
- University of HelsinkiFI23 papers
- Indiana University – Purdue University IndianapolisUS19 papers
- University of GenevaCH15 papers
- Bielefeld UniversityDE14 papers
- National Research University Higher School of EconomicsRU14 papers
- Pennsylvania State UniversityUS14 papers
- Universität HamburgDE14 papers
- University of Notre DameUS13 papers
33 papers · 1 filter
A characterization of exceptional pseudocyclic association schemes by multidimensional intersection numbers
Gang Chen, Jiawei He, Ilia Ponomarenko +1
Recent classification of -transitive permutation groups leaves us with three infinite families of groups which are neither -transitive, nor Frobenius, nor one-dimen…
Asymptotic behaviour of normalized dimensions of standard and strict Young diagrams -- growth and oscillations
Vasilii Duzhin, Nikolay Vasilyev
In this paper, we present the results of a computer investigation of asymptotics for maximum dimensions of linear and projective representations of the symmetric group. This proble…
The Weisfeiler-Leman dimension of chordal bipartite graphs without bipartite claw
Ilia Ponomarenko, Grigory Ryabov
A graph is said to be chordal bipartite if it is bipartite and contains no induced cycle of length at least . It is proved that if does not contain bipartite claw as an…
Stolarsky's invariance principle for projective spaces
M. M. Skriganov
We show that Stolarsky's invariance principle, known for point distributions on the Euclidean spheres, can be extended to the real, complex, and quaternionic projective spaces and…
Recognizing and testing isomorphism of Cayley graphs over an abelian group of order in polynomial time
Roman Nedela, Ilia Ponomarenko
We construct a polynomial-time algorithm that given a graph with vertices ( is prime), finds (if any) a Cayley representation of over the group $C_2\times C_2\times…
Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time
Ilia Ponomarenko, Andrey Vasil'ev
A Cayley graph over a group G is said to be central if its connection set is a normal subset of G. It is proved that for any two central Cayley graphs over explicitly given almost…
Coherent configurations associated with TI-subgroups
Gang Chen, Ilia Ponomarenko
Let X be a coherent configuration associated with a transitive group G. In terms of the intersection numbers of X, a necessary condition for the point stabilizer of G to be a TI-su…
Cartan coherent configurations
Ilia Ponomarenko, Andrey Vasil'ev
The Cartan scheme of a finite group with a -pair is defined to be the coherent configuration associated with the action of on the right cosets of the Cartan…
Restricted Product Sets under Unique Representability
Fedor Petrov
We prove some results of Kemperman--Scherk type for restricted product sets in multiplicative groups of fields (in particular, for cyclic groups). The proofs use polynomial method.
Polynomial Approach to Explicit Formulae for Generalized Binomial Coefficients
Fedor Petrov
We extend the polynomial approach to hook length formula proposed in a recent joint paper with Károlyi, Nagy and Volkov to several other problems of the same type, including number…
Virasoro constraints and topological recursion for Grothendieck's dessin counting
Maxim Kazarian, Peter Zograf
We compute the number of coverings of with a given monodromy type over and given numbers of preimages of 0 and 1. We show that t…
A new approach to constant term identities and Selberg-type integrals
Gyula Károlyi, Zoltán Lóránt Nagy, Fedor Petrov +1
Selberg-type integrals that can be turned into constant term identities for Laurent polynomials arise naturally in conjunction with random matrix models in statistical mechanics. B…
On non-abelian Schur groups
Ilya Ponomarenko, Andrey Vasil'ev
A finite group G is called Schur, if every Schur ring over G is associated in a natural way with a regular subgroup of Sym(G) that is isomorphic to G. We prove that any nonabelian…
Upper bound on the number of edges of an almost planar bipartite graph
Dmitri Karpov
Let be a bipartite graph without loops and multiple edges on vertices, which can be drawn on the plane such that any edge intersects at most one other edge. We prove t…
Enumeration of chord diagrams on many intervals and their non-orientable analogs
N. V. Alexeev, J. E. Andersen, R. C. Penner +1
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and oriented real segments are considered here: the real segments may contain additional…
Some formulas for the number of gluings
A. V. Pastor, O. P. Rodionova
In this paper the number of ways to glue a surface of genus has been investigated. We've proven formulas for the number of gluings sphere from three polygons and from two bicol…
Spanning trees with many leaves: lower bounds in terms of number of vertices of degree 1, 3 and at least~4
Dmitri Karpov
We prove that every connected graph with vertices of degree~1 and 3 and vertices of degree at least~4 has a spanning tree with at least ${1\over 3}t +{1\over 4}s+{3\over 2}…
The structure of decomposition of a triconnected graph
Dmitri Karpov, Alexey Pastor
We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a sim…
Spanning trees with many leaves: new lower bounds in terms of number of vertices of degree~3 and at least~4
D. V. Karpov
We prove, that every connected graph with vertices of degree 3 and vertices of degree at least~4 has a spanning tree with at least leaves, wher…
On proper colorings of hypergraphs
Nick Gravin, Dmitrii Karpov
Let be a hypergraph of maximal vertex degree , such that each its hyperedge contains at least vertices. Let . We prove that (i) The h…
Characterization of cyclic Schur groups
Sergei Evdokimov, István Kovács, Ilya Ponomarenko
A finite group is called a Schur group, if any Schur ring over is the transitivity module of a permutation group on the set containing the regular subgroup of all right…
Bounds of a number of leaves of spanning trees
Anton Bankevich, Dmitri Karpov
We prove that every connected graph with vertices of degree not 2 has a spanning tree with at least leaves. Let be a be a connected graph of girth w…
On quasi-thin association schemes
M. Muzychuk, I. Ponomarenko
An association scheme is called quasi-thin if the valency of each its basic relation is one or two. A quasi-thin scheme is Kleinian if the thin residue of it forms a Klein group wi…
Schur rings over a product of Galois rings
Sergei Evdokimov, Ilya Ponomarenko
The recently developed theory of Schur rings over a finite cyclic group is generalized to Schur rings over a ring R being a product of Galois rings of coprime characteristics. It i…