Method to construct groups using group amalgams

2013-03-18 11:00-12:00 FAMNIT-SEMIN Prof. Alexander A. Ivanov (Imperial College London, UK) Method to construct groups using group amalgams It is our pleasure to inform you that there will be a minicourse “Method to construct groups using group amalgams” (5 lectures)…

Construction of G^1 Hermite rational spline motion of degree six

2013-03-18 10:00-11:00 FAMNIT-SEMIN Karla Počkaj Construction of G^1 Hermite rational spline motion of degree six Geometric interpolation techniques have many advantages, such as automatically chosen parametrization, lower degree of interpolants and optimal approximation order. In this talk a geometric continuous…

Obtaining Planarity by Contracting Few Edges

2012-10-15 10:00-11:00 FAMNIT-SEMIN Dr. Pim van ‘t Hof (University of Bergen, Norway) Obtaining Planarity by Contracting Few Edges The contraction of an edge uv in a graph G is the operation that deletes u and v from G, and replaces…

Pentavalent arc-transitive bicirculants

2013-03-04 10:00-11:00 FAMNIT-SEMIN Ademir Hujdurović Pentavalent arc-transitive bicirculants A bicirculant is a graph admitting an automorphism with two cycles of equal length in its cycle decomposition. A graph is said to be arc-transitive if its automorphism group acts transitively on…

Extremal codes in distance-regular graphs with diameter 3

2013-02-25 10:00-11:00 FAMNIT-SEMIN Janoš Vidali (Univerza v Ljubljani, Fakulteta za računalništvo) Extremal codes in distance-regular graphs with diameter 3 We study $1$-codes in distance-regular graphs of diameter $3$ that achieve three different bounds. We show that the intersection array of…

Tutte polytope

2013-02-18 10:00-11:00 FAMNIT-SEMIN Matjaž Konvalinka (UL FMF, Ljubljana) Tutte polytope The Cayley polytope was defined recently as the convex hull of Cayley compositions, introduced by Cayley in 1857. In this talk, I will describe how we resolved Braun’s conjecture, which…

Path algebra and domination problems on graph products

2013-01-14 10:00-11:00 FAMNIT-SEMIN Polona Pavlič (IMFM Ljubljana) Path algebra and domination problems on graph products Using algebraic approach we show that different domination problems on the class of polygraphs can be solved in constant time. As polygraphs include products of…

Accessibility Toolbar