10:00 — 11:00 FAMNIT-MP1 & ZOOM Clément Dallard (University of Primorska, Slovenia) Tree decompositions with bounded independence number The independence number of a tree decomposition T of a graph is the smallest integer k such that each bag of T…
2021-11-08 10:00 — 11:00 FAMNIT MP1 Bojan Kuzma ( University of Primorska, Slovenia) What does Birkhoff-James orthogonality know about the norm? There are several possibilities to generalize the relation of orthogonality from Euclidean to arbitrary normed spaces. Among the better…
2021-11-15 10:00 — 11:00 FAMNIT MP1 René Rodríguez Aldama (University of Primorska, Slovenia) Minimal codes form a special class of linear codes characterized by the property that none of the codewords is covered by some other linearly independent codeword. In…
2021-10-04 10:00 — 11:00 Zoom Didem Gözüpek (Gebze Technical University, Turkey) TRIANGLE-FREE EQUIMATCHABLE GRAPHS A graph is called equimatchable if all of its maximal matchings have the same size. Frendrup et.al. provided a characterization of equimatchable graphs with girth at…
2021-10-11 10:00 — 11:00 Zoom Galina Filipuk (University of Warsaw, Poland) ASPECTS OF NONLINEAR DIFFERENTIAL EQUATIONS In this talk I shall speak about Painleve equations, special nonlinear differential equations of second order, that appear in many applications. I shall explain…
2021-10-18 10:00 — 11:00 Zoom Yushi Uno ( Osaka Prefecture University, Japan) Gounds: a sliding-block puzzle with turning We propose a new kind of sliding-block puzzle, called Gourds, where the objective is to rearrange 1 x 2 pieces on a hexagonal grid…
2021-07-27 17:00 — 18:00 Zoom Sarobidy Razafimahatratra (University of Regina, Canada) The Erdos-Ko-Rado theorem for transitive groups A set of permutations $\mathcal{F}$ of a finite transitive group $G\leq \sym(\Omega)$ is \emph{intersecting} if any two permutations in $\mathcal{F}$ agree on an…
2021-07-26 11:00 — 12:00 Zoom Milad Ahanjideh (Bogazici University, Turkey ) On intersecting sets of groups Let $\Omega$ be a finite set and $G$ be a permutation group on it. A subset $A$ of $G$ is \textit{intersecting} if for every…
2021-06-17 10:00 — 11:00 FAMNIT-VP1 & ZOOM Besfort Shala The Probabilistic Zeta Function of a Finite Lattice Let G be a finite group and let P(G, s) be the probability that an s-tuple of elements in G generate G. Due…
2021-05-31 10:00 — 11:00 Zoom Michael Vyalyi (HSE University , Russia) Re-pairing brackets The re-pairing problem is a recently discovered combinatorial problem concerning Dyck words. We have first identified the re-pairing problem when studying an open question in automata theory,…