Публикации на Мая Митева Стоянова

Статии

  1. Universal minima of discrete potentials for sharp spherical codes, (with Peter Boyvalenkov, Peter Dragnev, Douglas Hardin, Edward Saff), 2023, submitted, https://arxiv.org/abs/2211.00092.
  2. On polarization of spherical codes and designs, (with P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff), Journal of Mathematical Analysis and Applications, 2023, Volume 524, Issue 1, 1 August 2023, Article number: 127065, ISSN: 0022-247X, EISSN: 1096-0813, https://doi.org/10.1016/j.jmaa.2023.127065, Ref Web of Science, Impact Factor: 1.417 (2021), Web of Science Quartile: Q1 (77/333 Math, JCR-2021), https://arxiv.org/abs/2207.08807.
  3. Bounds for the sum of distances of spherical sets of small size, (with Alexander Barg and Peter Boyvalenkov), Discrete Mathematics, volume: 346, issue: 5, May 2023, Article number: 113346, ISSN: 0012-365X, https://doi.org/10.1016/j.disc.2023.113346, Ref Web of Science, Impact Factor: 0.961 (2021), Web of Science Quartile: Q3 (169/333 Math, JCR-2021), https://arxiv.org/abs/2105.03511.
  4. Bounds for the minimum distance and covering radius of orthogonal arrays via their distance distributions, (with Silvia Boumova and Peter Boyvalenkov), 2022 10th International Workshop on Signal Design and Its Applications in Communications (IWSDA), August 1-5, 2022, University of Essex, Colchester, United Kingdom, Publisher: IEEE, 2022, DOI:10.1109/IWSDA50346.2022.9870612, ISSN(print):2150-3680, ISSN(online):2150-3699, ISBN: 978-1-6654-5298-4, Ref Web of Science, Ref Scopus, Ref IEEE Xplore (9870612).
  5. 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, editor/s: Assoc. Prof. Evgenia Sendova, Ph.D., Tryavna, April 5-9, 2022, pages:100-112, ISSN(print):1313-3330, ISSN(online):1313-3330.
  6. Bounds for spherical codes: The Levenshtein framework lifted, (with P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff), 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 (48/265 Math.App., JCR-2020), Ref Scopus, SJR: 1.95 (2020), Scopus Quartile: Q1 (A&NTh, AppMath, CompMath, 2020), Ref MathSciNet (MR4232226), https://arxiv.org/abs/1906.03062.
  7. Universal Bounds for Size and Energy of Codes of Given Minimum and Maximum Distances, (with P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff), 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 (Q2 134/273 IngEE, Q3 CSc,InfSys, JCR-2020), Ref Scopus, SJR: 1.218 (2020), Scopus Quartile: Q1 (Q1 CScApp, Q1 InfSys, 2020), https://arxiv.org/abs/1910.07274.
  8. Computing distance distributions of ternary orthogonal arrays, (with Silvia Boumova and Tedis Ramaj), Comptes rendus de l'Academie 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 (71/73 Multidisc, JCR-2020), Ref Scopus, SJR: 0.244 (2020), Scopus Quartile: Q2 (2020).
  9. Linear programming bounds for covering radius of spherical designs, (with Peter Boyvalenkov), 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 (Q2 118/330 Math, Q3 159/265 MathApp, JCR-2020), Ref Scopus, SJR: 0.742 (2020), Scopus Quartile: Q2 (Q2 Math; Q2 AppMath (2020), Ref MathSciNet (MR4245484), https://arxiv.org/abs/2007.05599.
  10. Upper bounds for energies of spherical codes of given cardinality and separation, (with Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff), 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 (Q2 116/265 MathApp, Q3 61/110 CST&M, JCR-2020); Ref Scopus, SJR: 0.898 (2020), Scopus Quartile: Q1 (Q1 DMathComb Q2 AppMath, Q1 CScApp); Ref MathSciNet (MR4149372), https://arxiv.org/abs/1909.00981.
  11. On Covering Radius of Orthogonal Arrays, (with Silvia Boumova and Tedis Ramaj), 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 Web of Science, Ref Scopus, Ref IEEE Xplore.
  12. Nonexistence of (17, 108, 3) ternary orthogonal array, (with S. Boumova, T. Marinova and T. Ramaj), 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).
  13. On two problems concerning universal bounds for codes, (with Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin, Edward B. Saff), 2019 XVI International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY 2019), Moscow, Russia, October, 21-25, 2019, pages:58–63, INSPEC Accession Number: 19380412, Electronic ISBN: 978-1-7281-1944-1, Print on Demand (PoD) ISBN: 978-1-7281-1945-8, DOI: 10.1109/REDUNDANCY48165.2019.9003329, Ref IEEE Xplore.
  14. Linear Programming Bounds for Cardinality and Energy of Codes of Given Min and Max Distances, (with Peter Boyvalenkov, Peter Dragnev, Douglas Hardin, Edward Saff), ISIT 2019: The 2019 IEEE International Symposium on Information Theory, Paris, France, July 7-12, 2019, pages: 1747-1751, ISSN: 21578095, INSPEC Accession Number: 19013211, Electronic ISBN:978-1-5386-9291-2, USB ISBN: 978-1-5386-9290-5, Print on Demand(PoD) ISBN: 978-1-5386-9292-9, DOI: 10.1109/ISIT.2019.8849388, Ref Scopus, SJR: 0.91 (2019), Ref IEEE Xplore, paper number 1616.
  15. Upper bounds for energies of codes of given cardinality and separation, (with P. G. Boyvalenkov, P. D. Dragnev, D. P. Hardin, E. B. Saff), The Eleventh International Workshop on Coding and Cryptography (WCC 2019), Saint-Jacut-de-la-Mer, France, from March 31st to April 5th 2019.
  16. Energy Bounds for Codes in Polynomial Metric Spaces, (with Peter Boyvalenkov, Peter Dragnev, Douglas Hardin, Edward Saff), Analysis 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", Received: 18 December 2018, Accepted: 11 April 2019, First Online: 06 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: 2.056 (2019), Web of Science Quartile: Q1 (Q1 22/325 Math, Q1 40/261 MathApp, JCR-2019); Ref Scopus, SJR: 0.593 (2019), Scopus Quartile: Q2 (Q2 AppMath, Q2 CScApp); Ref MathSciNet (MR3977668), https://arxiv.org/abs/1804.07462.
  17. On spherical codes with inner products in a prescribed interval, (with Peter G. Boyvalenkov, Peter D. Dragnev, Douglas P. Hardin D., Edward B. Saff), 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 (Q2 75/261 MathApp, Q2 51/108 CST&M, JCR-2019); Ref Scopus, SJR: 1.174 (2019), Scopus Quartile: Q1 (Q1 DMathComb Q2 AppMath, Q1 CScApp); Ref MathSciNet (MR3911205), https://arxiv.org/abs/1801.07334.
  18. Refinements of Levenshtein bounds in q-ary Hamming spaces, (with Peter Boyvalenkov, Danyo Danev), Problems of Information Transmission, 2018, Vol. 54, Issue 4, pages: 329–342, (Original Russian Text Published in Problemy Peredachi Informatsii, 2018, Vol. 54, Issue 4, pages: 35–50, 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 (Q4 97/104 CST&M, Q4 227/254 MathApp, 2018 JCR-WoS); Ref SCOPUS, SJR: 0.282 (2018), SCOPUS Quartile: Q3 (Q3 CNetwC, Q3 CScApp, Q3 InfSys); Ref MathSciNet (MR3917587), https://arxiv.org/abs/1801.01982.
  19. On ternary orthogonal arrays, (with Silvia Boumova and Tanya Marinova), Proc. Sixteenth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT–16, Svetlogorsk (Kaliningrad region), Russia, September 2-9, 2018, pp.102-105.

Абстракти

  1. Improvements of some bounds for spherical designs with odd strength and odd size, (with Peter Boyvalenkov), Annual Workshop on Coding Theory and Applications, Gabrovo, Bulgaria, 15-18 December, 2011, р. 20.
  2. On the structure of some spherical designs,(with Peter Boyvalenkov), Abstract Booklet, International Congress in Honour of Professor H. M. Srivastava on his 70th Birth Anniversary at Uludag University, Bursa, Turkey, 18-21 August, 2010, N: 98, p. 117.
  3. On the structure of some spherical 4-designs, (with Peter Boyvalenkov), Annual Workshop on Coding Theory and Applications, Bachinovo (near to Blagoevgrad), Bulgaria, 26-29 November, 2009, (to appear).
  4. Improvements of some asymptotic bounds for spherical (2k-1)-designs,(with Peter Boyvalenkov), MASSEE, International Congress on Mathematics MICOM 2009, Ohrid, Republic of Macedonia, 16-20 September, 2009, p. 18.
  5. New asymptotic bound on the minimum possible odd cardinality of spherical (2k-1)-designs, (with Peter Boyvalenkov), Annual Workshop on Coding Theory and Applications, Veliko Turnovo, Bulgaria, 11-14 December, 2008 (to appear).
  6. New nonexistence results for spherical 3-designs, (with Silvia Boumova, Peter Boyvalenkov), Annual Workshop on Coding Theory and Applications, Borovetz, Bulgaria, 15-17 November, 2007 (to appear).
  7. Bounds on inner products of spherical designs, pdf, (with Peter Boyvalenkov, Hristina Kulina), Annual Workshop on Coding Theory and Applications /Abstracts/, Bachinovo (near to Blagoevgrad), Bulgaria, 30 November - 03 December, 2006, p. 8.
  8. Bounds on the covering radius of spherical designs, pdf, (with Peter Boyvalenkov), MASSEE International Congress on Mathematics MICOM 2006, /Abstracts/, Cyprus, May 31 - June 4, 2006.
  9. Bounds on the covering radius of spherical designs, pdf, (with Peter Boyvalenkov), Annual Workshop on Coding Theory and Applications /Abstracts/, Bankya, Bulgaria, 15-18 December, 2005, p. 9.
  10. On the structure of spherical 2k-designs of relatively small cardinalities, pdf, (with Peter Boyvalenkov), Annual Workshop on Coding Theory and Applications /Abstracts/, Bankya, Bulgaria, 11-14 December, 2003, p. 10.
  11. On the structure of a class of spherical designs, pdf, (with Peter Boyvalenkov), International Congress MASSEE'2003, /Abstracts/, Borovets, Bulgaria, 15-21 September, 2003, p. 160.
  12. On the structure of some spherical designs, pdf, (with Peter Boyvalenkov), Annual workshop on Coding Theory and Applications /Abstracts/, Bankya, Bulgaria, 11-15 December, 2002, p. 13.

Доклади на конференции

  1. Seventh International Workshop on Optimal Codes and Related Topics, Albena, Bulgaria, 6-12 September, 2013.
  2. Thirteenth International Workshop on Algebraic and Combinatorial Coding Тheory, Pomorie, Bulgaria, 15-21 June, 2012.
  3. International Congress in Honour of Professor H. M. Srivastava on his 70th Birth Anniversary at Uludag University, Bursa, Turkey, 18-21 August, 2010.
  4. MASSEE International Congress on Mathematics MICOM 2009, Ohrid, Republic of Macedonia, 16-20 September, 2009.
  5. Sixth International Workshop on Optimal Codes and Related Topics, Varna, Bulgaria, 16-22 June, 2009.
  6. Eleventh International Workshop on Algebraic and Combinatorial Coding Тheory, Pamporovo, Bulgaria, 16-22 June, 2008.
  7. Fifth International Workshop on Optimal Codes and Related Topics, White Lagoon, Bulgaria, 16-22 June, 2007.
  8. Tenth International Workshop on Algebraic and Combinatorial Coding Тheory, Zvenigorod, Russia, 3-9 September, 2006.
  9. International Conference Pioneers of Bulgarian Mathematics, Sofia University ”St. Kliment Ohridski”, Faculty of Mathematics and Informatics, Sofia, Bulgaria, 8-10 July, 2006.
  10. Fourth International Workshop on Optimal Codes and Related Topics, Pamporovo, Bulgaria, 17-23 June, 2005.
  11. Ninth International Workshop on Algebraic and Combinatorial Coding Тheory, Kranevo, Bulgaria, 19-25 June, 2004.
  12. Eighth International Workshop on Algebraic and Combinatorial Coding Тheory, Tsarskoe Selo, Russia, 8-14 September, 2002.
  13. Twenty Second Spring Conference of UBM, Sofia, 2-5 April, 1993.
ФМИ  |  Home  |  Top