Последни изминали Събития

Семинар “Алгебра и логика”

Институт по математика и информатика - БАН Block 8, 1113 БАН IV км., София

На 28 март 2025 г. (петък) от 13:00 часа в зала 578 на ИМИ и онлайн чрез Zoom ще се проведе хибридно заседание на семинара по „Алгебра и логика”. Доклад на тема: Graded algebras that are the sum of two homogeneous subalgebras ще изнесе Пламен Кошлуков (State University of Campinas, Brazil). Абстракт. Let A be an algebra over a field F, graded by a group G, and let B and C be two homogeneous subalgebras of A such that A=B+C. We study the following problem: If B and C satisfy graded identities, does the same also hold for A? The analogous problem for algebras without any grading was proposed in 1994 by Beidar and Mikhalev; in implicit form it appeared in a paper by O. Kegel, in 1963. Several particular cases were [...]

Семинар на МЦМН

Институт по математика и информатика - БАН Block 8, 1113 БАН IV км., София

Дата: 27.03.2025 г., 16:00 ч. Място: Зала 403, ИМИ - БАН Докладчик: Luis Ugarte, University of Zaragoza, Spain Доклад: Complex structures on Lie algebras and its application to the Hull-Strominger system Допълнителна информация: https://icms.bg/category/icms-seminar/ Резюме. In this talk we will explain the role that the Lie algebras play in the construction of 6-dimensional compact quotient spaces M=G/Γ, where Γ is a lattice, endowed with an invariant complex structure with holomorphically trivial canonical bundle.We will use the approach of stable forms in six dimensions to provide a classification of unimodular Lie algebras admitting a complex structure with non-zero closed (3,0)-form. Some of these spaces can be equipped with balanced Hermitian metrics and they provide invariant solutions of the Hull-Strominger system, even with non-flat connection on [...]

Семинар по Приложна математика

Институт по математика и информатика - БАН Block 8, 1113 БАН IV км., София

About m-ary Gray codes Докладчик: д-р Мария Пашинска, ИМИ - БАН Дата: 27.03.2025 г. Час: 14:00 ч. Място: зала 503 Резюме: We present several systemized implementations of the Gray code over an alphabet with m ≥ 2 elements. Gray codes are widely used in digital communications and effective generation of combinatorial objects. We consider two variants - reflected and modular m-ary Gray codes. We present algorithms for their generation and other important functions such as ranking and unranking and functions for generation of a maximal set of non-proportional vectors of length n over the given alphabet. Some applications of the m-ary Gray codes are also considered. This talk is based on joined work with Stefka Bouyuklieva , Iliya Bouyukliev and Valentin Bakoev.  

Go to Top