Antonina P. Khramova's webpage - Publications & Conferences

List of Publications

1. A. Abiad, A. L. Gavrilyuk, A. P. Khramova, I. Ponomarenko. A linear programming bound for sum-rank metric codes (2025). IEEE Transactions on Information Theory, 71(1), 317-329.

DOI: 10.1109/TIT.2024.3488902 arXiv: 2406.15926

2. A. Abiad, A. P. Khramova, A. Ravagnani. Eigenvalue Bounds for Sum-Rank-Metric Codes (2024). IEEE Transactions on Information Theory, 70(7), 4843-4855.

DOI: 10.1109/TIT.2023.3339808 arXiv: 2307.13613

3. A. Abiad, F. Belardo, A. P. Khramova. A switching method for constructing cospectral gain graphs (2024). Discrete Mathematics, 347(4), 113838.

DOI: 10.1016/j.disc.2023.113838 arXiv: 2304.03555

4. A. Abiad, A. P. Khramova. Constructing cospectral hypergraphs (2024). Linear and Multilinear Algebra, 73(4), 729-740.

DOI: 10.1080/03081087.2024.2382992 arXiv: 2211.06087

5. A. Abiad, B. Brimkov, S. Hayat, A. P. Khramova, J. Koolen. Extending a conjecture of Graham and Lovász on the distance characteristic polynomial (2024). Linear Algebra and its Applications, 693, 63-82.

DOI: 10.1016/j.laa.2023.03.027 arXiv: 2206.07561

6. A. P. Khramova, N. Maslova, V. Panshin, A. Staroletov. Characterization of groups E6(3) and 2E6(3) by Gruenberg-Kegel graph (2021). Siberian Electronic Mathematical Reports, 18(2), 1651-1656.

DOI: 10.33048/semi.2021.18.124 arXiv: 2110.09175

7. A. P. Khramova, I. Chernykh. New algorithm for the two-machine open shop and the polynomial solvability of one routing problem (2021). Journal of Scheduling, 24(4), 405-412.

DOI: 10.1007/s10951-021-00694-7

8. A. Buturlakin, A. P. Khramova. A criterion for the existence of a solvable π-Hall subgroup in a finite group (2019). Communications in Algebra, 48:3, 1305-1313.

DOI: 10.1080/00927872.2019.1684504 arXiv: 1810.05350

Conferences and Workshops

1. Criterion of Existence of a Solvable Hall Subgroup (Russian) (contributed talk). Mathematics: Proceedings of 56th International Scientific Student Conference, April 22-27th 2018, Novosibirsk: NSU, 2018. PDF (RU) Slides

2. A Criterion for the Existence of a Solvable Hall Subgroup in a Finite Group (contributed talk). 8th PhD Summer School in Discrete Mathematics, Rogla, Slovenia, July 1-7, 2018. PDF Slides

3. A criterion of existence of a solvable Hall subgroup of a finite group (contributed talk). The International Workshop “Algorithmic problems in group theory and related areas”, Altai Republic, Russia, July 23 – August 4, 2018. PDF Slides

4. On the Existence of Solvable Hall Subgroups (Russian) (contributed talk). International Conference Maltsev Meeting, November 19-22, 2018: Abstracts, Novosibirsk. PDF (RU) Slides

5. On the Existence of Solvable Hall Subgroups (Russian) (contributed talk). International (50th National) Youth School-Conference “Modern problems in mathematics and its applications”, February 3-9, 2019: Abstracts, Yekaterinburg. PDF (RU) Slides

6. On the Existence of Solvable Hall Subgroups (Russian) (contributed talk). Mathematics: Proceedings of 57th International Scientific Student Conference, April 14-19th 2019, Novosibirsk: NSU, 2019. PDF (RU)

7. Another algorithm for the two-machine open shop and its application to one routing problem (contributed talk). XVIII International Conference Mathematical Optimization Theory and Operations Research (MOTOR 2019), Ekaterinburg, Russia, July 8–12, 2019. PDF Slides

8. On polynomially solvable subcases of open shop routing problem (Russian) (contributed talk). International (51st National) Youth School-Conference “Modern problems in mathematics and its applications”, February 3-7, 2020: Abstracts, Yekaterinburg. Slides

9. Generalization of an Algorithm for Open Shop Problem in Solving Several Subcases of the Routing Problem (Russian) (contributed talk). International Scientific Conference “Tanaev Readings 2020”, Minsk, Belarus, March 29-30, 2021. PDF (RU) Slides

10. On a Polynomial Solvability of the Routing Open Shop with a Variable Depot (contributed talk). Book of extended abstracts, the 17th International Conference on Project Management and Scheduling 2020/21, Toulouse, France. PDF Slides

11. The Second Great Mathematical Workshop of the Mathematical Center in Akademgorodok, Project ``Gruenberg-Kegel Graphs of Finite Groups’’, July 12-17 and August 16-21, 2021.

12. Extending a conjecture of Graham and Lovász on the distance characteristic polynomial. 2nd Dutch-Belgian Combinatorics Colloquium, Brussels, Belgium, 25 May 2022. PDF Slides

13. Extending a conjecture of Graham and Lovász on the distance characteristic polynomial (contributed talk). 10th PhD Summer School in Discrete Mathematics, Rogla, Slovenia, June 26 - July 2, 2022. Slides

14. Extending a conjecture of Graham and Lovász on the distance characteristic polynomial (contributed talk). Discrete Mathematics Days 2022, Santander, Spain, July 4-6, 2022. DOI: https://doi.org/10.22429/Euc2022.016 PDF Slides

15. Constructing cospectral hypergraphs (seminar). Algebraic Graph Theory International Webinar (online). Recording Slides

16. Constructing cospectral hypergraphs (contributed talk). Dutch Days of Combinatorics, Utrecht, the Netherlands, March 6-7, 2023. PDF Slides

17. Constructing cospectral hypergraphs (mini-symposium talk). New faces of spectral graph theory mini-symposium at 25th conference of ILAS, Madrid, Spain, June 12-16, 2023. PDF Slides Website

18. Constructing cospectral hypergraphs (contributed talk). 11th PhD Summer School in Discrete Mathematics, Koper, Slovenia, June 26 - July 1, 2023. PDF Slides

19. Sum-rank-metric graphs and eigenvalue bounds for network coding (contributed talk). Rijeka Conference on Combinatorial Objects and their Applications (RICCOTA), Rijeka, Croatia, July 3-7, 2023. PDF Slides

20. Cospectrality in hypergraphs and gain graphs. 5th edition of Dutch-Belgian Seminar in discrete mathematics, Eindhoven, the Netherlands, October 6, 2023. Website Slides

21. Eigenvalue bounds for sum-rank-metric codes. Coding Theory and Cryptography Meetup, Caserta, Italy, October 31, 2023. Website Slides

22. Cospectrality in hypergraphs and gain graphs (contributed talk). DIAMANT Symposium Autumn 2023, Eindhoven, the Netherlands, November 23-24, 2023. Website Slides

23. Algebraic bounds for sum-rank-metric codes (contributed talk). Open Problems on Rank-Metric Codes (OpeRa 2024), Caserta, Italy, February 14-16, 2024. PDF Slides

24. Algebraic bounds for sum-rank-metric codes (contributed talk). Graphs and Groups, Complexity and Convexity (G2C2), Shijiazhuang, China, August 11-25, 2024. PDF Slides

25. A linear programming bound for sum-rank-metric codes (seminar). Postgraduate International Coding theory Seminar (PICS), online. Website Slides

26. A linear programming bound for sum-rank-metric codes (seminar). Dutch Optimization Seminar, online. Recording Slides

27. Algebraic bounds for sum-rank-metric codes (seminar). Discrete Mathematics Seminar at Umeå University, Sweden. Slides

28. On cospectrality in hypergraphs and gain graphs. Drafting Workshop in Discrete Mathematics and Probability 2025 in Budapest, Hungary, January 15-17, 2025. Website Slides

29. Algebraic bounds for sum-rank-metric codes (seminar). Algebraic Graph Theory Webinar, online, February 10, 2025. Website Recording Slides

30. A linear programming bound for sum-rank-metric codes (contributed talk). Error-Correcting Codes and Combinatorial Structures Workshop, Eindhoven, the Netherlands, March 5-7, 2025. Website Slides

31. Algebraic graph bounds for sum-rank-metric codes (lightning talk). Dutch Days of Combinatorics, Delft, the Netherlands, March 25-26, 2025. Website Slides

Khramova_EN_Hall_solvable_subgroups.pdf

Khramova_TUE_O2Cmax and RO2.pdf

Khramova_slides_dcp_block_graphs_coefs.pdf

Khramova_diamant_hypergraphs_and_gain_graphs.pdf

Khramova_Caserta_sum-rank-codes.pdf

Khramova_g2c2_two_bounds_for_srk.pdf

DDC_Khramova.pdf

Short biography

Antonina P. Khramova is a Ph.D. student at Eindhoven University of Technology, The Netherlands. She received her bachelor’s degree in 2018 and her master’s degree in 2020 in mathematics and computer science from Novosibirsk State University, Russia. In 2021, she was a research engineer at Sobolev Institute of Mathematics and Siberian State University of Telecommunications and Information Sciences in Novosibirsk. Her current research work is in algebraic combinatorics, with a focus on algebraic graph theory.