The talks in this seminar are announced through an email list, please sign up at

# Discrete Applied Math Seminar

No events featured at this time...

The talks in this seminar are announced through an email list, please sign up at

No events featured at this time...

William Schwartz - Department of Applied Mathematics, Illinois Institute of Technology

Jan 15, 2019 - 12:45pm to 1:45pm

College of Science, Applied Mathematics - Seminar - Rettaliata Engineering Center 102

In this talk I introduce a generic, statistical model of longitudinal/panel network data analyzable with existing tools for popular, single-observation network models. The existing network models have been used since the 1980s to describe social networks of a fixed set of people whose friendships... read more

Tue.

Jan 15

Christodoulos Mitillos - Department of Applied Mathematics, Illinois Institute of Technology

Nov 6, 2018 - 3:15pm to 4:15pm

College of Science, Applied Mathematics - Seminar - Rettaliata Engineering Center, Room 102

Graph fall-coloring is the partition of the vertices of a graph into independent dominating sets. A problem is in NP if its solutions can be verified in polynomial time. A problem is NP-complete if it is in NP and every problem in NP can be efficiently converted to an instance of this problem.... read more

Tue.

Nov 6

Marcus Schaefer - School of Computing, Depaul University

Nov 2, 2018 - 12:45pm to 1:45pm

College of Science, Applied Mathematics - Seminar - Rettaliata Engineering Center, Room 119

When drawing a graph in the plane, we may have to allow edges to cross each other. The crossing number of a graph is the smallest number of crossings required to draw the graph. The crossing number is a measure of the non-planarity of a graph, and it has become a central tool in graph drawing. In... read more

Fri.

Nov 2

Jeff Mudrock - Department of Mathematics, College of Lake County

Oct 12, 2018 - 12:45pm to 1:40pm

College of Science, Applied Mathematics - Seminar - Rettaliata Engineering Center, Room 106

List coloring, a variation on the typical vertex coloring problem, was introduced independently by Vizing and by Erdos, Rubin, and Taylor in the 1970’s. In list coloring the vertices of a graph are each assigned a list of colors, a so called list assignment. For a given list... read more

Fri.

Oct 12

Lujia Wang - Department of Mathematics, University of California at San Diego

Aug 29, 2018 - 12:45pm to 1:45pm

College of Science, Applied Mathematics - Seminar - TBA

A sunflower is a collection of distinct sets such that the intersection of any two of them is the same as the common intersection \(C\) of all of them, and \(|C|\) is smaller than each of the sets. There has been a lot of recent progress on determining the maximum size of a sunflower-free family of... read more

Wed.

Aug 29

Amanda Redlich - Department of Mathematics, Bowdoin College

Apr 9, 2018 - 10:00am to 11:00am

College of Science, Applied Mathematics - Seminar - Rettaliata Engineering Center, Room 121

Suppose you need to get a cup of coffee before your ten am discrete seminar talk. You see three different cafes on the way to campus. How do you pick which one to go to? This talk will give a simple randomized algorithm that models a natural decision-making process in such contexts, discuss its... read more

Mon.

Apr 9

Christodoulos Mitillos - Department of Applied Mathematics, Illinois Institute of Technology

Apr 3, 2018 - 12:45pm to 1:45pm

College of Science, Applied Mathematics - Seminar - Rettaliata Engineering Center, Room 119

Graph fall-colouring is the partition of the vertices of a graph into independent dominating sets. A problem is in NP if its solutions can be verified in polynomial time. A problem is NP-complete if it is in NP and every problem in NP can be efficiently converted to an instance of this ... read more

Tue.

Apr 3

Joungmin Song - Gwangju Institute of Technology

Mar 28, 2018 - 12:45pm to 1:45pm

College of Science, Applied Mathematics - Seminar - Rettaliata Engineering Center, Room 106

A hyperplane arrangement is a finite set of hyperplanes in the real affine space \(R^n\). In this talk, we are concerned with the hyperplane arrangement \(J_n\) consisting of the planes satisfying equations: \(x_i = 0\), \(x_j = 1\), and/or \(x_i + x_j = 1\), \(1\leq i, j\leq n\). The number of... read more

Wed.

Mar 28

Xujun Liu - Department of Mathematics, University of Illinois at Urbana-Champaign

Feb 21, 2018 - 12:45pm to 1:45pm

College of Science, Applied Mathematics - Seminar - Rettaliata Engineering Center, Room 119

A packing \(k\)-coloring of a graph \(G\) is a partition of the vertex set \(V(G)\) into sets \(V_1,\ldots,V_k\), such that for each \(i\), the distance between any two distinct \(x\) and \(y\) in \(V_i\) is at least \(i+1\). The packing chromatic number of a graph \(G\) is the minimum \(k\) such... read more

Wed.

Feb 21

Anton Bernshteyn - Department of Mathematics, University of Illinois at Urbana-Champaign

Feb 7, 2018 - 12:45pm to 1:45pm

College of Science, Applied Mathematics - Seminar - Rettaliata Engineering Center, Room 106

A classical theorem of Johansson from 1996 asserts that \(\chi(G)=O(\Delta/\ln\Delta)\) for triangle-free graphs \(G\) of maximum degree \(\Delta\). Johansson's original proof of this result was quite intricate and involved iterated applications of the Lov\'asz Local Lemma. Recently, Molloy has... read more

Wed.

Feb 7