From rellis at math.iit.edu  Mon Nov  2 10:39:46 2009
From: rellis at math.iit.edu (Robert Ellis)
Date: Mon, 2 Nov 2009 11:39:46 -0500
Subject: [Discrete-math-seminar] Discrete Appl. Math. Seminar TODAY 11/2,
	12:50pm E1 119
Message-ID: <e222194e0911020839gd25b335v938554e58fc24c0e@mail.gmail.com>

Please join us for the seminar today at 12:50pm in E1 119.

===========================================

Michael Pelsmajer

Department of Applied Mathematics
Illinois Institute of Technology

Treewidth is, in a way, a measure of how closely a graph resembles a tree.
 It is important for both applied and theoretical reasons (e.g., dynamic
programming, fixed-parameter tractability, graph minors project).

In this talk we introduce treewidth and describe two research questions that
should be accessible to students.  One concerns a graph coloring variant
called "equitable list coloring", and the other generalizes independent sets
and induced matchings.

2 November, 2009  E1 119  12:50 pm

-- 
E1 105C, IL Inst. Tech.
Chicago, IL 60616
(312) 567-5336 --- rellis at math.iit.edu
http://math.iit.edu/~rellis/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://math.iit.edu/pipermail/discrete-math-seminar/attachments/20091102/92725e2f/attachment.htm 

From ulamgamer at gmail.com  Mon Nov  2 11:24:44 2009
From: ulamgamer at gmail.com (Robert Ellis)
Date: Mon, 2 Nov 2009 12:24:44 -0500
Subject: [Discrete-math-seminar] [Sem-coll] Applied Math Colloquium and
	Seminars this week
In-Reply-To: <2e9b7db70911020857n4e1d8046nf115a7207b183627@mail.gmail.com>
References: <2e9b7db70911020857n4e1d8046nf115a7207b183627@mail.gmail.com>
Message-ID: <e222194e0911020924r410b3c61x83ec0f61eca847d3@mail.gmail.com>

Michael Pelsmajer's talk, scheduled for 12:50pm today, is postponed until
Monday, Nov. 9th (same time and place).

Thank you,
Robert Ellis

On Mon, Nov 2, 2009 at 11:57 AM, Joe Millham <jmillhamiit at gmail.com> wrote:

> Please join the Applied Math Department for the following Colloquium
> and Seminars.  All are encouraged to attend, and refreshments will be
> available at some events.  For a complete listing of this semester's
> colloquia and seminars, please visit the listing website:
> http://www.iit.edu/csl/am/colloquia/
>
> Department Colloquium
> Monday, Nov. 2  4:40 pm  E1 106
> Marian Gidea, Northwestern Illinois University
> "How to Change the Inclination of a Libration-Point Satellite"
> see abstract below
> +++++++++++++++++++++++++++++++++++++
>
> DAM / Networks and Optimization Seminars
> Monday, Nov. 2, 12:50 pm E1 119
> Michael Pelsmajer, IIT - Applied Math
> "Two Treewidth Problems"
> see abstract below
> +++++++++++++++++++++++++++++++++++++
>
> Meshfree Methods Seminar
> Wednesday, Nov. 4,  12:45 pm   E1 106
> Ben Niu,  IIT- Applied Math
> "Multi-Level Monte Carlo Algorithms for Infinite-Dimensional
> Integration: A Random Setting"
> see abstract below
> +++++++++++++++++++++++++++++++++++++
> ============================================
> ============================================
> +++++++++++++++++++++++++++++++++++++
>
> Department Colloquium
> Monday, Nov. 2  4:40 pm  E1 106
> Marian Gidea, Northwestern Illinois University
> "How to Change the Inclination of a Libration-Point Satellite"
>
> We consider the spatial circular restricted three-body problem. We
> parametrize the center manifold near one of the libration points by
> action-angle coordinates. We use the method of correctly aligned
> windows to show numerically the existence of orbits that exhibit a
> substantial change in their action coordinate. As an application, one
> can design fuel-efficient maneuvers that change a nearly-horizontal
> orbit of a spacecraft parked near a libration point into a
> nearly-vertical orbit.
> +++++++++++++++++++++++++++++++++++++
>
> DAM / Networks and Optimization Seminars
> Monday, Nov. 2, 12:50 pm E1 119
> Michael Pelsmajer, IIT - Applied Math
> "Two Treewidth Problems"
> Treewidth is, in a way, a measure of how closely a graph resembles a
> tree.  It is important for both applied and theoretical reasons (e.g.,
> dynamic programming, fixed-parameter tractability, graph minors
> project).
>
> In this talk we introduce treewidth and describe two research
> questions that should be accessible to students.  One concerns a graph
> coloring variant called "equitable list coloring", and the other
> generalizes independent sets and induced matchings.
> +++++++++++++++++++++++++++++++++++++
>
> Meshfree Methods Seminar
> Wednesday, Nov. 4,  12:45 pm   E1 106
> Ben Niu,  IIT- Applied Math
> "Multi-Level Monte Carlo Algorithms for Infinite-Dimensional
> Integration: A Random Setting"
> We study randomized algorithms for numerical integration with respect
> to a product probability measure on the sequence space $\R^\N$. We
> consider integrands from reproducing kernel Hilbert spaces, whose
> kernels are superpositions of weighted tensor products. We combine
> tractability results for finite-dimensional integration with the
> multi-level technique to construct new algorithms for
> infinite-dimensional integration. These algorithms use variable
> subspace sampling, and we compare the power of variable and fixed
> subspace sampling by an analysis of minimal errors.
>
>
> See you there!
>
> Joe Millham
> Administrative Assistant
> Department of Applied Mathematics
> Illinois Institute of Technology
> Engineering-1 Room 208
> 10 W. 32rd St.
> Chicago IL 60616
> 312.567.8984 (Phone)
> 312.567.3135 (Fax)
> _______________________________________________
> sem-coll mailing list
> sem-coll at math.iit.edu
> http://math.iit.edu/mailman/listinfo/sem-coll
> _______________________________________________
> fac.all mailing list
> fac.all at math.iit.edu
> http://math.iit.edu/mailman/listinfo/fac.all
>



-- 
E1 105C, IL Inst. Tech.
Chicago, IL 60616
(312) 567-5336 --- rellis at math.iit.edu
http://math.iit.edu/~rellis/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://math.iit.edu/pipermail/discrete-math-seminar/attachments/20091102/fa7b556b/attachment.htm 

From rellis at math.iit.edu  Sat Nov  7 11:28:00 2009
From: rellis at math.iit.edu (Robert Ellis)
Date: Sat, 7 Nov 2009 11:28:00 -0600
Subject: [Discrete-math-seminar] Discrete Applied Math Seminar Monday 12:50pm
Message-ID: <e222194e0911070928i19916a76qfc23f2d29b90c3c8@mail.gmail.com>

Please join us Monday at 12:50pm for the following talk by Michael
Pelsmajer, postponed from last week.

Monday, Nov. 9,  12:50 pm  E1 119
Michael Pelsmajer (IIT - Applied Math)
"Two Treewidth Problems"
Abstract:
Treewidth is, in a way, a measure of how closely a graph resembles a
tree.  It is important for both applied and theoretical reasons (e.g.,
dynamic programming, fixed-parameter tractability, graph minors
project).

In this talk we introduce treewidth and describe two research
questions that should be accessible to students.  One concerns a graph
coloring variant called "equitable list coloring", and the other
generalizes independent sets and induced matchings.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://math.iit.edu/pipermail/discrete-math-seminar/attachments/20091107/bc200f9b/attachment.htm 

From rellis at math.iit.edu  Sat Nov 14 14:28:48 2009
From: rellis at math.iit.edu (Robert Ellis)
Date: Sat, 14 Nov 2009 14:28:48 -0600
Subject: [Discrete-math-seminar] DAM Seminar Monday 11/16: Hemanshu Kaul
Message-ID: <e222194e0911141228p349d77b9g1ca4fd4b77f101b1@mail.gmail.com>

Please join us for the following Discrete Applied Math Seminar this coming
Monday.

Monday, 11/16, 12:50-1:40pm E1 119
Speaker: Hemanshu Kaul, IIT
Title: Finding large subgraphs

Abstract: The maximum subgraph problem for a fixed graph property P asks:
Given a graph, find a subgraph satisfying property P that has the maximum
number of edges. Similarly, we can talk about maximum induced subgraph
problem. This property can be planarity, acyclicity, bipartiteness, etc.

We will discuss some old and new problems of this flavor with special
emphasis on properties defined in terms of forbidden minors. In particular,
we will describe some new results on the maximum K_4 - minor-free subgraph
problem (joint work with Calinescu and Fernandes).

-- 
E1 105C, IL Inst. Tech.
Chicago, IL 60616
(312) 567-5336 --- rellis at math.iit.edu
http://math.iit.edu/~rellis/ <http://math.iit.edu/%7Erellis/>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://math.iit.edu/pipermail/discrete-math-seminar/attachments/20091114/d001a723/attachment.htm