Computing magnetohydrodynamic equilibria without symmetries
Abstract
MHD equilibrium is an important topic for fusion (and other MHD applications). A tokamak, in principle, is a toroidally symmetric fusion device and so MHD equilibrium can be reduced to solving the time independent MHD equations in axisymmetry. This produces the Grad-Shafranov equation (a two dimensional, nonlinear PDE) which has been solved using various techniques in the fusion community including finite difference, finite elements and spectral methods. A similar PDE exists if there is a plasma column with helical symmetry. Non-axisymmetric plasmas do occur in tokamaks as a result of instabilities and applied fields. However, if there is no symmetry angle there is no PDE to be solved. The current workhorse for finding non-axisymmetric equilibria uses energy minimization to find the equilibrium. New approaches to this problem that can use state of the art techniques are desirable. The speaker has formulated a coupled set of PDEs for the non-axisymmetric MHD equilibrium problem assuming that flux surfaces are nested (i.e. there are no magnetic islands) and has written this in weak form to use finite element method to solve the equations. The questions are around whether there is an optimal way to try to formulate the problem for FEM and to couple the equations, what sort of elements to use, if other solution techniques would be better suited and so on.
14:00
Recoloring version of Hadwiger's conjecture
Abstract
Las Vergnas and Meyniel conjectured in 1981 that all the $t$-colorings of a $K_t$-minor free graph are Kempe equivalent. This conjecture can be seen as a reconfiguration counterpoint to Hadwiger's conjecture, although it neither implies it or is implied by it. We prove that for all positive $\epsilon$, for all large enough $t$, there exists a graph with no $K_{(2/3 + \epsilon)t}$ minor whose $t$-colorings are not all Kempe equivalent, thereby strongly disproving this conjecture, along with two other conjectures of the same paper.
Signed barcodes for multiparameter persistence
Abstract
Moving from persistent homology in one parameter to multiparameter persistence comes at a significant increase in complexity. In particular, the notion of a barcode does not generalize straightforwardly. However, in this talk, I will show how it is possible to assign a unique barcode to a multiparameter persistence module if one is willing to take Z-linear combinations of intervals. The theoretical discussion will be complemented by numerical experiments. This is joint work with Steffen Oppermann and Steve Oudot.