Мая Митева Стоянова

Мая Митева Стоянова

Професор
Доктор
Заместник-декан академичен състав
Имейл: 
stoyanova@fmi.uni-sofia.bg
Телефон: 
+359 2 8161 664
Кабинет: 
ФМИ-518
Приемно време: 

вторник от 13:00 до 14:00 в кабинет 518
четвъртък от 13:00 до 14:00 в кабинет 518

Образование и научни степени

  • 2009: Доктор (Ph.D.), Висша Атестационна Комисия (ВАК).
  • 1992: Магистър (M.Sc.), СУ "Св. Климент Охридски", Факултет по математика и информатика.

Научни интереси

  • Теория на кодирането - сферични кодове и дизайни, ортогонални масиви, минимизиране на енергии на комбинаторни конфигурации в полиномиални метрични пространства
  • Алгебра
  • Комбинаторика
  • Теория на числата

Научни проекти

  • Алгебрични и геометрични методи за защита на данни, (Конкурс за финансиране на фундаментални научни изследвания – 2019 г.) Договор: KP-06-N32/2-2019 към ФНИ на МОН, ръководител: проф. дмн Петър Бойваленков, базова организация: ИМИ-БАН, период 36 месеца, http://contract-n32-2019.free.bg/funding.html, член на проекта.
  • Национална научна програма Информационни и комуникационни технологии за единен цифров пазар в науката, образованието и сигурността (ИКТ в НОС), осъществена с финансовата подкрепа на МОН, научен координатор на програмата: проф. д-р Красен Стефанов, през периода: 2019-2021 г, https://npict.bg/bg;
  • Minimum Energy and Extremal Problems in Coding Theory, MFO Research in Pairs program, Leibniz Association, Contract:1922p;
  • Докторантски Център „Свети Климент Охридски“ (ДокЦент), съфинансиране от Европейския социален фонд на Европейския съюз, Договор: BG05M2OP001-2.009.0013, https://phdsu.blogspot.com/, член на Експертния съвет на проекта;
  • Проектиране и разработване на прототип на информационна система „Указател за цитируемост на публикации от български автори (обществени науки)“, Договор: ДН 15/1, 11.12.2017 г. към ФНИ на МОН, ръководител: Проф. дфн Оля Харизанова, базова организация СУ „Св. Климент Охридски“, период 36 месеца, http://citation.uni-sofia.bg/, член на проекта;
  • Кодове и комбинаторни конфигурации, Договор: ДН 02/2, 13.12.2016 г. към ФНИ на МОН, ръководител: проф. дмн Илия Буюклиев, базова организация: ИМИ-БАН, период 36 месеца, http://www.moi.math.bas.bg/moiuser/~data/, ръководител на Работен пакет 4 “Ортогонални масиви”.

Списък с публикации

  1. Alexander Barg, Peter Boyvalenkov, Maya Stoyanova, Bounds for the sum of distances of spherical sets of small size, 2022, submitted, https://arxiv.org/abs/2105.03511.
  2. Maya Stoyanova, Universal bounds for cardinalities and energy of codes in Hamming spaces, Mathematics and Education in Mathematics, Proceedings of the Fifty First Spring Conference of the Union of Bulgarian Mathematicians, Tryavna, April 5-9, 2022, editor/s: Assoc. Prof. Evgenia Sendova, Ph.D., pages:100-112, ISSN (print): 1313-3330, ISSN (online): 1313-3330, http://www.math.bas.bg/smb/2022_PK/tom_2022/pdf/100-112.pdf.
  3. P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff, M. M. Stoyanova, Bounds for spherical codes: The Levenshtein framework lifted, Mathematics of Compitation, vol:90, issue:329, 2021, pages:1323-1356, ISSN (print):0025-5718, ISSN (online):1088-6842, https://doi.org/10.1090/mcom/3621, Ref Web of Science, IF: 2.417 (2020), Web of Science Quartile: Q1 (JCR-2020)https://www.ams.org/journals/mcom/2021-90-329/S0025-5718-2021-03621-2/.
  4. P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff, M. M. Stoyanova, Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances, IEEE Transactions on Information Theory, vol:67, issue:6, 2021, pages:3569-3584, ISSN (print): 0018-9448, ISSN (online): 1557-9654, http://dx.doi.org/10.1109/tit.2021.3056319, Ref Web of Science, IF: 2.501 (2020), Web of Science Quartile: Q2 (JCR-2020)https://ieeexplore.ieee.org/document/9344843.
  5. Peter Boyvalenkov, Maya Stoyanova, Linear programming bounds for covering radius of spherical designs, Results in Mathematics, vol:76, issue:article number: 95, 2021, ISSN (print): 1422-6383, ISSN (online): 1420-9012, https://doi.org/10.1007/s00025-021-01400-x, Ref Web of Science, IF: 1.199 (2020), Web of Science Quartile: Q2 (JCR-2020), https://link.springer.com/article/10.1007%2Fs00025-021-01400-x.
  6. Silvia Boumova, Tedis Ramaj, Maya Stoyanova, Computing distance distributions of ternary orthogonal arrays, Comptes rendus de l'Académie bulgare des Sciences, vol:74, issue:2, 2021, pages:177-189, ISSN (print): 1310–1331 , ISSN (online): 2367–5535, DOI:10.7546/CRABS.2021.02.03, Ref Web of Science, IF: 0.378 (2020), Web of Science Quartile: Q4 (JCR-2020), http://www.proceedings.bas.bg/DOI/doi2021_2_03.html.
  7. Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya M. Stoyanova, Upper bounds for energies of spherical codes of given cardinality and separation, Designs, Codes and Cryptography, vol:88, issue:9, 2020, pages:1811-1826, ISSN (print):0925-1022, ISSN (online):1573-7586, https://doi.org/10.1007/s10623-020-00733-y, Ref Web of Science, Impact Factor: 1.492 (2020), Web of Science Quartile: Q2 (JCR-2020), https://link.springer.com/article/10.1007/s10623-020-00733-y(Announced in [11]).
  8. Silvia Boumova, Tedis Ramaj, Maya Stoyanova, On Covering Radius of Orthogonal Arrays, 2020 Algebraic and Combinatorial Coding Theory (ACCT), Date of Conference: 11-17 Oct. 2020, Conference Location: Albena, Bulgaria, Date Added to IEEE Xplore: 25 March 2021, 2021, pages:23-28, Electronic ISBN:978-1-6654-0287-3, Print on Demand(PoD) ISBN:978-1-6654-0288-0, DOI: 10.1109/ACCT51235.2020.9383398, Ref IEEE Xplorehttps://ieeexplore.ieee.org/document/9383398.
  9. P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff, M. M. Stoyanova, On spherical codes with inner products in a prescribed interval, Designs, Codes and Cryptography, 2019, volume 87, issue 2-3, pages: 299-315, (Received: 29 December 2017, Revised: 07 June 2018, Accepted: 17 July 2018, First Online: 26 July 2018), ISSN: 0925-1022 (Print), ISSN: 1573-7586 (Online), https://doi.org/10.1007/s10623-018-0524-z, Ref Web of Science, Impact Factor: 1.524 (2019), Web of Science Quartile: Q2 (JCR-2019), https://link.springer.com/article/10.1007/s10623-018-0524-zhttps://arxiv.org/abs/1801.07334, (Announced in [16]).
  10. S. Boumova, T. Marinova, T. Ramaj, M. Stoyanova, Nonexistence of (17, 108, 3) ternary orthogonal array, Annual of Sofia University ”St. Kliment Ohridski“, Faculty of Mathematics and Informatics, vol:106, 2019, pages:117-126, ISSN (print):1313-9215, ISSN (online):2603-5529, Ref MathSciNet (MR4125835), Ref zbMATH (Zbl 07360437), https://www.fmi.uni-sofia.bg/bg/nonexistence-17-108-3-ternary-orthogonal-array.
  11. Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya M. StoyanovaOn two problems concerning universal bounds for codes, 2019 XVI International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY 2019), Moscow, Russia, October, 21-25, 2019, pages: 58–63, doi: 10.1109/REDUNDANCY48165.2019.9003329Ref IEEE Xplore, On Two Problems Concerning Universal Bounds for Codes | IEEE Conference Publication | IEEE Xplore.
  12. Peter Boyvalenkov, Peter Dragnev, Douglas Hardin, Edward Saff, and Maya Stoyanova, Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances, ISIT 2019: The 2019 IEEE International Symposium on Information Theory, Paris, France, July 7-12, 2019, pages: 1747-1751, doi: 10.1109/ISIT.2019.8849388ISBN: 978-1-5386-9290-5, Ref Scopus, SJR: 0.91 (2019), Ref IEEE Xplore, paper number 1616, 978-1-5386-9291-2/19/ IEEE, https://ieeexplore.ieee.org/document/8849388.
  13. Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya M. Stoyanova, Upper bounds for energies of codes of given cardinality and separationextended abstract, The Eleventh International Workshop on Coding and Cryptography (WCC 2019), Saint-Jacut-de-la-Mer, France, from March 31st to April 5th 2019,  https://www.lebesgue.fr/content/sem2019-WCC-Accepted%20papers.
  14. Peter Boyvalenkov, Peter Dragnev, Douglas Hardin, Edward Saff, Maya StoyanovaEnergy Bounds for Codes in Polynomial Metric SpacesAnalysis and Mathematical Physics, 2019, Volume 9, Issue 2, pages: 781-808, (in Conference Proceedings, as a special issue of the Journal "Analysis and Mathematical Physics", Received18 December 2018Accepted11 April 2019First Online06 June 2019), ISSN: 1664-2368 (Print), ISSN: 1664-235X (Online), https://doi.org/10.1007/s13324-019-00313-x, Ref Web of Science, Impact Factor: 1.792 (2018), Web of Science QuartileQ1 (JCR-2019), https://link.springer.com/article/10.1007/s13324-019-00313-xhttps://arxiv.org/abs/1804.07462.
  15. Peter Boyvalenkov, Danyo Danev, Maya Stoyanova, Refinements of Levenshtein bounds in q-ary Hamming spaces, Problems of Information Transmission, 2018, Vol. 54, Issue 4, pages: 329342, (Original Russian Text Published in Problemy Peredachi Informatsii, 2018, Vol. 54, Issue 4, pages: 3550, ISSN: 0555-2923, Received: 12 December 2017, Revised: 16 May 2018, Accepted: 10 August 2018, First Online: 28 January 2019), ISSN: 0032-9460 (Print), ISSN: 1608-3253 (Online), https://doi.org/10.1134/S0032946018040026, Ref Web of Science, Impact Factor: 0.557 (2018), Web of Science Quartile: Q4 (JCR-2018), https://link.springer.com/article/10.1134/S0032946018040026https://arxiv.org/abs/1801.01982 .
  16. Silvia Boumova, Tanya Marinova, Maya Stoyanova, On ternary orthogonal arrays, Proc. Sixteenth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT–16, Svetlogorsk (Kaliningrad region), Russia, September 2-9, 2018, pp.102-105, http://acct2018.skoltech.ru/.
  17. P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff, M. M. Stoyanova, Energy bounds for codes and designs in Hamming spaces, Designs, Codes and Cryptography, Vol. 82, Issue I, 2017, pp. 411-433, DOI: 10.1007/s10623-016-0286-4, Ref Web of Science, Impact Factor: 1.114 (2017), Web of Science Quartile: Q2 (JCR-2017), https://link.springer.com/article/10.1007/s10623-016-0286-4http://arxiv.org/pdf/1510.03406v1.pdf. (Announced in [27]).
  18. Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya M. Stoyanova, Bounding energies and cardinalities of spherical codes with inner products in prescribed interval, extended abstract, The Tenth International Workshop on Coding and Cryptography (WCC 2017), St. Petersburg, Russia, September 18-22, 2017, http://wcc2017.suai.ru/papers.html.
  19. Tanya Marinova, Maya Stoyanova, Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays, Electronic  Notes in Discrete Mathematics, containing the Proceedings of ACCT XV, (Announced in [23]), vol. 57, March 2017, pp. 153-159, Ref Scopus, SJR: 0.272 (2017), http://doi.org/10.1016/j.endm.2017.02.026, SNIP 0.389 (2016), http://www.sciencedirect.com/science/article/pii/S1571065317300264
  20. P. Boyvalenkov, P. Dragnev, D. Hardin, E. Saff, M. Stoyanova, Universal Lower Bounds on Energy and LP-Extremal Polynomials for (4,24)-Codes, Electronic  Notes in Discrete Mathematics, containing the Proceedings of ACCT XV, (Announced in [21]), vol. 57, March 2017, pp. 91-96, http://dx.doi.org/10.1016/j.endm.2017.02.016, Ref Scopus, SJR: 0.262 (2017), http://www.sciencedirect.com/science/article/pii/S1571065317300161.
  21. P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff, M. M. Stoyanova, Energy bounds for antipodal spherical codes and in infinite projective spaces, XV International Symposium "Problems of Redundansy in Information and control Systems', September 26-29, 2016, St. Petersburg, Russia, 2016, 978-1-5090-4231-9/16/2016 IEEE, pp. 28 - 32, Ref IEEE Xplore, http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=7779322.
  22. Peter Boyvalenkov, Tanya Marinova, Maya Stoyanova, Nonexistence of a few binary orthogonal arrays, Discrete Applied Mathematics, 217(2), 2017, pp. 144-150, (Announced in [22], Available online 30 August 2016), Ref Web of Science, Impact Factor: 0.932 (2017), Web of Science Quartile: Q3 (JCR-2017), http://www.sciencedirect.com/science/article/pii/S0166218X1630364Xhttp://arxiv.org/abs/1604.06117.
  23. P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff, M. M. Stoyanova, Universal Lower Bounds on Energy and LP-Extremal Polynomials for (4,24)-Codes, Proc. Fifteenth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT–15, June 18-24, 2016, Albena, Bulgaria, pp. 84-89, https://www.researchgate.net/publication/303693528_Universal_Lower_Bounds_on_Energy_and_LP-Extremal_Polynomials_for_424-Codes.
  24. Peter Boyvalenkov, Tanya Marinova, Maya Stoyanova, New nonexistence results for binary orthogonal arrays, Proc. Fifteenth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT–15, June 18-24, 2016, Albena, Bulgaria, pp. 90-95, https://www.researchgate.net/publication/303693339_New_nonexistence_results_for_binary_orthogonal_arrays.
  25. Tanya Marinova, Maya Stoyanova, Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays, Proc. Fifteenth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT–15, June 18-24, 2016, Albena, Bulgaria, pp. 221-226, https://www.researchgate.net/publication/303702618_Nonexistence_of_9_112_4_and_10_224_5_binary_orthogonal_arrays.
  26. P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff, M. M. Stoyanova, Universal lower bounds for potential energy of spherical codes, Constructive Approximation, 44 (3), 2016, pp. 385-415, DOI: 10.1007/s00365-016-9327-5, Ref Web of Science, Impact Factor: 0.964 (2016), Web of Science Quartile: Q1 (JCR-2016), http://link.springer.com/article/10.1007/s00365-016-9327-5http://arxiv.org/pdf/1503.07228.pdf.
  27. Peter Boyvalenkov, Tanya Marinova, Maya Stoyanova, Mila Sukalinska, Distance distributions and energy of designs in Hamming spaces, Serdica Journal of Computing, Vol. 9 (2), 2015, pp. 139-150, Ref zbMATH, Ref MathSciNet, http://serdica-comp.math.bas.bg/index.php/serdicajcomputing/article/view/251.
  28. P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff, M. M. Stoyanova, Universal upper and lower bounds on energy of spherical designs, Dolomites Research Notes on Approximation, ISSN 20356803 – Padova University Press, Special Issue for the “10 years of the Padua points”, http://dx.doi.org/10.14658/pupj-drna-2015-Special_Issue-6, Volume 8, 2015, pp. 51-65, Ref Scopus, SJR: 0.344 (2015), http://drna.padovauniversitypress.it/2015/specialissue/6http://arxiv.org/pdf/1509.07837v1.pdf.
  29. Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff, Maya M. Stoyanova, Energy bounds for codes and designs in Hamming spaces, extended abstract, Workshop on Coding and Cryptography (WCC 2015), Paris, France, April 13–17, 2015, http://wcc2015.inria.fr/papers.html.
  30. Boyvalenkov P., Kulina H., Marinova T., Stoyanova M., Nonexistence of binary orthogonal arrays via their distance distributions, Problems of Information Transmission, 2015, vol. 51, No 4, pp. 326-334, (Received December 2014, Original Russian Text Published in Problemy Peredachi Informatsii, 2015, Vol. 51, No. 4, pp. 23-31, DOI: 10.1134/S003294601504002X), Ref Web of Science, Impact Factor: 0.632 (2015), Web of Science Quartile: Q3 (JCR-2015), http://link.springer.com/article/10.1134/S003294601504002X.
  31. Boyvalenkov P., Dragnev P., Hardin D., Saff E., Stoyanova M., On the Riesz energy of spherical designs, Proc. Fourteenth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT–14, Svetlogorsk (Kaliningrad region), Russia, September 7–13, 2014, pp. 109–114, http://www.moi.math.bas.bg/acct2014/a18.pdf.
  32. Peter Boyvalenkov, Hristina Kulina, Maya Stoyanova, On (4,9,96) binary orthogonal arrays, Proc. Seventh International Workshop on Optimal Codes and Related Topics, OC’13, Albena, Bulgaria, September 6-12, 2013, pp. 71-76, Ref zbMATH, http://www.moi.math.bas.bg/oc2013/a11.pdf.
  33. Peter Boyvalenkov, Hristina Kulina, Maya Stoyanova, Nonexistence of certain binary orthogonal arrays, Proc. Seventh International Workshop on Optimal Codes and Related Topics, OC’13, Albena, Bulgaria, September 6-12, 2013, pp. 65-70, Ref zbMATH, http://www.moi.math.bas.bg/oc2013/a10.pdf.
  34. Peter Boyvalenkov, Maya Stoyanova, New nonexistence results for spherical designs, Advances in Mathematics of Communications, 2013, Vol. 7, № 3, 2013, pp. 279-292, (DOI: 10.3934/amc.2013.7.279, Received: July 2012, Revised: March 2013, Available online: July 2013), Ref Web of Science, Impact Factor: 0.651 (2013), Web of Science Quartile: Q3 (JCR-2013), http://www.aimSciences.org
  35. Peter Boyvalenkov, Maya Stoyanova, An improved algorithm for proving nonexistence of small spherical designs, Proc. Thirteenth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT–13, Pomorie, Bulgaria, 15-21 June, 2012, pp. 121-124, http://www.moi.math.bas.bg/acct2012/acct2012.html.
  36. Peter Boyvalenkov, Maya Stoyanova, Improved approaches for investigation of small spherical designs, Compt. rend. Acad. Bulg. Sci., 2012,  Vol. 65, № 6, pp. 743-750, Ref Web of Science, Impact Factor: 0.211 (2012), Web of Science Quartile: Q4 (JCR-2012), http://www.proceedings.bas.bg/.
  37. Peter Boyvalenkov, Maya Stoyanova, A new asymptotic bound of the minimum possible odd cardinality of spherical (2k-1)-designs, Discrete Mathematics, 2010, Vol. 310, Issues 15-16, pp. 2170-2175, (DOI: 10.1016/j.disc.2010.04.007, Available online: 13 May 2010), Ref Web of Science, Impact Factor: 0.536 (2010), Web of Science Quartile: Q3 (JCR-2010), http://www.sciencedirect.com/science/article/pii/S0012365X10001408.
  38. Peter Boyvalenkov, Maya Stoyanova, New asymptotic bounds for some spherical (2k-1)-designs, Proc. Sixth International Workshop on Optimal Codes and Related Topics, OC’09, Varna, Bulgaria, 16-22 June 2009, pp. 49-54, http://www.moi.math.bas.bg/oc2009/a9.pdf.
  39. Maya Stoyanova, On the structure of some spherical codes and designs, PhD Thesis, Sofia University, Sofia, Bulgaria, 2009, https://store.fmi.uni-sofia.bg/fmi/algebra/stoyanova/PhD_thesis_MS.pdf.
  40. S. P. Boumova, P. G. Boyvalenkov, M. M. Stoyanova, A method for proving nonexistence of spherical designs of odd strength and odd cardinality, Problems of Information Transmission, 2009, Vol. 45, No. 2, pp. 110-123, (DOI: 10.1134/S0032946009020033, Original Russian Text Published in Problemy Peredachi Informatsii, 2009, Vol. 45, No. 2, pp. 41-55), Ref Web of Sciense, Impact Factor: 0.435 (2009), Web of Science Quartile: Q4 (JCR-2009), http://www.springerlink.com/content/j38w25728jk60728/.
  41. S. P. Boumova, P. G. Boyvalenkov, M. M. Stoyanova, Nonexistence results for spherical 7-­designs, Proc. Eleventh International Workshop on Algebraic and Combinatorial Coding Theory, ACCT–11, Pamporovo, Bulgaria, 16­-22 June, 2008, pp. 35-39, http://www.moi.math.bas.bg/acct2008/b6.pdf.
  42. S. P. Boumova, P. G. Boyvalenkov, H. Kulina, M. M. Stoyanova, Polynomial techniques for investigation of spherical designs, Designs, Codes and Cryptography, 2009, Vol. 51, Issue 3, pp. 275-288, (DOI: 10.1007/s10623-008-9260-0, Published online: 19 December 2008), Ref Web of Science, Impact Factor: 0.825 (2009), Web of Science Quartile: Q2 (JCR-2009), http://www.springerlink.com/content/82558663w81hnp05/.
  43. S. P. Boumova, P. G. Boyvalenkov, H. Kulina, M. M. Stoyanova, New nonexistence results for spherical 5-­designs, Scientific Research, a Jornal of South­-West University, Blagoevgrad, Bulgaria, 2007, 14 pages, http://press.swu.bg/volume-collection/volume-5/new-nonexistence-results-for-spherical-5-designs.aspx.
  44. S. P. Boumova, P. G. Boyvalenkov, H. Kulina, M. M. Stoyanova, New nonexistence results for spherical 5­-designs, Proc. Fifth International Workshop on Optimal Codes and Related Topics, OC’07, White Lagoon, Bulgaria, 16-22 June 2007, pp. 30­-35, https://www.researchgate.net/publication/270274354_New_nonexistence_results_for_spherical_5-designs.
  45. P. G. Boyvalenkov, M. M. Stoyanova, Bounds on the cardinality of spherical codes with inner products in given range, Proc. Tenth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT–10, Zvenigorod, Russia, 03­-09 September, 2006, pp.  48­-51, https://www.researchgate.net/publication/259389708_Bounds_on_the_cardinality_of_spherical_codes_with_inner_products_in_given_range.
  46. P. G. Boyvalenkov, M. M. Stoyanova, Upper bounds on the covering radius of spherical designs, Proc. Fourth International Workshop on Optimal Codes and Related Topics, OC’05, Pamporovo, Bulgaria, 17­-23 June, 2005, pp. 53­-58, https://www.researchgate.net/publication/259389891_Upper_bounds_on_the_covering_radius_of_spherical_designs.
  47. P. G. Boyvalenkov, M. M. Stoyanova, Some methods for investigation of spherical designs, Proc. Ninth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT–9, Kranevo, Bulgaria, 19­-25 June, 2004, pp. 86-89, https://www.researchgate.net/publication/259390024_Some_methods_for_investigations_of_spherical_designs.
  48. P. G. Boyvalenkov, M. M. Stoyanova, On spherical (n, M, l, τ)­-sets, Proc. Eighth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT–8, Tsarskoe Selo, Russia, 08-­14 September, 2002, pp. 69­-72, https://www.researchgate.net/publication/259389954_On_spherical_nMIt-sets.
  49. P. G. Boyvalenkov, M. M. Stoyanova, Spherical 2­-distance sets which are spherical 3-­designs, Ann. Sofia Univ., 2004, Vol. 95, pp. 53-­58 (received on Dec. 14, 2001).
  50. G. Stanilov, M. M. Stoyanova, A converse theorem of Morley’s trisector theorem, Math. Educ. Math., Proc. of Thirtieth Spring Conference of UBM, Borovets, Bulgaria, 08-11 April, 2001, pp. 399-404, http://www.math.bas.bg/smb/PK/30-2001.pdf.
  51. M. M. Stoyanova, On the geometry of a skew-­symmetrical curvature operator on 3-­dimensional Riemannian manifold, Math. Educ. Math., Proc. of Twenty Second Spring Conference of UBM, Sofia, Bulgaria, 02-05 April, 1993, pp. 84-­87, http://www.math.bas.bg/smb/PK/22-1993.pdf.