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 Tuesday, September 29, 2020
Choose another calendar ....
Go To Today
5 1 2 3
6 4 5 6 7 8 9 10
7 11 12 13 14 15 16 17
8 18 19 20 21 22 23 24
9 25 26 27 28
9 1 2 3
10 4 5 6 7 8 9 10
11 11 12 13 14 15 16 17
12 18 19 20 21 22 23 24
13 25 26 27 28 29 30 31
14 1 2 3 4 5 6 7
15 8 9 10 11 12 13 14
16 15 16 17 18 19 20 21
17 22 23 24 25 26 27 28
18 29 30
Events Help
Displaying from Sunday, March 10, 2013
 March 2013
Friday 15
15:00 - SEMINAR - Groups and Combinatorics Seminar, Erdös-Ko-Rado sets in finite classical polar spaces More Information

Erdös-Ko-Rado sets (EKR sets) are a family of k-sets of { 1, ..., n } that pairwise intersect in at least one element and were first studied by Erdös, Ko, and Rado in 1961. There are several generalizations of EKR sets. The speaker's main interest is study of EKR sets in polar (...)
Friday 22
15:00 - SEMINAR - Groups and Combinatorics Seminar, Irreducible subgroups of classical algebraic groups More Information

Let G be a group, let H be a subgroup of G and let V be an irreducible KG-module over a field K. We say that (G,H,V) is an irreducible triple if V is an irreducible KH-module. Classifying the irreducible triples of a group is a fundamental problem in representation theory, with (...)
Thursday 28
14:00 - SEMINAR - Groups and Combinatorics Seminar: Bacterial genome evolution with algebra More Information
Andrew Francis (University of Western Sydney)

will speak on

Bacterial genome evolution with algebra

at 2pm Thursday 28th of March in Blakers Lecture Theatre



The genome of a bacterial (...)

 April 2013
Friday 05
15:00 - SEMINAR - Groups and Combinatorics Seminar, Redei-polynomials in finite geometry More Information

L. Redei has studied in a detailed way so-called "lacunary" polynomials over finite fields. One of the applications described is to investigate the number of values the difference quotient of a polynomial over a finite field can have. This result has a direct (...)
Tuesday 09
13:00 - SEMINAR - Groups and Combinatorics Seminar, The Erdos-Stone Theorem for finite geometries More Information

For any class of graphs, the growth function h(n) of the class is defined to be the maximum number of edges in a graph in the class on n vertices. The Erdos-Stone Theorem remarkably states that, for any class of graphs that is closed under taking subgraphs, the asymptotic (...)
Friday 12
15:00 - SEMINAR - Groups and Combinatorics Seminar, On the number of matroids More Information

Matroids are combinatorial structures that generalize graphs as well as configurations of points in projective space. They consist of a finite ground set E and a set of subsets of E called B, such that B satisfies certain axioms. We consider the problem of bounding the number (...)
Friday 19
15:00 - SEMINAR - Groups and Combinatorics Seminar, Arc-transitive graphs with large automorphism groups More Information

An arc in a graph is an unordered pair of adjacent vertices. A graph is called arc-transitive if its automorphism group acts transitively on its set of arcs. We consider the problem of bounding the size of the automorphism group of an arc-transitive graph in terms of its order (...)
Friday 26
15:00 - SEMINAR - Groups and Combinatorics Seminar, Locally s-arc transitive regular covers of complete bipartite graphs More Information

The normal quotient method has made the study of certain families of finite graphs (for instance, s-arc transitive and locally s-arc transitive graphs) more approachable by dividing the problem into two parts: (I) Study the "basic graphs," those graphs in the family (...)

 May 2013
Friday 03
15:00 - SEMINAR - Groups and Combinatorics Seminar, On metacirculants -The relationship of weak metacirculants and metacirculants More Information
Metacirculants were introduced by Alspach and Parsons in 1982 and have been a rich source of various topics since then, including the Hamiltonian path problem of vertex-transitive graphs. A metacirculant has a vertex-transitive metacyclic subgroup of automorphisms, and a long-standing curious (...)
Friday 10
15:00 - SEMINAR - Groups and Combinatorics Seminar, Ovoids and spreads of finite polar spaces More Information

This talk is a survey of one of the driving topics in finite geometry, and the connections that ovoids and spreads have to other areas of finite geometry and permutation groups. Apart from a presentation of the history of the field and the main open problems, the speaker will (...)
Friday 17
15:00 - SEMINAR - Groups and Combinatorics Seminar, Local transitivity properties of graphs and pairwise transitive designs More Information

One of the earliest triumphs in applying the finite simple group classification in algebraic graph theory was the characterization of finite distance transitive graphs. Recent work by Devillers, Giudici, Li and myself focuses on a generalisation of this class of graphs: locally (...)
Friday 24
15:00 - SEMINAR - Groups and Combinatorics Seminar, Algebraic graph theory applied to configurations of polar spaces More Information

The speaker will give the second half of his talk from a fortnight ago, but with a different context. We will first go through some background on the basics of algebraic graph theory, eigenvalue techniques, and strongly regular graphs, before giving some short non-existence (...)
Friday 31
15:00 - SEMINAR - Groups and Combinatorics Seminar, (k,L)-complexes and graph symmetry More Information

Given an integer k and a graph L, a (k,L)-complex is a polygonal complex consisting of vertices, edges and faces such that each face is a regular k-gon and the graph induced by the edges and faces at each vertex is isomorphic to L. Many questions about the existence and (...)

 June 2013
Friday 07
15:00 - SEMINAR - Groups and Combinatorics Seminar, The Merino Welsh Conjecture More Information

Merino and Welsh conjectured that for any loopless bridgeless graph, the number of spanning trees is dominated either by the number of acyclic orientations of the graph, or by the number of totally cyclic orientations of the graph.

In this talk, I will discuss this (...)
Friday 14
15:00 - SEMINAR - Groups and Combinatorics Seminar, Recognising the Symmetric and Alternating Squares More Information

The fundamental goal of Computational Group Theory is recognition: given a group somehow represented in a computer (usually by generators), determine any information about the group that you can, as quickly as possible. This is `easy' if we have enough time and memory to write (...)
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 (...)

There are 233 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]