Univerza na Primorskem Fakulteta za matematiko, naravoslovje in informacijske tehnologije
SI | EN

Raziskovalni matematični seminar - Arhiv

2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010
1 2 3 4 5 6 7 8 9 10 11 12
Datum in ura / Date and time: 29.11.21
(10:00 -- 11:00)
Predavalnica / Location: FAMNIT-MP1 & ZOOM
Predavatelj / Lecturer: Luke Morgan (University of Primorska, Slovenia)
Naslov / Title: Star normal quotients and twisted wreath quasiprimitive groups
Vsebina / Abstract:

I'll present some joint work with Eda Kaja in which we have constructed a new infinite family of locally transitive graphs. For a given graph in this family, the full automorphism group has two orbits on the vertex set, on one orbit the action is quasiprimitive of Twisted Wreath type and on the other orbit the action is not quasiprimitive. Thus these graphs fall into the class of `star normal quotients'. Previously only one such example was known.

  We are looking forward to meeting you at FAMNIT-MP1. 

This Monday, November 29,  2021, from 10 am to 11 am.

 

Our Math Research Seminar will also be broadcasted via Zoom.

Join Zoom Meeting Here.

 

Everyone is welcome and encouraged to attend.

  


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 induces a subgraph with independence number at most k. If a graph is given together with a tree decomposition with a bounded independence number, then the Maximum Weight Independent Set (MWIS) problem can be solved in polynomial time. Motivated by this observation, we consider six graph containment relations---the subgraph, topological minor, and minor relations, as well as their induced variants---and for each of them characterize the graphs H for which any graph excluding H with respect to the relation admits a tree decomposition with bounded independence number. Furthermore, using a variety of tools including SPQR trees and potential maximal cliques, we show how to obtain such tree decompositions efficiently.

As an immediate consequence, we obtain that the MWIS problem can be solved in polynomial time in an infinite family of graph classes that properly contain the class of chordal graphs. In fact, our approach shows that the Maximum Weight Independent H-Packing problem, a common generalization of the MWIS and the Maximum Weight Induced Matching problems, can be solved in polynomial time in these graph classes.

This is joint work with Martin Milanič and Kenny Štorgel.

We are looking forward to meeting you at FAMNIT-MP1. 

This Monday, November 22,  2021, from 10 am to 11 am.

Our Math Research Seminar will also be broadcasted via Zoom.

Join Zoom Meeting Here.

 Everyone is welcome and encouraged to attend.


Datum in ura / Date and time: 8.11.21
(10:00 -- 11:00)
Predavalnica / Location: FAMNIT MP1
Predavatelj / Lecturer: Bojan Kuzma ( University of Primorska, Slovenia)
Naslov / Title: What does Birkhoff-James orthogonality know about the norm?
Vsebina / Abstract:

There are several possibilities to  generalize the relation of orthogonality from Euclidean to arbitrary normed spaces. Among the better known is Birkhoff-James orthogonality, which is defined, in one of the equivalent ways, as $x \perp y$ if  $y$ lies in the kernel of the supporting functional for $x$. This relation is homogeneous in both factors, but unlike Euclidean space it is not necessarily additive nor symmetric. We assign a (directed) graph to this  relation with  the nonzero vectors as the nodes  and where each pair of  orthogonal vectors forms a directed edge.

With the help of this graph one can show that Birkhoff-James orthogonality alone knows how to calculate the  dimension of  the underlying space, it knows whether the norm is smooth or not and whether it  is strictly convex or not, and actually knows everything about the norm of smooth reflexive spaces  up to (conjugate) linear isometry.

Among possible  applications we mention the study of homomorphisms of the relation (i.e. not necessarily linear mappings that preserve orthogonality).

This is a joint work with  Lj. Arambašić, A. Guterman, R. Rajić, and S. Zhilina
 

  We are looking forward to meeting you at FAMNIT-MP1. 

This Monday, November 8,  2021, from 10 am to 11 am.

Our Math Research Seminar will also be broadcasted via Zoom.

Join Zoom Meeting Here.

 

Everyone is welcome and encouraged to attend.


Datum in ura / Date and time: 15.11.21
(10:00 -- 11:00)
Predavalnica / Location: FAMNIT MP1
Predavatelj / Lecturer: René Rodríguez Aldama (University of Primorska, Slovenia)
Vsebina / Abstract:
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 1998, Ashikhmin and Barg gave a sufficient condition for a code to be minimal. There were no known examples of infinite families of minimal codes violating the Ashikhmin-Barg condition until a recent breakthrough by Ding et al. in 2018.
 
In this talk, we present general methods for constructing infinite families of minimal binary codes based on natural concepts related to Boolean functions such as the direct sum (bent concatenation) and the use of derivatives. Moreover, we introduce non-covering permutations that allow us to construct minimal codes violating the Ashikhmin-Barg condition. If time permits, we'll discuss generalizations of this framework to the non-binary case. This is joint work with E. Pasalic, Y. Wei, and F. Zhang.
 

  We are looking forward to meeting you at FAMNIT-MP1. 

This Monday, November 8,  2021, from 10 am to 11 am.

Our Math Research Seminar will also be broadcast via Zoom.

Join Zoom Meeting Here.

See you there!

 Everyone is welcome and encouraged to attend.