<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    
    <title>FMFI Kalendár</title>
    <link>https://fmph.uniba.sk/</link>
    <description>FMFI Kalendár</description>
    <language>sk</language>
    <image>
      <title>FMFI Kalendár</title>
      <url>https://fmph.uniba.sk/</url>
      <link>https://fmph.uniba.sk/</link>
      <width></width>
      <height></height>
      <description>FMFI Kalendár</description>
    </image>
    <generator>TYPO3 - get.content.right</generator>
    <docs>http://blogs.law.harvard.edu/tech/rss</docs>
    
    
    
    
    
    
    <item>
      <title>Doktorandské kolokvium KAI - Pavol Kollár (26.10.2026)</title>
      <link>http://fmph.uniba.sk/detail-novinky/back_to_page/fakulta-matematiky-fyziky-a-informatiky-uk/article/doktorandske-kolokvium-kai-pavol-kollar-26102026/</link>
      <description>v pondelok 26.10.2026 o 13:10 hod. v miestnosti I 9<![CDATA[<p></p><img src="http://fmph.uniba.sk/uploads/pics/Kollar_Pavol_02.jpeg" width="1992" height="1415" alt="">]]></description>
<content:encoded><![CDATA[<img src="http://fmph.uniba.sk/uploads/pics/Kollar_Pavol_02.jpeg" width="1992" height="1415" alt=""><p></p><em>Prednášajúci:</em> <strong>Pavol Kollár</strong>
<em>Názov: </em><strong>How do computers assist in Graph Theory?</strong>
<em>Termín:</em> <strong>26</strong><strong>.10.2026, 13:10 hod., I 9</strong>
<br /><em>Abstrakt:<br /></em>Graph theory and graphs specifically pop up all over the place in the world; from road and social networks, scheduling problems, all the way to dependency structures. Recently, with all the incredible new results and supposed results from AI - i.e. computers - computer-assisted graph theory becomes more relevant than ever. For example, during the summer of 2026 the long standing and famous &quot;Petersen colouring conjecture&quot; has been disproven by an example conjured up by AI, which was the catalyst for proper examination and lead to an improved and fully proved result. 
 In this talk, we will report on our previous progress and show two graph theory problems that can be computer-assisted in the more &quot;classical&quot; sense - using algorithms to compute properties about specified graphs and exhaustively enumerate all graphs of a specified type. Of course, using just any algorithm is bound to fail, because the space of possibilities in these problems is too vast. And when simple ideas and brute force fail, clever ideas come out of hiding.&nbsp;
<link https://dai.fmph.uniba.sk/w/Doctoral_Colloquia/en _blank - "stránka seminára"><em>Stránka seminára</em></link>
<link https://www.youtube.com/playlist?list=PLxbJiPfmm2bS_FGl0Q0z8N80Sr1ghAv71 _blank><em>Youtube kanál seminára</em></link>

]]></content:encoded>
      <category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
      <author>Damas.Gruska@fmph.uniba.sk</author>
      <pubDate>Mon, 26 Oct 2026 13:10:00 +0100</pubDate>
      
    </item>
    
    <item>
      <title>Seminár z algebraickej teórie grafov - Aihua Li (23.10.2026)</title>
      <link>http://fmph.uniba.sk/detail-novinky/back_to_page/fakulta-matematiky-fyziky-a-informatiky-uk/article/seminar-z-algebraickej-teorie-grafov-aihua-li-23102026-1/</link>
      <description>v piatok 23.10.2026 o 13:15 hod. v miestnosti M IX (aj online)<![CDATA[<p></p><img src="http://fmph.uniba.sk/uploads/pics/ikonka_seminar_38ad1f.jpg" width="462" height="200" alt="">]]></description>
<content:encoded><![CDATA[<img src="http://fmph.uniba.sk/uploads/pics/ikonka_seminar_38ad1f.jpg" width="462" height="200" alt=""><p></p><em>Prednášajúci:</em> <strong>Dr. Aihua Li&nbsp;</strong>(Montclair State University, USA)
<em>Názov prednášky:</em> <strong>Interlace Polynomials of Simple Graphs and Recent Development<em></em></strong>
<em>Termín:</em> <strong>23.10.2026, 13:15 hod., M IX, <link https://teams.microsoft.com/l/meetup-join/19%3aab9b9a6df36b48c19de038da7d507095%40thread.tacv2/1602753426605?context=%7b%22Tid%22%3a%22ce31478d-6e7a-4ce7-8670-a5b9d51884f9%22%2c%22Oid%22%3a%2229de710c-24a4-4d42-942c-7c69b9656568%22%7d _blank>MS Teams</link></strong>
<em><br />Abstrakt:<br /></em>In this talk, the speaker will introduce the concept of interlace polynomials of simple graphs.  Graph polynomials encode graph-theoretical information and useful graph parameters of the underlying graph in various ways. The study of interlace polynomials emphasizes an interdisciplinary approach through both theoretical and applied research. It integrates advanced techniques from combinatorics and algebra to develop graphical properties of the selected graphs.  The speaker will introduce the recent development in this direction including activities from research communities in the United States.

]]></content:encoded>
      <category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
      <author>Martin.Macaj@fmph.uniba.sk</author>
      <pubDate>Fri, 23 Oct 2026 13:15:00 +0200</pubDate>
      
    </item>
    
    <item>
      <title>Seminár z teórie grafov - Gil Puig Surroca (22.10.2026)</title>
      <link>http://fmph.uniba.sk/detail-novinky/back_to_page/fakulta-matematiky-fyziky-a-informatiky-uk/article/seminar-z-teorie-grafov-gil-puig-surroca-22102026/</link>
      <description>vo štvrtok 22.10.2026 o 9:50 hod. v miestnosti M 213<![CDATA[<p></p><img src="http://fmph.uniba.sk/uploads/pics/ikonka_seminar_c9df11.jpg" width="462" height="200" alt="">]]></description>
<content:encoded><![CDATA[<img src="http://fmph.uniba.sk/uploads/pics/ikonka_seminar_c9df11.jpg" width="462" height="200" alt=""><p></p><em>Prednášajúci:</em> <strong>Gil Puig Surroca</strong>
<em>Názov prednášky:</em> <strong>Dichoosability of graphs with high choosability</strong>
<em>Termín:</em> <strong>22</strong><strong>.10.2026, 9:50 hod., M 213</strong>
<em><br />Abstrakt:<br /></em>A conjecture of Erdős and Neumann-Lara from 1979 says that, if every orientation of a graph G can be partitioned into k acyclic subgraphs, then the chromatic number of G is at most f(k), where f is a function that is independent of G. We will discuss the list version of this conjecture, and explain how it can be approached using ideas of Alon about the choosability of graphs with large minimum degree. 
Joint work with Ararat Harutyunyan and Lucas Picasarri-Arrieta.&nbsp;
<em><link http://new.dcs.fmph.uniba.sk/index.php/Seminare/SeminarZTeorieGrafov _blank - "Stránka Seminára z teórie grafov">Stránka seminára</link></em>]]></content:encoded>
      <category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
      <author>Martin.Skoviera@fmph.uniba.sk</author>
      <pubDate>Thu, 22 Oct 2026 09:50:00 +0200</pubDate>
      
    </item>
    
    <item>
      <title>Docent na KEF (výberové konanie)</title>
      <link>http://fmph.uniba.sk/detail-novinky/back_to_page/fakulta-matematiky-fyziky-a-informatiky-uk/article/docent-na-kef-vyberove-konanie-4/</link>
      <description>Fakulta matematiky, fyziky a informatiky vypisuje výberové konanie na obsadenie miesta docenta na...<![CDATA[<p></p>]]></description>
<content:encoded><![CDATA[<p></p>Univerzita Komenského v&nbsp;Bratislave, Fakulta matematiky, fyziky a&nbsp;informatiky, Mlynská dolina, 842 48 Bratislava v&nbsp;zastúpení jej dekanom prof. RNDr. Danielom Ševčovičom, DrSc., vypisuje v&nbsp;súlade so zákonom č. 131/2002 Z. z. o&nbsp;vysokých školách výberové konanie na obsadenie miesta
<strong>vysokoškolského učiteľa - docenta</strong>
na&nbsp;<strong>Katedru experimentálnej fyziky</strong>
<strong>Požiadavky:</strong>
<ul><li>vysokoškolské vzdelanie tretieho stupňa v odbore Fyzika plazmy</li><li>pedagogické zameranie na predmety študijného programu Fyzika plazmy a príbuzný programy</li><li>vedecká činnosť vo vednom odbore Fyzika plazmy a príbuzných odboroch</li><li>publikačná činnosť vo vednom odbore Fyzika plazmy</li></ul>
<strong>Úväzok:&nbsp;</strong>100 %<br /><strong>Nástup:</strong>&nbsp;1.1.2027
<em>Výberové konanie sa bude konať formou pohovoru.</em>
Obsadzovanie funkcií profesorov a docentov na UK sú zverejnené vo vo Vnútornom predpise č.&nbsp;23/2021 čl.&nbsp;108, Vnútornom predpise č.&nbsp;19/2022 a Vnútornom predpise č.&nbsp;6/2025
Platové podmienky podľa platných právnych predpisov v súlade so zákonom NR SR č. 553/2003 Z. z. o odmeňovaní niektorých zamestnancov pri výkone práce vo verejnom záujme a o zmene a doplnení niektorých zákonov v znení neskorších predpisov.
Prihlášku do výberového konania spolu so štruktúrovaným životopisom, overenou kópiou dokladov o&nbsp;vzdelaní a odbornej praxi, prehľadom pedagogických, publikačných, vedecko-výskumných aktivít a súhlasom o&nbsp;spracovaní osobných údajov zašlite najneskôr do 15 dní od uverejnenia na adresu: 

Univerzita Komenského v Bratislave Fakulta matematiky, fyziky a informatiky Referát personálnej práce Mlynská dolina 842 48 Bratislava

<p class="align-center">prof. RNDr. Daniel Ševčovič DrSc.<br />dekan fakulty</p>]]></content:encoded>
      <category>[FMFI] Výberové konania</category>
			<category>[FMFI] Titulka - široké novinky</category>
			<category>[FMFI] Kalendár</category>
			
      <author>Adriana.Kohutova@fmph.uniba.sk</author>
      <pubDate>Sun, 01 Nov 2026 23:59:00 +0100</pubDate>
      
    </item>
    
    <item>
      <title>Seminár z fyziky kondenzovaných látok - František Herman (22.10.2026)</title>
      <link>http://fmph.uniba.sk/detail-novinky/back_to_page/fakulta-matematiky-fyziky-a-informatiky-uk/article/seminar-z-fyziky-kondenzovanych-latok-frantisek-herman-22102026/</link>
      <description>vo štvrtok 22.10.2026 o 14:00 v posluchárni F1 108<![CDATA[<p></p><img src="http://fmph.uniba.sk/uploads/pics/Herman_Frantisek.png" width="224" height="261" alt="">]]></description>
<content:encoded><![CDATA[<img src="http://fmph.uniba.sk/uploads/pics/Herman_Frantisek.png" width="224" height="261" alt=""><p></p><em>Prednášajúci:</em> <strong>Mgr. František Herman, PhD.&nbsp;</strong>
<em>Názov:</em> <strong>Two-lifetime model for the cuprates reimagined</strong>
<em>Termín:</em> <strong>8<strong>.10</strong></strong><strong>.2026, 14:00 hod., F1/108</strong>
<em><br />Abstrakt:<br /></em>We propose a two-lifetime phenomenological model of the superconducting state of the cuprates, and we show that it explains several salient low-energy features of the measured angle-resolved photoemission spectroscopy (ARPES) spectra. The model enables discrimination between forward- and large-angle scattering and, in addition, gives access to the magnitude of the gap function away from the Fermi surface.
<em>Note:</em> I will try to do things in the simplest way possible. One can expect a lot of figures, maybe a bit of fun. Bring coffee, please, so you can enjoy it :). Highly recommended for all physics students.

]]></content:encoded>
      <category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
      <author>Roman.Martonak@fmph.uniba.sk</author>
      <pubDate>Thu, 22 Oct 2026 14:00:00 +0200</pubDate>
      
    </item>
    
    <item>
      <title>Doktorandské kolokvium KAI - Ján Pastorek (19.10.2026)</title>
      <link>http://fmph.uniba.sk/detail-novinky/back_to_page/fakulta-matematiky-fyziky-a-informatiky-uk/article/doktorandske-kolokvium-kai-jan-pastorek-19102026/</link>
      <description>v pondelok 19.10.2026 o 13:10 hod. v miestnosti I 9<![CDATA[<p></p><img src="http://fmph.uniba.sk/uploads/pics/Pastorek_Jan_05.png" width="313" height="360" alt="">]]></description>
<content:encoded><![CDATA[<img src="http://fmph.uniba.sk/uploads/pics/Pastorek_Jan_05.png" width="313" height="360" alt=""><p></p><em>Prednášajúci:</em>&nbsp;<strong>Ján Pastorek</strong>
<em>Názov:&nbsp;</em><strong>AI4math. Towards automated graph theory? A quest for interesting mathematical questions and conjectures in the age of AI.&nbsp;</strong>
<em>Termín:</em> <strong>19</strong><strong>.10.2026, 13:10 hod., I 9</strong>
<br /><em>Abstrakt:<br /></em>OpenAI, Google DeepMind and Anthropic, along with their LLMs have undeniably demonstrated that math problem solving can be done at scale. Yet, the true open frontier remains autonomous discovery, i.e., knowing which questions are worth asking in the first place. Left unconstrained, computational discovery systems do not fail by getting stuck. They fail by drowning researchers in an &quot;avalanche of triviality,&quot; producing potentially millions of technically true but mathematically uninteresting statements. 
 In this talk, we present results from our recent paper, where I introduce AutoGraphForge, a pipeline designed to autonomously hypothesize, refute, formalize, and verify conjectures in graph theory. The goal of this pipeline has been to find interesting conjectures that cannot be easily proved or disproved by such autonomous computational effort. To separate genuine mathematical interesting statements from combinatorial noise, the system couples counterexample-guided generation with a linear-programming novelty filter to eliminate consequences of a database of known theorems (knowledge base). It then subjects candidates to active counterexample search across hundreds of thousands of (extremal) graphs from our best graph-theoretical databases and by algorithms such as simulated annealing that modify graphs to find such counterexamples. The remaining statements are then exported to the Lean 4 proof assistant to be verified with the help of Lean hammers and LLMs. All partial results such as the effort spent and counterexamples are collected to help us look back and get insight. The hope is to get potentially interesting and somewhat computationally nontrivial statements worth further attention and research. 
 Finally, we will discuss what truly makes a mathematical question interesting.  
<link https://dai.fmph.uniba.sk/w/Doctoral_Colloquia/en _blank - "stránka seminára"><em>Stránka seminára</em></link>
<link https://www.youtube.com/playlist?list=PLxbJiPfmm2bS_FGl0Q0z8N80Sr1ghAv71 _blank><em>Youtube kanál seminára</em></link>

]]></content:encoded>
      <category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
      <author>Damas.Gruska@fmph.uniba.sk</author>
      <pubDate>Mon, 19 Oct 2026 13:10:00 +0200</pubDate>
      
    </item>
    
    <item>
      <title>Seminár Katedry teoretickej fyziky - Noel Vincze (27.10.2026)</title>
      <link>http://fmph.uniba.sk/detail-novinky/back_to_page/fakulta-matematiky-fyziky-a-informatiky-uk/article/seminar-katedry-teoretickej-fyziky-noel-vincze-27102026/</link>
      <description>v utorok 27.10.2026 o 14:00 hod. v miestnosti F2/125<![CDATA[<p></p><img src="http://fmph.uniba.sk/uploads/pics/ikonka_seminar_e5b131.jpg" width="462" height="200" alt="">]]></description>
<content:encoded><![CDATA[<img src="http://fmph.uniba.sk/uploads/pics/ikonka_seminar_e5b131.jpg" width="462" height="200" alt=""><p></p><em>Prednášajúci: </em><strong>Noel Vincze&nbsp;</strong>(Fyzikálny ústav SAV)
<em>Názov:</em> <strong>Dark matter and its emergence from topological neutrinos</strong>
<em>Termín:</em> <strong>27</strong><strong>.10.2026, 14:00 hod., miestnosť F2 125</strong>
<em><br />Abstrakt:<br /></em>In this seminar, we develop a novel way to reinterpret the neutrino. Our main focus is on the topological quantity associated with the electroweak anomaly. Integrating out the gauge and fermion fields, except for the neutrinos, we are left with an effective vertex similar to the 't Hooft vertex for quarks. Then, using the gap equation, we generate the neutrino condensate, which, in turn, determines the Majorana mass of neutrinos. The model's predictions are staggering: it provides a clear physical explanation for neutrino mass, mixing, and CP violation and, on the cosmological scale, yields deviations from the established result. Moreover, the model provides a clear identity for neutrinos: they are Majorana particles, and this nature is enforced by the topology of the electroweak vacuum. 
 To establish a connection between dark matter and topological neutrinos, we have to go beyond the condensation and form new composite topological fermions. The proposed particle, the elaphron, is a soliton solution of the neutrino condensate. Its mathematical formulation is based on the Faddeev equation, a well-established method of baryonization. The techniques and steps used to study topological neutrinos are very similar to those used to create mesons and baryons from the quark sea. This new dark matter particle, the elaphron, is a stable, bound state of the neutrino condensate; furthermore, it is topologically protected. With it, we can derive the dark-to-baryonic matter ratio, which has long confounded astrophysics, as well as explore other cosmological applications. ]]></content:encoded>
      <category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
      <author>Peter.Matak@fmph.uniba.sk</author>
      <pubDate>Tue, 27 Oct 2026 14:00:00 +0100</pubDate>
      
    </item>
    
    <item>
      <title>Klub astronómov - Pluto - fascinujúci svet, ktorý už nie je planétou (22.10.2026)</title>
      <link>http://fmph.uniba.sk/detail-novinky/back_to_page/fakulta-matematiky-fyziky-a-informatiky-uk/article/klub-astronomov-pluto-fascinujuci-svet-ktory-uz-nie-je-planetou-22102026-1/</link>
      <description>vo štvrtok 22.10.2026 o 18:00 hod. v posluchárni F1 108<![CDATA[<p></p><img src="http://fmph.uniba.sk/uploads/pics/2026-10-22_bartek.jpg" width="1280" height="720" alt="">]]></description>
<content:encoded><![CDATA[<img src="http://fmph.uniba.sk/uploads/pics/2026-10-22_bartek.jpg" width="1280" height="720" alt=""><p></p><em>Názov prednášky: </em><strong>Pluto - fascinujúci svet, ktorý už nie je planétou</strong>
<em>Prednášajúci:</em> <strong>Mgr. Peter Bartek</strong> (Deutsche Schule Bratislava&nbsp;Observatórium)
Termín: 22.10.2026, 18:00 hod., poslucháreň F1 108
<em>Abstrakt:</em><br />Pluto si ešte mnohí pamätajú ako poslednú z&nbsp;deviatich planét slnečnej sústavy, najmenšiu a najmenej prebádanú, kdesi „tam ďaleko v hlbinách“ na okraji nášho planetárneho systému. Celé desaťročia to bol záhadný studený svet, na ktorom sme nedokázali rozpoznať takmer žiadne povrchové detaily a naše poznatky o&nbsp;ňom pribúdali len veľmi pomaly. Objavy ďalších telies za dráhou Neptúna, najmä tie po roku 2000, ukázali, že Pluto nie je osamelé a že podobne veľkých svetov sa v tejto vzdialenej oblasti nachádza viac. To napokon viedlo až k jeho vyradeniu zo zoznamu planét. V prednáške sa pozrieme na to, ako sa naše poznanie Pluta postupne vyvíjalo – od objavu až po jeho prvé podrobné preskúmanie sondou New Horizons. Zistíme, že je to prekvapivo komplexný svet s pohoriami, ľadovcami, planinami, vlastnou atmosférou a pestrou geológiou. Jeho príbeh zároveň ukazuje, ako sa mení naše chápanie toho, čo to znamená „byť planétou“, a vyvoláva otázky o&nbsp;tom, kde by mali viesť hranice medzi jednotlivými kategóriami telies vo vesmíre a či sú hranice, ktoré im určujeme, vždy také jednoznačné... 
Podujatie je podporené SG-production. Podujatie organizuje Slovenská astronomická spoločnosť pri SAV v&nbsp;spolupráci s&nbsp;Fakultou matematiky, fyziky a informatiky UK.&nbsp;
Vstup na podujatie je voľný. Tešíme sa na vás<br />Link na podujatie:&nbsp;<link https://fb.me/e/6vNvuASHt _blank - "Klub atronómov - prednáška">https://fb.me/e/6vNvuASHt</link>]]></content:encoded>
      <category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
      <author>Patrik.Cechvala@fmph.uniba.sk</author>
      <pubDate>Thu, 22 Oct 2026 18:00:00 +0200</pubDate>
      
    </item>
    
    <item>
      <title>Seminár z teórie grafov - Monica A. Reyes (15.10.2026)</title>
      <link>http://fmph.uniba.sk/detail-novinky/back_to_page/fakulta-matematiky-fyziky-a-informatiky-uk/article/seminar-z-teorie-grafov-monica-a-reyes-15102026/</link>
      <description>vo štvrtok 15.10.2026 o 9:50 hod. v miestnosti M 213<![CDATA[<p></p><img src="http://fmph.uniba.sk/uploads/pics/ikonka_seminar_000d39.jpg" width="462" height="200" alt="">]]></description>
<content:encoded><![CDATA[<img src="http://fmph.uniba.sk/uploads/pics/ikonka_seminar_000d39.jpg" width="462" height="200" alt=""><p></p><em>Prednášajúci:</em> <strong>Monica A. Reyes</strong>
<em>Názov prednášky:</em> <strong>On the Spectrum of Token Graphs and Other Families of Graphs </strong>
<em>Termín:</em> <strong>15</strong><strong>.10.2026, 9:50 hod., M 213</strong>
<em><br />Abstrakt:<br /></em>In this talk, we investigate the spectral properties of token graphs F_k(G) and their relationship with the base graph. The k-token graph of a graph G is the graph whose vertices are the k-subsets of vertices from G, where two vertices are adjacent whenever their symmetric difference is an edge in G.
 Using structural and combinatorial techniques, we analyze how adjacency and Laplacian spectra behave under this construction. Furthermore, we extend these methods to study related configurations, including supertoken graphs and related structures.
 This is a joint work with Cristina Dalfo, Miquel Angel Fiol and Arnau Messegue.&nbsp;
<em><link http://new.dcs.fmph.uniba.sk/index.php/Seminare/SeminarZTeorieGrafov _blank - "Stránka Seminára z teórie grafov">Stránka seminára</link></em>]]></content:encoded>
      <category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
      <author>Martin.Skoviera@fmph.uniba.sk</author>
      <pubDate>Thu, 15 Oct 2026 09:50:00 +0200</pubDate>
      
    </item>
    
    <item>
      <title>Seminár Katedry algebry a geometrie - Viera Glevitzká (16.10.2026)</title>
      <link>http://fmph.uniba.sk/detail-novinky/back_to_page/fakulta-matematiky-fyziky-a-informatiky-uk/article/seminar-katedry-algebry-a-geometrie-viera-glevitzka-16102026/</link>
      <description>v piatok 16.10.2026 o 13:30 hod. v posluchárni F2<![CDATA[<p></p><img src="http://fmph.uniba.sk/uploads/pics/ikonka_seminar_c64198.jpg" width="462" height="200" alt="">]]></description>
<content:encoded><![CDATA[<img src="http://fmph.uniba.sk/uploads/pics/ikonka_seminar_c64198.jpg" width="462" height="200" alt=""><p></p><em>Prednášajúci:&nbsp;</em><strong>Viera Glevitzká</strong>
<em>Názov:</em>&nbsp;<strong>The Snake Lemma (An example of a formalization of mathematics in LEAN)</strong>
<em>Termín:</em> <strong>16.10.2026, 13:30 hod., poslucháreň F2</strong>
<br /><em>Abstrakt:</em>&nbsp;<br />We explain the basics of formalization of mathematics in the programming language LEAN 4. We illustrate it through the statement and proof of the so-called Snake lemma from algebra which was done in our bachelor thesis. The mathematical part only assumes basic knowledge of algebra from any first-year linear algebra course, and no knowledge of programming is assumed. <br /><br />]]></content:encoded>
      <category>[FMFI] Prednášky a semináre</category>
			<category>[FMFI] Kalendár</category>
			
      <author>Tibor.Macko@fmph.uniba.sk</author>
      <pubDate>Fri, 16 Oct 2026 13:30:00 +0200</pubDate>
      
    </item>
    
  </channel>
</rss>