Warning: Your browser doesn't support all of the features in this Web site. Please view our accessibility page for more details.
The seminar usually takes place on Thursdays from 3.45pm to 4.45pm in room ADB-1020
of the School of Mathematics, Statistcs and Applied Mathematics, which is located
Áras de Brún (Block C).
The talks are directed towards a general mathematical audience and everyone interested is very welcome to attend. Tea/coffee/biscuits/cake will be available in the ground floor research room (ADB-G022) 30 minutes before the seminar starts.
A list of seminars from the 2013/2014 academic year as also available.
Abstracts when available can be obtained by rolling the mouse over a title. Clicking a title sometimes provides a longer version of the talk in PDF format.
If you wish to receive email announcements/reminders of these seminars, go to https://listserv.heanet.ie/cgi-bin/wa?A0=NUIG-MATHS-SEMINARS where you can join the circulation list.
|Sep 11||Rob Craigen
University of Manitoba
|Structure and Permutation Symmetry of Matrices
Say that two matrices are (permutation) equivalent if one can be
obtained by permuting the rows and columns of the other. Suppose a
matrix is equivalent to its transpose. Must it necessarily also
be equivalent to a symmetric matrix? More generally, what sort of
matrix is equivalent to its own transpose?
The answers are elegant and perhaps a little startling; we will derive an essentially complete solution, and discuss a couple of contexts in which these questions arise naturally.
National University of Ireland Maynooth
|Improving data visualisations with dendrogram seriationVisualisation is a key but often neglected step in data and model exploration.
Data visualisation is about comparisons, perhaps between variables, cases, groups, and or models. Stock visualisations provided in packages such as R benefit from systematic ordering (i.e. seriation) of data objects to highlight features and structure. The theme of this talk will be the use of seriation to improve data graphics. We describe a general-purpose seriation algorithm based on dendrograms which easily adapts to different visualization settings.
University of Alberta
|Robustness of Design: A SurveyWhen an experiment is conducted for purposes which include fitting a particular model to the data, then the 'optimal' experimental design is highly dependent upon the model assumptions - linearity of the response function, independence and homoscedasticity of the errors, etc. When these assumptions are violated the design can be far from optimal, and so a more robust approach is called for. We should seek a design which behaves reasonably well over a large class of plausible models. I will review the progress which has been made on such problems, in a variety of experimental and modelling scenarios - prediction, extrapolation, discrimination, survey sampling, dose-response, etc.||Jerome Sheahan|
|Oct 9||Graham Ellis
|Pictures from AustriaI will describe some computational analyses of real data involving basic notions and results from topology.||Sejong Park|
|Oct 16||Paul Bankston
|A betweenness perspective on dendrons and their kinThe betweenness condition that defines a dendron to be a continuum in which each pair of points have a third point whose removal separates the first two points in the remainder is weakened in two different ways: the first says that the first two points are maybe not separated in the remainder of the third, but at least they're in different components of that remainder; the second says that the first two points are in separate continuum components of the remainder of the third. We examine the idea of being a dendron relative to these weakened betweenness conditions.||Aisling McCluskey|
|Oct 23||No Seminar: Graduation
||No Seminar: Graduation|
|Oct 30||To be announced
|Nov 6||To be announced
|Cryptosystems made in Galway - closing a gap in internet security?The encryption systems used to secure online bank accounts and keep critical communications private could be undone in just a few years, security researchers warned at the Black Hat conference last year. The only alternative to the threatened currently used encryption systems which is so far recognised for yielding systematic security improvements is Elliptic Curve Cryptography (ECC). Implementations of ECC were patented by a company called Certicom. Companies that want to use ECC will need to make expensive deals with Certicom to avoid lawsuits, writes the MIT Technology Review. This is why it is time now to develop new cryptosystems and to prove their security. NUI Galway already has experience on patenting cryptosystems, but resources were not available so far for establishing security proofs that would convince the markets. This is why Emil Skoldberg, Alexander D. Rahm and Nghia Thi Hieu Tran want to build up a research group for the development of Bianchi groups cryptosystems, which will lay the foundations for a cryptography research cluster with the critical mass to release a worldwide recognised encryption system.||Emil Skoeldberg|
|Nov 20||Antonio Díaz
Universidad de Málaga
||Nghia Thi Hieu Tran
Ho Chi Minh City
|The Artinianess of graded generalized local cohomology modulesThis talk wants to present the Artinianess of some classes of graded generalized local cohomology modules. Generalized local cohomology was introduced by J. Herzog in 1974. It is a generalization of Grothendieck's local cohomology theory. In particular, we consider it for a given Noetherian commutative local ring R with the unit element 1 different from 0, for each pair of modules M, N over R. A recent result of the speaker is that under certain additional assumptions, this cohomology vanishes in high enough dimensions. This allows to obtain partial information about the projective dimension of M and the Krull dimension of N.||Alexander D. Rahm|
|Dec 4||Seventh de Brun Workshop on Homological Perturbation Theory
||Seventh de Brun Workshop on Homological Perturbation Theory||Graham Ellis|
|The colored cubes puzzle: a tribute to Percy MacMahonStart with a collection of cubes and a palette of six colors. We paint the cubes so that each cube face is one color, and all six colors appear on every cube. Take n^3 cubes colored in this manner. When is it possible to assemble these cubes into an n × n × n large cube so that each face on the large cube is one color, and all six colors appear on the cube faces? For the 2 × 2 × 2 case we give necessary and sufficient conditions for a set of eight cubes to have a solution. Furthermore, we show that the (colored cubes)^3 puzzle always has a solution for n > 2.||Alexander Rahm|
|Dec 11||No Seminar
||Research students meeting||Niall Madden|
University of Helsinki