FMFI Kalendár

Vyhlásenie voľby dekana FMFI UK

Robert.Kysel@fmph.uniba.sk — Thu, 31 Dec 2026 00:00:00 +0100

AS FMFI UK na svojom zasadnutí dňa 18.5.2026 schválil uznesenie o vyhlásení voľby dekana FMFI UK na...

]]>

Doktorandské kolokvium KAI - Pavol Kollár (26.10.2026)

Damas.Gruska@fmph.uniba.sk — Thu, 22 Oct 2026 10:19:00 +0200

Prednášajúci: Pavol Kollár Názov: How do computers assist in Graph Theory? Termín: 26.10.2026, 13:10 hod., I 9
Abstrakt:
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 "Petersen colouring conjecture" 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 "classical" 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. Stránka seminára Youtube kanál seminára

Matematik Kollár: Proti AI nemáme šancu, môžeme len vyvinúť stroje, ktoré zápas s ňou vybojujú za nás

webmaster@fmph.uniba.sk — Wed, 21 Oct 2026 13:50:00 +0200

20.10.2026, dennikn.sk. Denník N sa rozprával s matematikom Richardom Kollárom Z FMFI UK o vplyve...

]]>

Seminár z algebraickej teórie grafov - Aihua Li (23.10.2026)

Martin.Macaj@fmph.uniba.sk — Wed, 21 Oct 2026 07:40:00 +0200

Prednášajúci: Dr. Aihua Li (Montclair State University, USA) Názov prednášky: Interlace Polynomials of Simple Graphs and Recent Development Termín: 23.10.2026, 13:15 hod., M IX, MS Teams
Abstrakt:
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.

Seminár z teórie grafov - Gil Puig Surroca (22.10.2026)

Martin.Skoviera@fmph.uniba.sk — Tue, 20 Oct 2026 12:24:00 +0200

Prednášajúci: Gil Puig Surroca Názov prednášky: Dichoosability of graphs with high choosability Termín: 22.10.2026, 9:50 hod., M 213
Abstrakt:
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. Stránka seminára

Docent na KEF (výberové konanie)

Adriana.Kohutova@fmph.uniba.sk — Fri, 16 Oct 2026 20:27:00 +0200

Univerzita Komenského v Bratislave, Fakulta matematiky, fyziky a informatiky, Mlynská dolina, 842 48 Bratislava v zastúpení jej dekanom prof. RNDr. Danielom Ševčovičom, DrSc., vypisuje v súlade so zákonom č. 131/2002 Z. z. o vysokých školách výberové konanie na obsadenie miesta vysokoškolského učiteľa - docenta na Katedru experimentálnej fyziky Požiadavky:

vysokoškolské vzdelanie tretieho stupňa v odbore Fyzika plazmy
pedagogické zameranie na predmety študijného programu Fyzika plazmy a príbuzný programy
vedecká činnosť vo vednom odbore Fyzika plazmy a príbuzných odboroch
publikačná činnosť vo vednom odbore Fyzika plazmy

Úväzok: 100 %
Nástup: 1.1.2027 Výberové konanie sa bude konať formou pohovoru. Obsadzovanie funkcií profesorov a docentov na UK sú zverejnené vo vo Vnútornom predpise č. 23/2021 čl. 108, Vnútornom predpise č. 19/2022 a Vnútornom predpise č. 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 vzdelaní a odbornej praxi, prehľadom pedagogických, publikačných, vedecko-výskumných aktivít a súhlasom o 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

prof. RNDr. Daniel Ševčovič DrSc.
dekan fakulty

Seminár z fyziky kondenzovaných látok - František Herman (22.10.2026)

Roman.Martonak@fmph.uniba.sk — Fri, 16 Oct 2026 19:59:00 +0200

Prednášajúci: Mgr. František Herman, PhD. Názov: Two-lifetime model for the cuprates reimagined Termín: 8.10.2026, 14:00 hod., F1/108
Abstrakt:
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. Note: 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.

Iveta Waczulíková laureátkou ESET Science Award 2026

webmaster@fmph.uniba.sk — Fri, 16 Oct 2026 19:49:00 +0200

V kategórii Výnimočná osobnosť vysokoškolského vzdelávania pri tohtoročnom udeľovaní cien ESET...

]]>

Od artefaktov k dátam: Počítačom asistované reštaurovanie

webmaster@fmph.uniba.sk — Thu, 15 Oct 2026 15:14:00 +0200

14.10.2026, quark.sk. Súčasné počítačové technológie umožňujú skúmať, dokumentovať a reštaurovať...

]]>

Doktorandské kolokvium KAI - Ján Pastorek (19.10.2026)

Damas.Gruska@fmph.uniba.sk — Wed, 14 Oct 2026 12:33:00 +0200

Prednášajúci: Ján Pastorek Názov: AI4math. Towards automated graph theory? A quest for interesting mathematical questions and conjectures in the age of AI. Termín: 19.10.2026, 13:10 hod., I 9
Abstrakt:
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 "avalanche of triviality," 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. Stránka seminára Youtube kanál seminára