866 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Russian Academy of SciencesRU852 papers
- St. Petersburg Department of Steklov Institute of MathematicsRU415 papers
- National Research University Higher School of EconomicsRU220 papers
- St Petersburg UniversityRU177 papers
- Lomonosov Moscow State UniversityRU174 papers
- Moscow Institute of Physics and TechnologyRU152 papers
- Centre National de la Recherche ScientifiqueFR118 papers
- Institute for Theoretical and Experimental PhysicsRU92 papers
- Skolkovo Institute of Science and TechnologyRU87 papers
- Institute for Information Transmission ProblemsRU64 papers
- National University of Science and TechnologyRU57 papers
- Russian Quantum CenterRU52 papers
3 papers · 2 filters
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…
New results on sum-product type growth over fields
Brendan Murphy, Giorgis Petridis, Oliver Roche-Newton +2
We prove a range of new sum-product type growth estimates over a general field , in particular the special case . They are unified by the theme…