Wiki source code of Postdoc-seminaari

Last modified by schwiege@helsinki_fi on 2024/02/15 12:00
Show last authors
1
2
3 (% style="text-align: center;" %)
4 = Postdoc Seminar =
5
6 (% style="text-align: center;" %)
7 ==== Tuesday 11-12 pm, Room C222 in Exactum ====
8
9 (% style="text-align: center;" %)
10 ===== Short URL: [[bit.do/postdoc>>url:http://bit.do/postdoc||style="font-size: 10.0pt;line-height: 13.0pt;" shape="rect"]] =====
11
12
13
14 The Postdoc Seminar gives postdocs the opportunity to broaden their mathematical horizon and get in contact with other young researchers at the department. While the speakers in the seminar will (with occasional exceptions) be recent PhDs, the talks are intended for a wide audience, and **everyone is most welcome to attend!**
15
16
17
18 |=(((
19 Date
20 )))|=(((
21 Speaker
22 )))|=(((
23 Title & Abstract
24 )))
25 |(% colspan="1" %)(% colspan="1" %)
26 (((
27 (% style="color: rgb(0,0,0);" %)Wed.,(%%) Dec. 10
28 (% style="color: rgb(0,0,0);" %)15-16(%%) pm
29 )))|(% colspan="1" %)(% colspan="1" %)
30 (((
31 [[Åsa Hirvonen>>url:http://www.helsinki.fi/~~asaekman/||shape="rect"]]
32 )))|(% colspan="1" %)(% colspan="1" %)
33 (((
34 {{expand title="Classification theory 'up to perturbation'"}}
35 Classification theory is a branch of model theory that tries to
36 classify the models in a given class by finding various dimensions.
37 Concrete examples of such are the transcendence degree of an algebraically
38 closed field or the linear dimension of a vector space.
39 \\When turning to structures from analysis (e.g. Banach spaces, operators,
40 etc.) new phenomena arise. One is that things looks better if studied 'up
41 to perturbation'. In this talk I will talk about what happens when one
42 attempts classificatio theory 'up to perturbation': which model
43 theoretical methods work, which don't, which ones would I like to attain.
44 {{/expand}}
45 )))
46 |(% colspan="1" %)(% colspan="1" %)
47 (((
48 Nov. 25
49 )))|(% colspan="1" %)(% colspan="1" %)
50 (((
51 [[Henrik Kettunen>>url:https://wiki.helsinki.fi/display/mathstatHenkilokunta/Kettunen,+Henrik||shape="rect"]]
52 )))|(% colspan="1" %)(% colspan="1" %)
53 (((
54 {{expand title="Electromagnetics with negative material parameters"}}
55 The Maxwell equations form the basis of the classical electromagnetic theory. In addition to these famous four equations, we need the constitutive relations, which connect the fields and flux densities to each other by the material parameters, permittivity and permeability. It is very natural to assume that these material parameters are in most cases positive. However, if we allow them to go negative, we face new exciting physical phenomena that have attracted mathematicians, physicists and engineers alike. For example, double-negative materials allow backward wave propagation and negative refraction enabling sub-wavelength focusing of a light beam. If only the electric permittivity is negative, such interfaces can support plasmonic resonances that are sub-wavelength oscillations of electron density excited by the incident light. Noble metals can manifest negative permittivity at visible and ultraviolet frequencies. However, the possibility of constructing double-negative materials has become closer to reality only recently alongside the research of artificial metamaterials.
56 {{/expand}}
57 )))
58 |(% colspan="1" %)(% colspan="1" %)
59 (((
60 Nov. 11
61 )))|(% colspan="1" %)(% colspan="1" %)
62 (((
63 Stefan Wagner
64 )))|(% colspan="1" %)(% colspan="1" %)
65 (((
66 {{expand title="Jouko Mickelsson or: How I learned to stop worrying and love the gerbe"}}
67 The word "gerbe" is an odd one-it is not a furry little animal, nor a hip slang word used to indicate your disrespect towards someone. In fact, it derives instead from a french word in common use and got absorbed by English language. The Oxford English dictonary gives "something resembling a sheaf of wheat" and "something resembling a sheaf" is quite close to the mathematical meaning of the word. In this talk I plan to give a short insight in the theory of gerbes and its connection to cohomology.
68 {{/expand}}
69 )))
70 |(% colspan="1" %)(% colspan="1" %)
71 (((
72 Oct. 23
73 )))|(% colspan="1" %)(% colspan="1" %)
74 (((
75 Oleg Ivrii
76 )))|(% colspan="1" %)(% colspan="1" %)
77 (((
78 {{expand title="A personal journey through hyperbolic geometry"}}
79 In this talk, I will discuss how I came to know and like hyperbolic geometry. I will discuss a few results which I think are absolutely striking such as Poincaré's reflection theorem and Mostow rigidity. Time permitting, I will say a few words about Sullivan's dictionary and discuss some parallel ideas in complex dynamics.
80 {{/expand}}
81 )))
82 |(((
83 Oct. 7
84 )))|(((
85 Ismael Rodrigo Bleyer
86 )))|(((
87 {{expand title="Digital speech: an application of the dbl-RTLS method for solving GIF problem"}}
88 "Digital Speech Processing" refers to the study of a speech signal. Namely, these signals are processed in a digital representation, as for example, synthesis, analysis, enhancement, compression and recognition may refers to this process.
89 \\In this talk we are interested on solving the core problem known as "Glottal Inverse Filtering" (GIF). Commonly this problem can be modelled by convolving a pressure function (input signal) with an impulse response function (filter). Our approach is done in a deterministic setup based on the dbl-RTLS (double regularised total least squares) approach introduced recently. Additionally we review briefly the methodology and we give the first numerical realisations, based on an alternating minimisation procedure.
90 {{/expand}}
91 )))
92
93
94
95
96
97 {{panel bgColor="white" borderStyle="solid"}}
98 (% class="p1" %)
99 Prospective Speaker, if you are interested in giving a talk in the seminar, please do not hesitate to contact [[Miren Zubeldia>>url:https://wiki.helsinki.fi/display/mathstatHenkilokunta/Zubeldia,+Miren||shape="rect"]], [[Konstantin Izyurov>>url:https://wiki.helsinki.fi/display/mathphys/Izyurov||shape="rect"]], or [[Kay Schwieger>>url:https://wiki.helsinki.fi/display/mathphys/kay||shape="rect"]].
100
101 (% class="p1" style="margin-left: 60.0px;" %)
102 //Brief instructions: The allotted 45 minutes go by quickly. Considering the mixture of people in the audience, you will serve them best by trying to convey what is essential about your topic — its flavor, if you will — at the expense of the goriest details. Most are there to hear about ideas, not complete technical execution. It is necessary to prepare a clear introduction; do not expect the audience to have previous exposure to the subject beyond a general Mathematics background. Reserve a few minutes for questions and discussion.//
103 {{/panel}}
104
105 (% class="p1" %)
106
107
108 (% style="text-align: center;" class="p1" %)
109 == Hall of Fame ==
110
111
112
113 ===== Fall 2013(% style="color: rgb(0,0,0);font-size: 10.0pt;font-weight: normal;line-height: 13.0pt;" %) (%%) =====
114
115
116
117 |=(% style="text-align: center;" %)(% style="text-align: center;" %)
118 (((
119 Date
120 )))|=(% style="text-align: center;" %)(% style="text-align: center;" %)
121 (((
122 Speaker
123 )))|=(% style="text-align: center;" %)(% style="text-align: center;" %)
124 (((
125 Title (click for Abstract)
126 )))
127 |(% colspan="1" %)(% colspan="1" %)
128 (((
129 Dec 11
130 )))|(% colspan="1" %)(% colspan="1" %)
131 (((
132 Thomas Vallier
133 )))|(% colspan="1" %)(% colspan="1" %)
134 (((
135 {{expand title="Bootstrap percolation"}}
136 (% class="p1" %)
137 Bootstrap percolation on the random graph G_{n(% class="s1" %),p} (%%)is a process of spread of “activation” on a given realization of the graph with a given number of initially active nodes. At each step those vertices which have not been active but have at least r ≥ 2 active neighbours become active as well.
138
139 (% class="p1" %)
140 The graph G_{(% class="s1" %)n,p} (%%)has n vertices and every pair of vertices has an edge with probability p independently of the other edges.
141
142 (% class="p1" %)
143 The parameters of the model are, besides r (fixed) which I will take to be 2 along the presentation and n (tending to ∞), the size a = a(n) of the initially active set and the probability p = p(n) of the edges in the graph.
144
145 (% class="p1" %)
146 The model exhibits a sharp phase transition: depending on the parameters of the model the final size of activation, of size A^(% class="s2" %)∗(%%), with a high probability is either n − o(n) or it is o(n).
147
148 (% class="p1" %)
149 This is a joint work with Svante Janson, Tomasz Luczak and Tatyana Turova.
150
151 (% class="p1" %)
152 This talk is intended for a general audience.
153 {{/expand}}
154 )))
155 |(% colspan="1" %)(% colspan="1" %)
156 (((
157 Dec 4
158 )))|(% colspan="1" %)(% colspan="1" %)
159 (((
160 Harri Varpanen (Aalto U)
161 )))|(% colspan="1" %)(% colspan="1" %)
162 (((
163 {{expand title="Gibbs equilibria of random juggling patterns"}}
164 Juggling patterns provide hands-on examples of both affine permutations (periodic setting) and coupled renewal processes (random setting). I will first give a short illustration of the basics and then survey some past and ongoing research from a thermodynamical formalism point of view.
165 {{/expand}}
166 )))
167 |(% colspan="1" %)(% colspan="1" %)
168 (((
169 Nov 20
170 )))|(% colspan="1" %)(% colspan="1" %)
171 (((
172 Sarah Hamilton
173 )))|(% colspan="1" %)(% colspan="1" %)
174 (((
175 {{expand title="Direct D-bar methods for 2D electrical impedance tomography"}}
176 Electrical Impedance Tomography (EIT) is a non-invasive imaging modality that aims to recover the internal conductivity/permittivity of a body via current and voltage measurements taken at its surface. Images are then formed from the reconstructed conductivity/permittivity distribution(s) for diagnostic and evaluative purposes. In the 2D geometry, EIT is clinically useful for chest and brain imaging, and applications extend to nondestructive evaluation and underground prospecting. The reconstruction task is a highly ill-posed nonlinear inverse problem, which is very sensitive to noise, and requires the use of regularized solution methods such as D-bar methods. D-bar methods, based on tailor-made scattering transforms, regularize EIT through nonlinear low-pass filters. Key tools for the methods involve complex geometrical optics solutions, the Faddeev Green’s function, scattering transforms, and D-bar equations. Advantages of D-bar algorithms include parallelization, low frequency limits in the scattering parameter, and as the methods are non-iterative, no concerns regarding convergence to local minima. In this introductory talk, a conceptual overview of D-bar methods for the EIT problem is given. Reconstructions of complex admittivities (conductivities and permittivities) from experimental EIT data are presented, and the partial data case is explored.
177 {{/expand}}
178 )))
179 |(% colspan="1" %)(% colspan="1" %)
180 (((
181 Nov 13
182 )))|(% colspan="1" %)(% colspan="1" %)
183 (((
184 Juha Kontinen
185 )))|(% colspan="1" %)(% colspan="1" %)
186 (((
187 {{expand title="Dependence logic"}}
188 Dependence logic is a new logical framework in which various notions of dependence and independence can be formalized and studied. I will introduce the basics of dependence logic and discuss some recent work related to the complexity theoretic aspects of it. I will also shed some light on the connections dependence logic has to areas such as database theory and probability theory.
189 {{/expand}}
190 )))
191 |(% colspan="1" %)(% colspan="1" %)
192 (((
193 Nov 6
194 )))|(% colspan="1" %)(% colspan="1" %)
195 (((
196 István Prause
197 )))|(% colspan="1" %)(% colspan="1" %)
198 (((
199 {{expand title="Schwarz lemma and holomorphic motions"}}
200 A good lemma is worth a thousand theorems. I will make a case for this by considering the Schwarz lemma. In particular, I will illustrate uses of Schwarz lemma in connection with complex dynamics and quasiconformal mappings. A key notion here is that of a holomorphic motion.
201 {{/expand}}
202 )))
203 |(% colspan="1" %)(% colspan="1" %)
204 (((
205 Oct 23
206 )))|(% colspan="1" %)(% colspan="1" %)
207 (((
208 Anne-Maria Ernvall-Hytönen
209 )))|(% colspan="1" %)(% colspan="1" %)
210 (((
211 {{expand title="On the theory and applications of modular forms and exponential sums"}}
212 I will briefly tell what modular forms are, and why they are useful. I will then motivate the research of exponential sums related to modular forms. Finally, I will explain some applications, namely, I will explain the idea behind the solution of Linnik's problem using modular forms, and conclude with the recent application in coding theory.
213 {{/expand}}
214 )))
215 |(% colspan="1" %)(% colspan="1" %)
216 (((
217 Oct 16
218 )))|(% colspan="1" %)(% colspan="1" %)
219 (((
220 Lizaveta Ihnatsyeva
221 )))|(% colspan="1" %)(% colspan="1" %)
222 (((
223 {{expand title="Characterization of traces of smooth functions on Ahlfors regular sets"}}
224 In the talk we discuss some results on characterizing the traces of functions from Sobolev spaces, Besov spaces and Triebel-Lizorkin spaces to Ahlfors regular subsets of the Euclidean space.
225 {{/expand}}
226 )))
227 |(% colspan="1" %)(% colspan="1" %)
228 (((
229 Oct 9
230 )))|(% colspan="1" %)(% colspan="1" %)
231 (((
232 Neil Dobbs
233 )))|(% colspan="1" %)(% colspan="1" %)
234 (((
235 {{expand title="A meander in dynamical systems"}}
236 This talk will start with some basic examples of dynamical systems, illustrating that complexity and randomness can be generated by simple deterministic rules. We will examine the sometimes surprising results when one perturbs certain systems in the one-dimensional setting. Towards the end I shall present some recent results of mine concerning the dynamics of the exponential family in the complex plane. The talk will be suitable for a non-specialist audience.
237 {{/expand}}
238 )))
239 |(% colspan="1" %)(% colspan="1" %)
240 (((
241 Oct 2
242 )))|(% colspan="1" %)(% colspan="1" %)
243 (((
244 Luca Martino
245 )))|(% colspan="1" %)(% colspan="1" %)
246 (((
247 {{expand title="Basic introduction to MCMC algorithms"}}
248 Many numerical problems in science, engineering, finance, and statistics are solved through Monte Carlo methods. For instance, the computations required in Bayesian analysis have become viable using efficient random sampling algorithms. Within the Monte Carlo techniques, the Markov Chain Monte Carlo (MCMC) algorithms are very powerful tools and widely used for Bayesian inference. This talk provides a brief (and basic) "journey" through the MCMC world.
249 {{/expand}}
250 )))
251 |(% colspan="1" %)(% colspan="1" %)
252 (((
253 Sept 18
254 )))|(% colspan="1" %)(% colspan="1" %)
255 (((
256 Kay Schwieger
257 )))|(% colspan="1" %)(% colspan="1" %)
258 (((
259 {{expand title="Equivalence of randomized quantum walks"}}
260 Quantum walks have attracted a lot of attention during recent years due to their surprising limit behavior. In this talk I will introduce quantum walks on the line with a temporal randomization. Looking at each individual step we find that all processes appear to be classical. However, we will show that the time correlations are non-classical and differ depending on the randomization.
261 {{/expand}}
262 )))
263 |(% colspan="1" %)(% colspan="1" %)
264 (((
265 Sept 11
266 )))|(% colspan="1" %)(% colspan="1" %)
267 (((
268 Konstantin Izyurov
269 )))|(% colspan="1" %)(% colspan="1" %)
270 (((
271 {{expand title="Conformal invariance in critical models of 2D statistical physics"}}
272 I will give a brief introduction to conformal invariance phenomena in two-dimensional statistical physics. Conformal invariance is a property of various quantities associated to the model (expectations, probabilities, probability measures on random curves etc.) to behave nicely under conformal maps. Based on several simple examples, I will explain modern tools to study this phenomenon, such as discrete complex analysis and Schramm-Loewner evolution. Time permitting, I will discuss my joint results with Dmitry Chelkak and Clément Hongler concerning the Ising model.
273 {{/expand}}
274 )))
275
276
277
278
279
280 Nov. 25[[Henrik Kettunen>>url:https://wiki.helsinki.fi/display/mathstatHenkilokunta/Kettunen,+Henrik||shape="rect"]]
281 \\
282
283
284
285 {{expand title="Electromagnetics with negative material parameters"}}
286 The Maxwell equations form the basis of the classical electromagnetic theory. In addition to these famous four equations, we need the constitutive relations, which connect the fields and flux densities to each other by the material parameters, permittivity and permeability. It is very natural to assume that these material parameters are in most cases positive. However, if we allow them to go negative, we face new exciting physical phenomena that have attracted mathematicians, physicists and engineers alike. For example, double-negative materials allow backward wave propagation and negative refraction enabling sub-wavelength focusing of a light beam. If only the electric permittivity is negative, such interfaces can support plasmonic resonances that are sub-wavelength oscillations of electron density excited by the incident light. Noble metals can manifest negative permittivity at visible and ultraviolet frequencies. However, the possibility of constructing double-negative materials has become closer to reality only recently alongside the research of artificial metamaterials.
287 {{/expand}}