Menu: Home :: go to Journal :: switch to Russian :: switch to English
You are here: all Journals and Issues→ Journal→ Issue→ Article

A NOTE ON IMPLICITLY GIVEN HYPERGRAPHS

Annotation

There are described effectively verifiable necessary conditions for the existence of an embedding between edge-weighted hypergraphs given implicitly. The application of the conditions to solve problems of bioinformatics is discussed.

Keywords

hypergraph; embedding; invariant; form

Full-text in one file

Download

UDC

519.178

Pages

1422-1425

References

1. Evdokimov A.A., Kochemazov S.E., Otpushchennikov I.V., Semenov A.A. Issledovanie diskretno-avtomatnykh modeley gennykh setey neregulyarnoy struktury metodami simvol'nykh vychisleniy // Diskret. analiz i issled. operatsiy. 2014. T. 21. № 3. S. 25–40. 2. Shao J., Qi L., Hu S. Some new trace formulas of tensors with applications in spectral hypergraph theory // Linear and Multilinear Algebra. 2015. V. 63. № 5. P. 971–992. 3. Gimadi E.Kh., Istomin A.M., Rykov I.A. O zadache neskol'kikh kommivoyazherov s ogranicheniyami na propusknye sposobnosti reber grafa // Diskret. analiz i issled. operatsiy. 2013. T. 20. № 5. S. 13–30. 4. Glebov A.N., Zambalaeva D.Zh., Skretneva A.A. 2/3 -priblizhennyy algoritm dlya nesimmetrichnoy zadachi o dvukh kommivoyazherakh na maksimum // Diskret. analiz i issled. operatsiy. 2014. T. 21. № 6. S. 11–20. 5. Kuhn D., Lo A., Osthus D., Staden K. The robust component structure of dense regular graphs and applications // Proc. London Math. Soc. 2015. V. 110. № 1. P. 19–56. 6. Kaltofen E. Greatest common divisors of polynomials given by straight-line programs // J. ACM. 1988. V. 35. № 1. P. 231–264. 7. Kaltofen E., Trager B. Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators // J. Symbolic Comput. 1990. V. 9. P. 301–320. 8. Bassalygo L.A. O chisle nenulevykh permanentov nad konechnym polem nechetnoy kharakteristiki // Probl. peredachi inform. 2013. T. 49. № 4. S. 95–97. 9. Gershgorin R.A., Rubanov L.I., Seliverstov A.V. Legko vychislimye invarianty dlya raspoznavaniya giperpoverkhnosti // Informatsionnye protsessy. 2014. T. 14. № 4. S. 365–369. 10. Schwartz J.T. Fast probabilistic algorithms for verification of polynomial identities // J. ACM. 1980. V. 27. № 4. P. 701–717. 11. Bibikov P.V., Lychagin V.V. Klassifikatsiya lineynykh deystviy algebraicheskikh grupp na prostranstvakh odnorodnykh form // DAN. 2012. T. 442. № 6. S. 732–735.

Received

2015-04-09

Section of issue

Scientific articles

Для корректной работы сайта используйте один из современных браузеров. Например, Firefox 55, Chrome 60 или более новые.