
Displaying from Tuesday, October 02, 2012

October 2012

Tuesday 02 
13:00  SEMINAR  Groups and Combinatorics: Packing Steiner trees

More Information

Groups and Combinatorics Seminar
Irene Pivotto (UWA)
will speak on
Packing Steiner trees
at 1pm Tuesday 2nd of October in MLR2
Abstract: A classic theorem of NashWiliams and Tutte gives necessary and sufficient conditions for a graph to
have k (...)

Monday 08 
13:10  SEMINAR  Groups and Combinatorics Seminar: Commuting graphs of groups

More Information

Groups and Combinatorics Seminar
Michael Giudici (UWA)
will speak on
Commuting graphs of groups
at 1pm Tuesday 9th of October in MLR2
Abstract: The commuting graph of a group G is the graph whose vertices are the noncentral elements of G and (...)

Monday 15 
A Public Lecture by Professor J. Hyam Rubinstein, Department of Mathematics & Statistics, University of Melbourne.
The Poincare conjecture was one of the most celebrated questions in mathematics. It was amongst the seven millennium problems of the Clay Institute, for which a prize of (...)

Tuesday 16 
13:00  SEMINAR  Groups and Combinatorics: Finite metaprimitive permutation groups

More Information

Groups and Combinatorics Seminar
Cai Heng Li (UWA)
will speak on
Finite metaprimitive permutation groups
at 1pm Tuesday 16th of October in MLR2
Abstract: A transitive permutation group is called metaprimitive if its any imprimitive (...)

Tuesday 23 
13:00  SEMINAR  Groups and Combinatorics Seminar: Clifford theory and Hecke algebras

More Information

Groups and Combinatorics Seminar
Arun Ram (University of Melbourne)
will speak on
Clifford theory and Hecke algebras
at 1pm on Tuesday the 23rd of October in MLR2
Abstract: The usual Clifford theory describes the irreducible
representations (...)


November 2012

Tuesday 20 
13:00  SEMINAR  Groups and Combinatorics Seminar: Finite sGeodesic Transitive Graphs

More Information

Groups and Combinatorics Seminar
Wei Jin (UWA)
will speak on
Finite sGeodesic Transitive Graphs
at 1pm on Tuesday 20th of November in Maths Lecture Room 2
Abstract: A geodesic from a vertex u to a vertex v in a graph is one of the shortest (...)

Tuesday 27 
13:00  SEMINAR  Groups and Combinatorics Seminar: Graphs and general preservers of zero products

More Information

Groups and Combinatorics Seminar
Bojan Kuzma (University of Primorska, Slovenia)
will speak on
Graphs and general preservers of zero products
at 1pm on Tuesday 27th of November in MLR2
Abstract: We survey some results in preserver problems (...)


December 2012

Tuesday 04 
Groups and Combinatorics Seminar
Neil Gillespie (UWA)
will speak on
Completely regular codes with large minimum distance
and
Daniel Hawtin (UWA) will speak on
Elusive Codes in Hamming Graphs
at 1pm Tuesday 4th of December in MLR2


February 2013

Friday 22 
15:00  SEMINAR  Groups and Combinatorics Seminar: Algebraic aspects of Hadamard matrices

More Information

Our Groups and Combinatorics Seminar will resume this Friday.
Padraig Ó Catháin (The University of Queensland)
will speak on
Algebraic aspects of Hadamard matrices
at 3pm Friday 22nd of February in MLR2.
Abstract:
Hadamard matrices (...)


March 2013

Friday 01 
15:00  SEMINAR  Groups and Combinatorics Seminar, The Wall and Guralnick conjectures: history and legacy

More Information

Abstract:
In 1961 G.E. Wall conjectured that the number of maximal subgroups of a finite group is less than the order of the group. The conjecture holds for all finite solvable groups (proved by Wall himself in his original paper) and holds for almost all finite simple groups, possibly (...)

Tuesday 05 
13:00  SEMINAR  Groups and Combinatorics Seminar, Control of fusions in fusion systems and applications

More Information

Jiping Zhang (Peking University)
will speak on
Control of fusions in fusion systems and applications
at 1pm on Tuesday 5th of March, in MLR2
Abstract:
Fusion systems were introduced by L. Puig in early 1990's mainly for the purpose of block (...)

Friday 08 
15:00  SEMINAR  Groups and Combinatorics Seminar, Generalised ngons and the FeitHigman theorem

More Information

Name: Jon Xu (University of Melbourne/University of Western Australia)
will speak on
Generalised ngons and the FeitHigman theorem
at 3pm on Friday 8th of March.
Abstract:
Jacques Tits' theory of buildings played a vital role in the proof of (...)

Friday 15 
15:00  SEMINAR  Groups and Combinatorics Seminar, ErdösKoRado sets in finite classical polar spaces

More Information

Abstract:
ErdösKoRado sets (EKR sets) are a family of ksets 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

Abstract:
Let G be a group, let H be a subgroup of G and let V be an irreducible KGmodule over a field K. We say that (G,H,V) is an irreducible triple if V is an irreducible KHmodule. 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
NOTE CHANGE OF DAY, TIME AND VENUE
Abstract:
The genome of a bacterial (...)


April 2013

Friday 05 
15:00  SEMINAR  Groups and Combinatorics Seminar, Redeipolynomials in finite geometry

More Information

Abstract:
L. Redei has studied in a detailed way socalled "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 ErdosStone Theorem for finite geometries

More Information

Abstract:
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 ErdosStone 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

Abstract:
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, Arctransitive graphs with large automorphism groups

More Information

Abstract:
An arc in a graph is an unordered pair of adjacent vertices. A graph is called arctransitive 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 arctransitive graph in terms of its order (...)

Friday 26 
15:00  SEMINAR  Groups and Combinatorics Seminar, Locally sarc transitive regular covers of complete bipartite graphs

More Information

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


There are
245 more future events
in this calendar
Alternative formats:
XML 
Printer Friendly


