Dr. Nicole Engelke 12/12/2011

Dr. Engelke will present "Student Difficulties in the Production of Combinatorial Proofs"

Date: 12/12/2011
Time: 4:00-5:00 PM
Place: 315 Armstrong Hall
*Refreshments will be served at 3:30PM in 310 Armstrong Hall.

Combinatorial proof, the art of counting a set in two distinct ways to prove a statement, is a technique which emphasizes conceptual understanding of a problem and encourages creative thinking. We identify four categories of student difficulties with this type of proof, and introduce the term pseudo-semantic proof production to describe the attempt to write a combinatorial proof by relying on the syntax of previously encountered proofs. We illustrate the categories of student difficulties and pseudo-semantic proof production with three case studies drawn from a preliminary study of combinatorial proofs written by students in an upper-division combinatorics course and a graduate-level discrete mathematics course.

Date, Location: 

Dr. Yi-Yin (Winnie) Ko 12/9/2011

Dr. Ko will present, "Undergraduate Mathematics Majors’ Performance Constructing Proofs".

Date: 12/9/2011
Time: 4:00-5:00 PM
Place: 315 Armstrong Hall
*Refreshments will be served at 3:30PM in 310 Armstrong Hall.

Current reforms highlight the importance of teaching and learning proof in undergraduate mathematics education. Undergraduate mathematics majors, including pre-service secondary mathematics teachers, are expected to have mastered the skills required to produce proofs. However, the corpus of existing literature suggests that many undergraduate mathematics students still have considerable difficulty with proof. In this talk, I will present results concerning undergraduate mathematics majors’ performance constructing proofs in the domains of algebra, analysis, geometry, and number theory. Implications of this study’s findings for undergraduate proof courses and for pre-service secondary mathematics teachers, including directions of future research, will also be addressed.

Date, Location: 

Professor Jeremy Edwards 12/8/2011

University of New Mexico Department of Molecular Genetics and Microbiology
Professor to give a presentation titled, "Membrane Organization and the Quantitative Understanding of Cell Signaling".

Date: 12/8/2011
Time: 3:45-4:45 PM
Place: 315 Armstrong Hall

Prof. Jeremy Edwards has a remarkable record of achievement in
quantitative systems biology. He obtained his PhD (1999) in
Bioengineering at UC San Diego with Prof. Bernhard Palsson. He was
first author on a number of seminal papers in the field of metabolic
network analysis. After a postdoc in the Church Lab at Harvard, he
joined the faculty at the University of Delaware, where he started a
new line of investigation, in collaboration with Prof. Dionysios
Vlachos. They applied ideas and computational methods from catalysis
modeling to the spatial dynamics of membrane-bound receptors which in
turn modulate the first steps in cell signaling. The cell membrane is
a complex system whose structural and functional details are at the
edge of current experimental capabilities, and "big science"-grade
computational models are the only way to bring together the emerging
large and diverse sets of data.

In 2005 Prof. Edwards moved back to his home town of Albuquerque to
join the University of New Mexico (UNM) where he serves as co-director
for mathematical modeling at the New Mexico Center for Spatio-Temporal
Modeling of Cell Signaling (STMC). The STMC, one of a few NIH-NIGMS
funded Centers for Systems Biology, brings together a set of
world-class experimental labs and modelers dedicated to
the spatio-temporal aspects of cell signaling. Dr. Edwards is also a
member of the NCI-designated Cancer Center affiliated with UNM.
In addition to his work on the modeling side, Prof. Edwards is a major
figure in next generation DNA sequencing, where his lab holds several
patents. He is the main author of the method of polymerase colony
orpolony sequencing and is principal investigator on a large NIH grant
aimed at developing the "$1000 genome".

His talk will discuss some of the significant progress on
understanding signal initiation, obtained through computational
methods ranging from large scale Monte Carlo simulations to
small dynamical simulations and mathematical insight, in conjunction
with cutting edge experimental data collected at the STMC.

Date, Location: 

Professor David Klinke 10/27/2011

West Virginia University Professor to give presentation....

Date: 10/27/2011

Time: 4:00 PM- 5:00 PM

Place: 315 Armstrong Hall

Title: In silico model-based inference: a contemporary approach for
hypothesis testing in cell signaling research

Below you can download the files that will accompany the talk.



The following compatibility pack for older versions of Microsoft Word
will allow you to open and view the DOCX file.

Date, Location: 

Professor Jim Faeder 10/20/2011

University of Pittsburgh Professor to give presentation....

Date: 10/20/2011
Time: 3:45-4:45PM
Place: 315 Armstrong Hall

Title: Rule-Based Modeling for Systems Biology

Below you can download the files that will accompany the talk.

PDF File

TEX File

Date, Location: 

Dr. Truyen Van Nguyen 9/22/2011

Dr. Truyen Van Nguyen
Department of Mathematics, University of Akron.

Title: Regularity of Solutions to the Linearlized Monge-Ampere Equation
Date: 9/22/2011
Time: 3:45PM-4:45PM
Place: 315 Armstrong Hall

Abstract: View Nguyen Abstract
Tex: View Tex File

Date, Location: 

Combinatorics Seminar 9/21/2011

Date: 9/21/2011
Time: 3:30 PM
Place: 315 Armstrong Hall

We will have two 25 minute talks on the cycle double cover
conjecture, one by Dong Ye, the other by Wenliang Tang. Summaries:

Cycle double cover on cubic graphs with large circumference
Dong Ye

Let G be a bridgeless cubic graph with n vertices. The circumference
of G is the size of a longest circuit of G. By using computers,
Hagglund and Markstom verified that G has a cycle double cover if its
circumference is at least n-9. In this talk, we give a direct proof to
show that a cubic graph G with circumference at least n-8 has a cycle
double cover.

Strong cycle double cover conjecture on two special classes of graphs
Wenliang Tang

Let G be a bridgeless cubic graph and C is any given circuit in G, it was
conjectured that we can find a family of circuits containing C such that
every edge of G is covered exactly by two members of this family. This is
the well-known "Strong Circuit Double Cover Conjecture". I am going to
verify this conjecture on two special classes of cubic graphs.

Date, Location: 

Professor Moseley 9/1/2011

I will be giving an undergraduate colloquium on Thursday
September 1, 2011 in Armstrong 315 at 3:30 to help everyone to
understand the "Linear Operator Theory" approach to Math 251 and Math
261. See attached. Not all in Math 251 and Math 261 is Linear Theory,
but enough is to make this approach reasonable, especially for the
engineers. About 90-99% of the students in Math 251 and Math 261 are
engineers. They need to know what a Linear System is from a mathematical
perspective. This begins with the definition of a vector space as an
abstract algebraic structure. Students (engineering and others) find
this hard, but math avoidance is not the answer. In my classes I am
trying to keep them from getting stuck in 3 space. (Please help me.
I'm stuck in 3 space and I can't get out.) The sooner they are exposed
to the Euclidean view of mathematics, the better. This does not
necessarily mean a lot of proofs. I do very few proofs. You and all
of your students are invited. If we overflow, we will move to Eiesland
G34 (the auditorium) provided I can figure out how to run the
technology. I have enough overheads for 2-3 hours. However, I have cut
it down to a 10-20 minute talk plus questions. Hope to see you there.

PDF for colloquium can be downloaded here

Date, Location: 


The schedule of colloquia / seminars will be posted in August 2011.

Date, Location: 


Subscribe to