Diskrētā matemātika / Discrete mathematics

Wednesday 14 Feb 2024, 14:00 → 17:35 Europe/Riga

Zinātņu māja / House of Science (Klātienē)

Jānis Buls (prof.)

LV: Sekcijas sēde veltīta diskrētajai matemātikai, kas pēta galīgas un pārskaitāmas bezgalīgas objektu sistēmas un dažāda veida sakarības. Šai nozarei ir arī vairākas apakšnozares, tai skaitā matemātiskā loģika, skaitļu teorija, algoritmu un automātu teorija, kombinatorika, grafu teorija, kodēšanas teorija, dažādas teorētiskās datorzinātnes apakšnozares.

ENG: The section session is devoted to discrete mathematics, which explores finite and transferable infinite systems of objects and various kinds of relations. The branch also has several sub-branches, including mathematical logic, number theory, algorithm and automata theory, combinatorics, graph theory, coding theory, various sub-branches of theoretical computer science.

Valoda/Language: Latviešu & English

Vadītāji/Chairs: dr. math. J. Buls, doc. (assist. prof.) R. Bēts

Programma_DM24.pdf

14:00 → 17:35 Discrete Mathematics: Diskrētā matemātika

Conveners: Jānis Buls (Latvijas Universitāte), Raivis Bēts (Latvijas Universitāte)

14:00 Atklāšana

Jānis Buls

14:05 Examples (Analysis) of Non-Classical Games in Combinatorial Geometry

Some games using polyforms (pentominoes, hexiamonds) are considered.

Speaker: Andrejs Cibulis

Cibulis_Thesis_2024.pdf

14:35 APE-Shapes – Polyominoes, Polyiamonds and Polyhexes

The talk will deal with the question of what values the number of edges
can take for APE-polygons on square, triangular and hexagonal grids.

Speaker: Elīna Buliņa

Bulina_Cibulis_abstract_tex.pdf

15:05 Families of Perfect Polyiamonds as Formal Languages

We study n-polyiamonds with the restriction: Their sides lengths are all numbers between 1 and n in this order. Each polyiamond has a unique encoding in a 6-letter alphabet. We study formal grammars to describe interesting families of such polyiamonds.

Speaker: Kalvis Apsītis (University of Latvia)

abstract_polyiamonds_2024-02-14.pdf

15:35 A generalization of differences and connections to weak BCK-algebras

We investigate conditions under which a poset equipped with a weak difference gives rise to a weak BCK-algebra whose subtraction operation coincides with the weak difference for comparable elements.

Speaker: Insa Kremere

abstract_Insa_Krēmere-1-1.pdf

16:05 Konveijera lenšu problēma

Speaker: Aigars Valainis (Latvijas Universitāte)

16:35 Galīgi gredzeni un formālās pakāpju rindas

Speaker: Jānis Buls (Latvijas Universitāte)

LU_24anot.pdf

17:05 Noslēgums, diskusijas