Streszczenie. W latach pięćdziesiątych Gagliardo wykazał, że dla obszaru $\Omega$ z
regularnym brzegiem operator śladu z przestrzeni Sobolewa
$W^1_1(\Omega)$ do przestrzeni $L^1(\partial \Omega)$ jest surjekcją.
Zatem naturalne jest pytanie o istnienie prawego odwrotnego operatora
do operatora śladu. Petree udowodnił, że w przypadku półpłaszczyzny
$\mathbb{R}x\mathbb{R}_{+}$ nie istnieje prawy odwrotny operator do
operatora śladu. Podczas referatu przedstawię prosty dowód twierdzenia
Petree, który wykorzystuje tylko pokrycie Whitney'a danego obszaru
oraz klasyczne własności przestrzeni Banacha. Następnie zdefiniujemy
operator śladu z przestrzeni Sobolewa $W^1_1(K)$, gdzie $K$ jest
płatkiem Kocha. Przez pozostałą część mojego referatu skonstruujemy
prawy odwrotny do operatora śladu na płatku Kocha. W tym celu
scharakteryzujemy przestrzeń śladów jako przestrzeń Arensa-Eelsa z
odpowiednią metryką oraz skorzystamy z twierdzenia Ciesielskiego o
przestrzeniach funkcji hölderowskich.
Entropy Weighted Regularisation: A General Way to Debias Regularisation Penalties
Olof Zetterqvist (University of Gothenburg/Chalmers)
Lasso and ridge regression are well established and successful models for variance reduction and, for the lasso, variable selection. However, they come with a disadvantage of an increased bias in the estimator. In this seminar, I will talk about our general method that learns individual weights for each term in the regularisation penalty (e.g. lasso or ridge) with the goal to reduce the bias. To bound the amount of freedom for the model to choose the weights, a new regularisation term, that imposes a cost for choosing small weights, is introduced. If the form of this term is chosen wisely, the apparent doubling of the number of parameters vanishes, by means of solving for the weights in terms of the parameter estimates. We show that these estimators potentially keep the original estimators’ fundamental properties and experimentally verify that this can indeed reduce bias.
Quantum graphs generalize classical graphs by replacing the commutative vertex algebra $C(V)$ with any finite-dimensional C*-algebra equipped with a particular functional. They were originally introduced by Duan, Severini and Winter in the context of Quantum Information Theory. Building on previous research of Weaver on quantum relations, Musto, Reutter and Verdon placed quantum graphs firmly in the world of "quantum mathematics" where they naturally interact with quantum sets, quantum maps and quantum isomorphisms. In this talk, I will give a short introduction into the general theory of quantum graphs without assuming any prior-knowledge. Following that, I will talk about the classification of undirected quantum graphs on the matrix algebra M2 which was obtained independently by Matsuda and Gromada. Finally, I will present recent results on the classification of directed quantum graphs on M2.
Virtual combination of relatively quasiconvex subgroups and separability properties
Ashot Minasyan
Quasiconvex subgroups are basic building blocks of hyperbolic groups, and relatively quasiconvex subgroups play a similar role in relatively hyperbolic groups. If $Q$ and $R$ are relatively quasiconvex subgroups of a relatively hyperbolic group $G$ then the intersection $Q \cap R$ will also be relatively quasiconvex, but the join $\langle Q,R \rangle$ may not be. I will discuss criteria for the existence of finite index subgroups $Q’ \leqslant_f Q$ and $R’ \leqslant_f R$ such that the ``virtual join’’ $\langle Q’, R’ \rangle$ is relatively quasiconvex. This is closely related to separability properties of $G$ and I will present applications to limit groups, Kleinian groups and fundamental groups of graphs of free groups with cyclic edge groups. The talk will be based on joint work with Lawk Mineh.
A sharp criterion and complete classification of global-in-time solutions and finite time blow-up of solutions to a chemotaxis system in supercritical dimensions
Bohr compactification and type-definable connected component of modules, rings and semidirect product of groups
Mateusz Rzepecki
For a model M and a topological space C we say that a map f: M -> C is definable if for any two disjoint closed sets in C their preimages by f are separable by a definable set.
For a definable structure N in a model M we say that f is a definable compactification of N if f is a compactification of N and f is a definable map.
We say that a definable compactification of N is universal if every definable compactification of N factors by f via a continuous map.
It turns out that if N is a group (Gismatullin, Penazzi & Pillay) or a ring (Gismatullin, Jagiella & Krupiński) then N/N^{00}_M is the universal definable compactification of N, where N^{00}_M is the type-definable connected component of N over M.
A module can be represented as N in two ways. The first one is a definable abelian group and a ring that is a part of the language. The second one is a definable abelian group and a definable ring.
This talk: In this talk we will prove that for a definable module N (in both senses) N/N^00_M is a universal definable compactification of N (the definition of N^00_M for a module will be given). We will also analyze how N^00_M depends on the type-definable connected component of the abelian group. To do this we will prove a theorem that shows how connected components help in creating sets that are closed under commutative addition (generalization of the proof by Krzysztof Krupiński for approximate rings). Using the theorem, we will describe the type-definable connected component of modules, rings and semidirect products of groups. We will also show that in many cases of structures analyzed during this talk adding homomorphism/monomorphism/automorphism/differentiation to the structure N does not change the type-definable connected component of N. During the talk we will come across a few open questions.
This is a joint work with Krzysztof Krupiński and is a part of a bigger project with Grzegorz Jagiella.
Limit theorems for Gaussian-fed queueing networks in light and heavy traffic
Nikolai Kriukov (University of Amsterdam)
In this talk we consider a queueing network operating under a strictly upper-triangular routing matrix with per column at most one positive entry. The root node is fed by a Gaussian process with stationary increments. Our aim is to characterize the distribution of the multivariate stationary workload process under a specific scaling of the queue's service rates. In the main results we identify, under mild conditions on the standard deviation function of the driving Gaussian process, in both light and heavy traffic, the limiting law of an appropriately scaled version (in both time and space) of the joint stationary workload process. In particular, we develop conditions under which specific queues of the network effectively decouple, i.e., become independent in the limiting regime.
In this talk, we will discuss the similarities and
differences between ultrafilters and finite additive measures on the
natural numbers, with a particular emphasis on the Rudin-Keisler and
Rudin-Blass orderings and their generalization to measures.