8:00am 


9:00am 


10:00am 


11:00am 


12:00pm 


1:00pm 


2:00pm 
[2:00pm] Nishad Kothari: Institute of Computing, Campinas, Brazil
 Description:
 Combinatorics Seminar.
Speaker: Nishad Kothari.
Affiliation: Institute of Computing, Campinas, Brazil.
Date and Time: Thursday 20 February, 02:00 pm  3:30 pm.
Venue: Ramanujan Hall, Department of Mathematics.
Title: Generation Theorems for Bricks and Braces.
Abstract:
A connected graph G, on two or more vertices, is matching covered if each edge belongs to
some perfect matching. For problems pertaining to perfect matchings of a graph — such as
counting the number of perfect matchings — one may restrict attention to matching covered
graphs.
Every matching covered graph may be decomposed into a list of special matching covered
graphs called bricks (nonbipartite) and braces (bipartite); Lov´asz (1987) proved that this
decomposition is unique. The significance of this decomposition arises from the fact that
several important open problems in Matching Theory may be reduced to bricks and braces.
(For instance, a matching covered graph G is Pfaffian if and only if each of its bricks and
braces is Pfaffian.) However, in order to solve these problems for bricks and braces, one needs
induction tools; these may also be viewed as generation theorems for bricks and braces.
Norine and Thomas (2007) proved a generation theorem for simple bricks. In a joint work
with Murty (2016), we used their result to characterize K4free planar bricks. However, it
seems very difficult to characterize K4free nonplanar bricks. For this reason, I decided to
develop induction tools for a special class of bricks called ‘nearbipartite bricks’.
A brick G is nearbipartite if it has a pair of edges {α, β} such that G−α−β is matching
covered and bipartite. During my PhD, I (https://onlinelibrary.wiley.com/doi/10.
1002/jgt.22414) proved a generation theorem for nearbipartite bricks. In a joint work with
Carvalho (https://arxiv.org/abs/1704.08796), we used this result to prove a generation
theorem for simple nearbipartite bricks. Our theorem states that all nearbipartite bricks
may be built from 8 infinite families by means of (a finite sequence of) three operations.
McCuaig (2001) proved a generation theorem for simple braces, and used it to obtain
a structural characterization of Pfaffian braces — thus solving the Pfaffian Recognition
Problem for all bipartite graphs. A brace is minimal if removing any edge results in a graph
that is not a brace. In a recent work with Fabres and Carvalho (https://arxiv.org/abs/
1903.11170), we used McCuaig’s brace generation theorem to deduce an induction tool for
minimal braces. As an application, we proved that a minimal brace with 2n vertices has at
most 5n − 10 edges, when n ≥ 6, and we obtained a complete description of minimal braces
that meet this upper bound.
I will present the necessary background, and describe our aforementioned results. The
talk will be selfcontained. I shall assume only basic knowledge of graph theory, and will not
present any lengthy proofs.


3:00pm 

4:00pm 
[4:00pm] Stefan Schwede: University of Bonn : Mathematics Colloquium
 Description:
 Mathematics Colloquium II.
Speaker: Stefan Schwede.
Affiliation: University of Bonn.
Date and Time: Thursday 20 February, 04:00 pm  05:00 pm.
Venue: Ramanujan Hall, Department of Mathematics.
Title: Equivariant properties of symmetric products.
Abstract: The ultimate aim of this talk is to explain a calculation of
equivariant homotopy groups of symmetric products of spheres. To lead up
to this, I will review the notion of degree of a map between spheres, and
of its equivariant refinement, for a finite group G of equivariance. The
answer is best organized as an isomorphism, due to Graeme Segal, to the
Burnside ring of the finite group G.
The filtration of the infinite symmetric product of spheres by number of
factors has received a lot of attention in algebraic topology. We
investigate this filtration for spheres of linear representations of the
finite group G; by Segal's theorem, the resulting sequence of 0th
equivariant homotopy groups starts with the Burnside ring, and it ends in
a single copy of the integers (independent of the group of equivariance).
We describe this sequence in a uniform and purely algebraic manner,
including the effect of restrictions and transfers maps that connect the
values for varying groups G.
An effort will be made to make a good portion of the talk accessible to
graduate students.


5:00pm 


6:00pm 

