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...

Sara Jamshidi Zelenberg - Illinois Tech

Nov 13, 2019 - 12:45pm to 1:15pm

College of Science, Applied Mathematics - Seminar - RE 106

Work by Tversky and others in psychology have shown that humans utilize a number of cognitive biases and heuristics to simplify their decision-making processes under conditions of uncertainty. Here, we develop a model inspired by the representative heuristic, which we call cognitive probabilities.... read more

Wed.

Nov 13

Paul Shin, College of Lake County

Oct 14, 2019 - 12:45pm to 2:00pm

College of Science, Applied Mathematics - Seminar - RE 121

This talk will be on a variation of the classical vertex coloring problem in graph theory. In this problem, we seek to assign a color to each vertex of a graph so that no two adjacent vertices receive the same color (a so-called proper coloring). List coloring is a well-known variation... read more

Mon.

Oct 14

Jeff Mudrock - Department of Mathematics, College of Lake County

Aug 28, 2019 - 12:45pm to 1:45pm

College of Science, Applied Mathematics - Seminar - TBD

The chromatic polynomial of a graph has been studied since the early 20th century; it is a polynomial that outputs the number of proper m-colorings of the graph for any positive integer input m. List coloring is a well-known variation on classic vertex coloring where each vertex of... read more

Wed.

Aug 28

Miles Bakenhus - Department of Applied Mathematics, Illinois Institute of Technology

May 1, 2019 - 3:15pm to 4:30pm

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

Introduction to Positional Games
Positional games are 2-player, finite, combinatorial games, in which players have perfect information, and there are no chance moves. There are several types of these games, each with distinct properties that affect how winning strategies are developed.
Since... read more

Wed.

May 1

Quinn Stratton - Department of Applied Mathematics, Illinois Institute of Technology

Apr 29, 2019 - 3:15pm to 4:30pm

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

Probabilistic Proofs of the Colorful Caratheodory and Tverberg’s Theorems in Combinatorial Geometry
We examine new probabilistic proofs of the colorful Caratheodory theorem and Tverberg’s theorem with tolerance. These theorems are classic results in the study of the intersection patterns of convex... read more

Mon.

Apr 29

Xiaolang Wang - Department of Computer Science, Illinois Institute of Technology

Mar 12, 2019 - 12:45pm to 1:45pm

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

Interactivity is a primary performance measure for distributed interactive applications (DIAs). In a network supporting a DIA, interactivity performance depends on both client-to-server network latencies and inter-server network latencies. An optimization problem, which we term FCSA, seeks to find... read more

Tue.

Mar 12

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