DateSpeakerTitleContact
Sep 8 Carlo Di Franco
University College Cork
Two-dimensional quantum walks with reduced experimental resourcesQuantum walks, being the analogue of classical random walks, have recently emerged as a topic arising the interest of a wide scientific community, in the same way that their classical counterparts have found applications in different fields, ranging from physics to computer science and from economics to biology. The behaviour of quantum walks has been analysed in literature and a striking application in quantum computation for a particular two-dimensional quantum walk, known as Grover walk, has been found. And yet, the experimental realisation of known two-dimensional quantum walks is extremely challenging, due to the significant technological effort required. One of the difficulties is clearly the dimension of the coin space, larger than the one necessary for the implementation of one-dimensional walks. A simplification in this respect is highly desirable, especially from a practical perspective. In this talk, I present a significant step forward in this direction: a scheme for a two-dimensional quantum walk that requires only a two-dimensional coin space. I formally prove that this protocol is able to generate the same spatial probability distribution of the Grover walk in its non-localised case. Another interesting aspect in quantum information science is the generation of entanglement, a particular kind of quantum correlations that is a critical requirement for quantum metrology, quantum computation and communication. I show that the proposed scheme is actually more efficient in the generation of x-y spatial entanglement with respect to the original Grover walk. A very clear explanation can be found, also in this case, in the smaller dimension of the coin space. Michael Mc Gettrick
Sep 15 Marlos Viana
University of Illinois at Chicago
Dihedral Fourier Analysis of Symmetry Preference Data
(joint colloquium with the School of Physics)http://www.maths.nuigalway.ie/research/vianaABS.pdf
John Hinde
Sep 16
Friday in C218 12.00
Chris Glasbey
Biomathematics and Statistics Scotland (BioSS)
Dynamic programming versus graph cut algorithmsImage restoration, segmentation and template matching are generic problems in image processing that can often be formulated as non-parametric model fitting: maximising a penalised likelihood or Bayesian posterior probability for an I-dimensional array of B-dimensional vectors. The global optimum can be found by dynamic programming provided I=1, with no restrictions on B, whereas graph cut algorithms require B=1 and a convex smoothness penalty, but place no restrictions on I. I compare conditions and results for the two algorithms, using restoration of a synthetic aperture radar (SAR) image for illustration. John Hinde
Sep 22
Reserved for visit to the School by the University President
Sep 29 Rachel Quinlan
NUI, Galway
What I did on my sabbaticalThe following question, arising from a construction involving automorphisms of finite p-groups, was posed by F. Szechtman in a 2003 paper in the AMS Proceedings : for a vector space V of dimension n over a field F, what is the minimum possible dimension of a (non-linear) affine subspace of EndF(V) that contains elements annihilating all hyperplanes of V? This question is equivalent, under a duality arising from the trace bilinear form on Mn(F), to the problem of determining the maximum possible dimension of a linear subspace of Mn(F) in which no element possesses a non-zero eigenvalue that belongs to the field F. This talk will explain this duality and show how it can be used to solve both of the problems mentioned above, independently of the field under consideration.

The duality relation will then be explored in a wider context involving affine spaces of square and rectangular matrices that have special rank properties and special covering properties. One application that will be discussed is to the problem of characterizing partial matrices whose completions have ranks satisfying a prescribed lower bound.

The only background needed for this talk is basic linear algebra and a little bit about bilinear forms.

Michael Mc Gettrick
Oct 6 Giuseppe Tinaglia
King's College London
The geometry of constant mean curvature surfaces embedded in R^3In this talk I will discuss recent results on the geometry of constant mean curvature (H\neq 0) surfaces embedded in R^3. Among other things I will prove radius and curvature estimates for simply connected surfaces embedded in R^3 with constant mean curvature. It follows from the radius estimate that the only complete, simply connected surface embedded in R^3 with constant mean curvature is the round sphere. This is joint work with Bill Meeks. John Burns
Oct 13 Avi Berman
Technion (Israel Institute of Technology)
Diagonal stability and completely positive matrices.The talk will consist of a short survey of the theory of completely positive matrices and relate it to a newly defined concept of a common diagonal Lyapunov matrix. A necessary and sufficient condition for the existence of such a matrix will be derived. The second part of the talk is based on a recent paper with C. King Rachel Quinlan
Oct 20 Niall Madden
NUI, Galway
Multigrid methods and singularly perturbed problems Michael Mc Gettrick
Oct 27 Ben McKay
University College Cork
Rolling balls, complex manifolds and the Lie algebra G2Hilbert wrote out an example of an underdetermined ODE system that he proved cannot be solved by elementary methods. Cartan described the same ODE system geometrically, in terms of rolling balls, and algebraically in terms of an exceptional simple Lie algebra. This system complexifies to a complex analytic ODE on a compact complex manifold. I found a surprising characterization of Hilbert's ODE in terms of complex manifolds. Javier Aramayona
Nov 3 Clifford Nolan
University of Limerick
Niall Madden
Nov 24 Carmen Molina-Paris
University of Leeds
Cathal Seoighe
Dec 8 Stephen Kirkland
NUI Maynooth
Load balancing for Markov chains with a specified directed graph Niall Madden
Feb 20
Mar 26
Wednesday 3.15pm
Tom Gilroy (PhD defence talk)
NUI, Galway
Genus Two Zhu Theory for Vertex Operator Algebras Michael Tuite