UWA Logo What's On at UWA
   UWA HomeProspective Students  | Current Students  | Staff  | Alumni  | Visitors  | About  |     Search UWA    for      

What's On at UWA

* Login to add events... *
Today's date is Thursday, September 24, 2020
Choose another calendar ....
Go To Today
18 1 2 3 4 5
19 6 7 8 9 10 11 12
20 13 14 15 16 17 18 19
21 20 21 22 23 24 25 26
22 27 28 29 30 31
22 1 2
23 3 4 5 6 7 8 9
24 10 11 12 13 14 15 16
25 17 18 19 20 21 22 23
26 24 25 26 27 28 29 30
27 1 2 3 4 5 6 7
28 8 9 10 11 12 13 14
29 15 16 17 18 19 20 21
30 22 23 24 25 26 27 28
31 29 30 31
Events Help
Displaying from Friday, June 21, 2013
 June 2013
Friday 21
15:00 - SEMINAR - Groups and Combinatorics Seminar More Information
This week the seminar will consist of three 20 minute talks, starting at 3pm Friday 21st of June in Blakers Lecture Theatre.

--Talk 1--

Mark Ioppolo

will speak on

Symmetry in coding theory: Constructing error control codes with group theory

Abst (...)

 July 2013
Friday 05
15:00 - SEMINAR - Groups and Combinatorics Seminar, On Pseudo-Injective Group Algebra More Information

A module M is called pseudo-injective if for every submodule X of M, any monomorphism f : X -------> M can be extended to a homomorphism g : M -------> M. Let K be a field and G a group. It is well known that a group algebra K[G] is self-injective if and only if the group (...)

 August 2013
Friday 02
15:00 - SEMINAR - Groups and Combinatorics Seminar, Maximal arcs that contain regular hyperovals More Information

A maximal n-arc is a set of q(n-1) + n points in a projective plane such that any line of the plane meets 0 or n of them. The most common maximal arcs, called the Mathon arcs, are constructed by taking the union of regular hyperovals. In particular, there are no known maximal 4- (...)
Friday 09
15:00 - SEMINAR - Groups and Combinatorics Seminar, Semisymmetric graphs of prime valency More Information

A graph is called X-semisymmetric if the group X acts transitively on edges, but not on vertices. Such graphs are necessarily bipartite and bi-regular, of valencies k and l say. There is a natural relationship between semisymmetric graphs and amalgams of groups. This leads us (...)
Sunday 11
10:00 - OPEN DAY - 2013 Open Day : Join us for our Centenary Open Day and experience all that UWA has to offer Website | More Information
Come and find out about our undergraduate and postgraduate courses, career options, scholarship opportunities, our valuable research, community programs and facilities.

There's also residential college tours, hands-on activities, live music, entertainment, and plenty of fun activities (...)
Friday 16
15:00 - SEMINAR - Groups and Combinatorics Seminar, Decomposing tensor products over fields of small characteristic More Information

One motivation for this talk comes from representation theory: decomposing a tensor product of irreducible (or indecomposable) representations as a sum of smaller degree irreducible (or indecomposable) representations. Other motivations come from quantum mechanics and (...)
Friday 23
15:00 - SEMINAR - Groups and Combinatorics Seminar, Breaking symmetries of infinite graphs More Information

Symmetry breaking involves colouring the elements of a combinatorial structure so that the resulting structure has no nontrivial symmetries. In this talk I'll give an introduction to symmetry breaking, with a particular focus on infinite graphs. I'll also discuss a number of (...)
Friday 30
15:00 - SEMINAR - Groups and Combinatorics Seminar, The structure of 3-separations of matroids More Information

In this talk, I will give an introduction to decomposition theory of 3-connected matroids. In order to make it more accessible I will also introduce some related definitions and examples.

 September 2013
Friday 06
15:00 - SEMINAR - Groups and Combinatorics Seminar, Connections between Graph Theory & Combinatorics on Words More Information

A string or word is usually thought of as a sequence of letters drawn from some alphabet. Applications to bioinformatics and other areas suggest the utility of defining strings on subsets of the alphabet instead -- so-called "indeterminate" strings. I describe (...)
Friday 13
15:00 - SEMINAR - Groups and Combinatorics Seminar, On The Non-commuting Graph More Information

In this talk, we will consider the non-commuting graph of a non-abelian finite group G; its vertex set is the set of non-central elements of G, and two distinct vertices x and y are joined by an edge if they do not commute together. Actually, we study some properties of the (...)
Friday 20
15:00 - SEMINAR - Groups and Combinatorics Seminar, Generalised quadrangles constructed from groups More Information

This is just a survey talk of various ways to construct all of the known finite generalised quadrangles starting with a group and a configuration of subgroups of that group. In particular, the speaker will give a summary of where one of the "retreat" problems is at.
Wednesday 25
11:00 - SEMINAR - Mathematics Colloquium: The Cohen-Lenstra heuristics: from arithmetic to topology and back again More Information
Akshay Venkatesh (Stanford) Mahler Lecturer and IAS Professor-at-Large

will speak on

The Cohen-Lenstra heuristics: from arithmetic to topology and back again.

at 11am in the Science Library Access Grid room.

I will discuss some models of (...)
Friday 27
15:00 - SEMINAR - Groups and Combinatorics Seminar, Straight-line programs with memory and applications to computational group theory More Information

Straight-line programs offer a method for encoding group computations in a "black box" sense, namely without using specifics of the group's representation or how the group operations are performed. We advocate that straight-line programs designed for group (...)

 October 2013
Friday 11
15:00 - SEMINAR - Groups and Combinatorics Seminar, Multiply tiling Euclidean space by translating a convex object More Information

We study the problem of covering Euclidean space R^d by possibly overlapping translates of a convex body P, such that almost every point is covered exactly k times, for a fixed integer k. Such a covering of Euclidean space by translations is called a k-tiling. We will first (...)
Friday 18
15:00 - SEMINAR - Groups and Combinatorics Seminar, Regular orbits of Sym(n) and Alt(n) on irreducible representations More Information

Given a finite group G and a faithful irreducible FG-module V where F is a field of prime order, we can ask whether G has a regular orbit on the vectors of V. This problem is related to determining which primitive permutation groups of affine type have a base of size 2, as well (...)
Friday 25
15:00 - SEMINAR - Groups and Combinatorics Seminar, Coprime actions of finite linear groups More Information

Let H be a finite linear group acting completely reducibly on a finite vector space V. Gabriel Navarro asked: if the H-orbits containing vectors a and b have coprime lengths m and n, is there an H-orbit of length mn? We answered, by showing that the H-orbit containing a + b (...)

 November 2013
Friday 01
15:00 - SEMINAR - Groups and Combinatorics Seminar, Algebraic geometry codes More Information

Codes arising from algebraic geometry, first introduced by Goppa, gained attention when Tsfasman–Vladut–Zink used them to improve the Gilbert-Varshamow bound. We will give a gentle introduction to some of the beautiful ideas from algebraic geometry used to build these codes (...)
Friday 15
15:00 - SEMINAR - Groups and Combinatorics Seminar, A miscellany of topics related to semiregular graph automorphisms More Information
Abstract :

I will discuss a few things, all related to semiregular graph automorphisms : the polycirculant conjecture, the abelian normal quotient method, an interesting class of graphs...
Monday 18
13:00 - SEMINAR - Integrable-like behavior in the Fermi-Pasta-Ulam model Website | More Information
In 1950’s Fermi, motivated by fundamental questions of statistical mechanics, started a numerical experiment in collaboration with Pasta and Ulam to test the ergodic properties of nonlinear dynamical systems. The chosen so-called FPU system was a one dimensional chain of N nonlinear coupled (...)
Friday 22
11:00 - SEMINAR - Self-avoiding walks—rigorous and non-rigorous results Website | More Information
Self-avoiding walks (SAWs) are widely studied as a problem in algebraic combinatorics by mathematicians, as a problem in algorithm design by computer scientists, as a model of phase transitions by mathematical physicists and as a model of polymers in dilute solution by chemists.

More (...)

There are 218 more future events in this calendar

Alternative formats: XML | Printer Friendly

Top of Page
© 2001-2010  The University of Western Australia
Questions? Mail [email protected]