Discrete Mathematics Seminar Schedule

The seminar takes place every Friday at 3:45 in Ewing 436. For more information, contact our seminar coordinator.

1. Sven Reichard (February 21, 2003)
2. Peter Sin (February 28, 2003)
3. Frank Fiedler (March 7, 2003)
4. Jonathan Jedweb (March 21, 2003)
5. Luke Pebody (April 11, 2003)
6. Leif Jørgensen (April 25, 2003)
7. Vasyl Dmytrenko (May 2, 2003)
8. Jason Williford (May 9, 2003)
9. Istvan Kovacs (May 16, 2003)
10. Stan Payne (May 16, 2003)
11. Angela Aguglia (May 28, 2003)

Sven Reichard, University of Delaware. Weakly Neighborly Equivelar Polyhedral Maps: Combinatorial Axiomatization and Computer Enumeration.
Friday, February 21, 3:45 pm. 436 Ewing Hall.

Peter Sin, University of Florida. A theorem on the incidence relations between linear subspaces of a finite vector space.
Let L_r denote the set of r-dimensional subspaces of a finite vector space ...
Friday, February 28, 2:30 pm. 204 Ewing Hall.

Frank Fiedler, University of Delaware. On Mathon's Construction of Maximal Arcs in PG(2,2^m).
Let PG(2,2^m) be the Desarguesian plane of order 2^m. A set K of k points in PG(2,2^m) is called a (k,n)-arc ...
Friday, March 7, 3:45 pm. 436 Ewing Hall.

Jonathan Jedweb, University of Richmond. "Only a Student Would Try That": How to Construct Binary Sequences with Merit Factor greater than 6.34.
The study of the merit factor of binary sequences occurs as a classical problem of signal design for digital communication ...
Friday, March 21, 3:45 pm. 436 Ewing Hall.

Luke Pebody, Institute for Advanced Study. Combinatorial Reconstruction using Invariant Polynomials.
We investigate a combinatorial reconstruction problem of Alon, Caro, Krasikov and Roditty...
Friday, April 11, 2:30 pm. 436 Ewing Hall.

Leif Jørgensen, Aalborg University. Small regular graphs with girth 5, and their automorphism groups.
For given numbers k and g, the problem is to construct k-regular graphs with girth g and as few vertices as possible...
Friday, April 25, 3:45 pm. 436 Ewing Hall.

Vasyl Dmytrenko, University of Delware. An Isomorphism Criterion for Monomial Graphs.
Friday, May 2, 3:45 pm. 436 Ewing Hall.

Jason Williford, University of Delware. TBA.
Friday, May 9, 3:45 pm. 436 Ewing Hall.

Istvan Kovacs, Pecs. Sets with a large number of nuclei on a cubic curve.
Friday, May 16, 2:45 pm. room TBA

Stan Payne, CU Denver. Regularity in Finite Generalized Quadrangles.
A finite generalized quadrangle (GQ) is a partial linear space with no triangles and the maximum number possible of ordinary 4-gons...
Friday, May 16, 4:00 pm. 436 Ewing Hall.

Angela Aguglia, University of Bari. Curves through internal points of a conic in AG(2,q), q odd.
Wednesday, May 28, 4:00 pm. 436 Ewing Hall.

Past Schedules

• Fall 2002
• Spring 2002
• Fall 2001
• Spring 2001
• Fall 2000
• Spring 2000
• Fall 1999
• Spring 1999
• Fall 1998
• Spring 1998

Back to Discrete Mathematics Home Page