Raziskovalni matematični seminar - Arhiv
| 2024 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 |
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
In a flexible (n_k) configuration at least one configuration line has the property that its k configuration points may be placed on it in k predetermined positions, while rearranging the rest of configuration in such a way that the point-line incidences are preserved.
We will show some useful applications of this concept in connection with Grünbaum incidence calculus. In particular, we will give a proof that for any k and for each sufficiently large number n, there exists an (n_k) configuration of points and lines.
This is joint work in progress with Leah Berman and Gábor Gévay.
Everyone is welcome and encouraged to join the video-lecture through the following link:
https://us02web.zoom.us/j/
The talk starts with the brief introduction of Mechanism Design theory, with particular focus on dominant strategy incentive compatible mechanisms. Next, the joint work with Prof. Dr. J. Čopič and Dr. M. Castellani is presented. We study the bilateral trade problem under no subsidies constraint which has not been explored much due to its complexity. In our setting, there are two traders, i.e., a seller and a buyer, one indivisible good, and a market maker. The traders have private valuations over one indivisible good and have a scarce information. A market maker is in full command of the choice of market platform and has no private information. We consider market equilibrium mechanisms, among which a special attention is devoted to stochastic bid-ask mechanisms. We conclude with an example that shows that in general a mechanism that maximizes a social welfare function may lie outside the set of simple posted prices mechanisms.
Link Zoom: https://us02web.zoom.us/j/86227923652
Terwilliger algebra of a commutative association scheme was successfully used for studying distance-regular graphs. However, this notion can be easily generalized to an arbitrary finite, simple and connected graph. In many instances, this algebra can be better studied via its irreducible modules. In this talk, we show how to relate the module structure of the Terwilliger algebra of a graph with the concept of local distance-regularity. Finally, we investigate how this algebra can be used as an effective tool for studying some combinatorial properties in the graph.
This is joint work with Stefko Miklavic.
Nut graphs are singular graphs of nullity one with full corresponding eigenvector. Recently, the existence problem of regular nut graphs was successfully addressed. In this talk, we present a generalisation of nut graphs to signed nut graphs and give some preliminary results of their existence. In particular, Fowler construction, switching equivalence and connection to double covers will be presented.
This is work in progress with Patrick W. Fowler, Irene Sciricha and Nino Bašić.
Link for the Conference: https://us02web.zoom.us/j/87925579576
