Kevin Keith Ferland

Mathematics, C.S., and Statistics

Bloomsburg University

Bloomsburg, Pennsylvania 17815

(570) 389 – 4502

kferland@bloomu.edu

EDUCATION

Syracuse University, Syracuse, New York 13244

Ph.D. in Mathematics, July 1999

M.S. in Mathematics, May 1994

University of New Hampshire, Durham, New Hampshire 03824

B.S. with Honors in Mathematics Interdisciplinary with Computer Science, Summa Cum Laude, May 1991

AWARDS and DISTINCTIONS

TALE Outstanding Teaching Award, May 2004

Graduating seniors nominate faculty members for this award, which is organized by the Teaching and Learning Enhancement Center. A committee reads these contributed essays and then selects one or two winners.

Advisor for the Award Winning Bloomsburg University Interdisciplinary Contest in Modeling team,

Meritorious Winners, 2000, 2004 – Second highest distinction., only four teams achieve a higher distinction.

Honorable Mention, 2001, 2005, 2006, 2008 - Third level of distinction.

Successful Participant, 2002, 2003, 2007 – Fourth level of distinction.

Syracuse University College of Arts and Sciences Doctoral Prize, 2000

Awarded for outstanding work on my dissertation "On the RO(G)-Graded Equivariant Ordinary Cohomology of Generalized G-Cell Complexes for G=Z/p."

Project Next Fellow, 1999-2000

The Mathematics Association of America sponsors this national program and annually selects approximately 60 recent Ph.D.'s to participate.

TEACHING EXPERIENCE

Bloomsburg University, Bloomsburg, Pennsylvania 17815

Professor, August 2008 – Present.

Associate Professor, August 2004 – August 2008.

Assistant Professor, August 1999 – August 2004.

Syracuse University, Syracuse, New York 13244

Teaching Assistant, January 1992 - August 1999

Courses Taught

Math 101, Math Thinking

Math 110, College Algebra

Math 111, Finite Mathematics

Math 112, Trigonometry

Math 113, PreCalculus

Math 123, Essentials of Calculus

Math 125, Calculus I

Math 126, Calculus II

Math 185, Discrete Mathematics

Math 225, Calculus III

Math 226, Calculus IV

Math 314, Linear Algebra

Math 360, Number Theory

Math 385, Intro to Combinatorics and Graph Theory

Math 421, Advanced Calculus

Math 422, Complex Variables

Math 491, Special Topics – Combinatorics and Graph Theory

Math 492, Independent Study – Honors (History of Calculus).

RESEARCH

Books

K. K. Ferland and L. Gaunce Lewis, Jr., The RO(G)-Graded Equivariant Ordinary Homology of G-Cell Complexes with Even Dimensional Cells for G = Z/p, Memoirs of the American Mathematical Society, Volume 167, Number 794, pp. 1-129, January 2004.

K. K. Ferland, On the RO(G)-Graded Equivariant Ordinary Cohomology of Generalized G-cell Complexes for G = Z/p, Ph.D. Thesis, Syracuse University, 1999.

Publications

K. K. Ferland, Toughness of Infinite Graphs, ARS Combinatoria, Volume 97A, pp. 319-326, 2010.

L. L. Doty and K. K. Ferland, Constructing a Large Class of Supertough Graphs, Australasian Journal of Combinatorics Volume 43, pp. 191-196, 2009.

L. L. Doty and K. K. Ferland, Supertough 5-Regular Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 64, pp. 97-108, 2008.

L. L. Doty and K. K. Ferland, Some Maximally Tough Circulants, ARS Combinatoria, Volume 87, pp. 193-203, 2008.

K. K. Ferland, Sweet Tangent Line, The Journal of Irreproducible Results, Volume 50, Number 4, p.7, 2007.

Bill Calhoun, Kevin Ferland, Lisa Lister, and John Polhill, Minimal Distinct Distance Trees, Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 61, pp. 33-57, 2007.

K. K. Ferland and M. L. Holben, The Tough Sets for the Generalized Petersen Graphs G(n,2), Australasian Journal of Combinatorics, Volume 34, pp. 211-228, 2006.

K. K. Ferland, The Original MAA, The American Mathematical Monthly, Volume 112, No. 10, p.875, 2005.

K. K. Ferland, In Need of Analysis, The College Mathematics Journal, Volume 36, No. 5, p. 365, 2005.

K. K. Ferland, Tips from Terrific Teachers, New At BU 2005, p. 24, 2005.

K. K. Ferland, From the Right Side, The ΠΜΕ Journal, Vol. 12, No. 2, p. 104, 2005.

K. K. Ferland, The What, How, and Why of Pi, Proceedings of SSHE-MA, The Pennsylvania State System of Higher Education Mathematics Association, Volume 9, 2005.

L. L. Doty and K. K. Ferland, Supertough Graphs Need Not Be K_1,3-free, Australasian Journal of Combinatorics, Volume 32, pp. 91-103, 2005.

Bill Calhoun, Kevin Ferland, Lisa Lister, and John Polhill, Totally Magic Labelings of Graphs, Australasian Journal of Combinatorics, Volume 32, pp. 47-59, 2005.

K. K. Ferland, What is Discrete Mathematics?, Proceedings of SSHE-MA, The Pennsylvania State System of Higher Education Mathematics Association, Volume 8, 2004.

L. L. Doty and K. K. Ferland, Maximally Tough Cubic Graphs, Congressus Numerantium, Volume 161, pp. 75-96, 2003.

K. K. Ferland, Maximum Toughness of Sesqui-Cubic Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 44, pp.129-144, February 2003.

K. K. Ferland, Toughness of Generalized Petersen Graphs, ARS Combinatoria, Volume 66, pp.49-63, January 2003.

K. K. Ferland, Optimal Networks have Maximum Toughness, Proceedings of SSHE-MA, The Pennsylvania State System of Higher Education Mathematics Association, Volume 6, 2002.

K. K. Ferland, Maximum Toughness Among (n,m)-Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 43, pp.43-55, November 2002.

K. K. Ferland and R. Noubary, Simpson's Paradox: Why you should watch your weight, Carver, Volume 19, No. 1, 2002.

K. K. Ferland, Toughness of Graphs, Proceedings of SSHE-MA, The Pennsylvania State System of Higher Education Mathematics Association, Volume 4, 2000.

K. K. Ferland and F. Luca, Deconstructing Conic Sections, Problems, Number 1587, Mathematics Magazine, Vol. 72, No. 5, December 1999.

K. K. Ferland, On the Toughness of Some Generalized Petersen Graphs, ARS Combinatoria 36 (1993), pp. 65-88.

P. A. Mayewski, G. Holdsworth, M. J. Spencer, S. Whitlow, M. Twickler, M. C. Morrison, K. K. Ferland, and L. D. Meeker, Ice core sulfate from three Northern Hemisphere sites: Source and temperature forcing implications, Atmospheric Environment, Vol. 27A, No. 17/18, p. 2915-2919, 1993

P. A. Mayewski, L. D. Meeker, M. C. Morrison, M. S. Twickler, S. I. Whitlow, K. K. Ferland, D. A. Meese, M. R. Legrand, and J. P. Steffensen, Greenland ice core "signal" characteristics: An expanded view of climate change, Journal of Geophysical Research, Vol. 98, No. D7, p. 12,839-12,847, 20 July 1993

Talks Presented

Generalizing the Pythagorean Theorem and Its Proof.

MAA MathFest, Pittsburgh, PA, August 2010.

What Should Adorn Next Year’s Math Contest T-Shirt?,

Mathematics Department Seminar, Bloomsburg University, February 2010.

Toughness Extended to Infinite Graphs,

Contributed Talk, AMS-MAA Joint Mathematics Meetings, Washington, DC, January 2009.

Extending Toughness to Infinite Graphs,

Contributed Talk, AMS Sectional Meeting, Stevens Institute of Technology, Hoboken, NJ, April 2007

Building the Toughest Networks,

Contributed Talk, SSHEMA Mathematics Conference, Edinboro University, Meadville, PA, March 2006.

Constructing 5-Regular 5/2-Tough Graphs,

Contributed Talk, AMS-MAA Joint Mathematics Meetings, San Antonio, TX, January 2006.

Celebrate Pi Day,

Contributed Presentation, Mathematics and Science Learning Center and NSF CETP-PA Professional Development Day, Bloomsburg University, October 14, 2005.

The What, How, and Why of Pi,

Contributed Talk, SSHEMA Mathematics Conference, Millersville University, Millersville, PA, March 2005.

Research Collaboration Between an Undergraduate and a Faculty Member in Mathematics: Graph Theory,

Mathematics Seminar, Bloomsburg University, February 22, 2005.

A Characterization of the Tough Sets for the Generalized Petersen Graphs G(n,2),

Contributed Talk, AMS-MAA Joint Mathematics Meetings, Atlanta, GA, January 2005.

Maximum Toughness when Edges are Relatively Abundant or Scarce,

Contributed Talk, SIAM Conference on Discrete Mathematics, Loews Vanderbilt Plaza Hotel, Nashville, TN, June 2004.

What is Discrete Mathematics?,

Contributed Talk, SSHEMA Mathematics Conference, East Stroudsburg University, East Stroudsburg, PA, March 2004.

The Toughest Networks,

TALE presentation, Blooomsburg University, Bloomsburg, PA, September 2003.

Why Maximum Toughness is Tougher than Maximum Connectivity,

Contributed Talk, SSHEMA Mathematics Conference, Indiana University, Indiana, PA, March 2003.

Nearly Cubic Maximally Tough Graphs

Contributed Talk, Thirty-fourth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, Boca Raton, FL, March 2003.

Maximum Toughness and Nearly Regular Graphs

Contributed Talk, AMS-MAA Joint Mathematics Meetings, Baltimore, MD, January 2003.

Statistical Surprises and Simpson’s Paradox,

Invited Talk, Southern Columbia High School, Ms. Sock’s class, October 2002.

Optimal Networks Have Maximum Toughness,

Contributed Talk, SSHEMA Mathematics Conference, Kutztown University, Kutztown, PA, April 2002.

Simpson’s Paradox: Statistics that make you think,

Invited Talk, Southern Columbia High School, Ms. Jeffrey’s and Mr. Bet’s classes, December 2001.

Answers to Your Questions about Maximum Toughness.

Mathematics Seminar, Blooomsburg University, Bloomsburg, PA, October 2001.

The Maximum Toughness of a Graph.

Contributed Talk, Special Session on Combinatorics and Graph Theory, AMS Sectional Meeting, Columbia, SC, March 2001.

Graph Theory, Coloring, and the Four Color Theorem,

Invited Talk, Watsontown Christian Academy, Mrs. Nuss' class, December 2000.

Graph Theory: It's not the theory of graphs of functions.

Contributed Talk, Bloomsburg University Education Conference, October 2000.

Toughness of Graphs

Contributed Talk, SSHEMA Mathematics Conference, Clarion University, Clarion, PA, April 2000.

What is Graph Theory? It's not the math you hated in high school.

TALE presentation, Blooomsburg University, Bloomsburg, PA, April 2000.

How tough can graphs be?

Mathematics Seminar, Blooomsburg University, Bloomsburg, PA, February 2000.

Toughness of Generalized Petersen Graphs

Contributed Talk, AMS-MAA Joint Mathematics Meetings, Washington, D.C., January 2000.

Simpson's Paradox

Contributed Talk, Bloomsburg University Education Conference, October 1999.

What’s so tough about generalized Petersen graphs?

Mathematics Seminar, Blooomsburg University, Bloomsburg, PA, March 1999.

On the RO(G)-Graded Equivariant Ordinary Cohomology of Generalized G-cell Complexes for G = Z/p

Contributed Talk, AMS-MAA Joint Mathematics Meetings, San Antonio, Texas, January 1999.

Computing the Homology of Complex Grassmannians the Fast and Easy Way

Contributed Talk, Syracuse University Graduate Mathematics Conference, March 1998.

Other Research activities

Referee for Mathematics Journals

Graphs and Combinatorics, Summer 2008

Electronic Journal of Combinatorics, Spring 2007

Discrete Mathematics, Summer 2006, Spring 2007

ARS Combinatoria, Summer 1994

Greenland Ice Sheet Project Two (GISP2) Researcher, Summers of 1991 and 1992, Institute for the Study of Earth, Oceans, and Space, University of New Hampshire, Durham, New Hampshire 03824

I worked with a geologist, Professor Paul Mayewski, and did a statistical analysis of glaciochemical time-series recovered from central Greenland. This led to two publications.

National Science Foundation Research Experience for Undergraduates Program, Summer 1990, Worcester Polytechnic Institute, Worcester, Massachusetts 01609

Under the direction of Professor Peter Christopher, I did independent research in graph theory.

Professional Organizations

American Mathematical Society

Mathematics Association of America

Society for Industrial and Applied Mathematics

Phi Beta Kappa

UNIVERSITY SERVICE

BU Planning and Budget Committee, Elected 2010

BU Smoking Policy Special Committee, Appointed, 2010.

TALE Outstanding Teacher Award Selection Committee, 2009-Present.

Math Department Promotion Committee, Chair, 2008-Present

University Sabbatical Committee, Chair, 2007-Present.

General Administration Committee, 2007-Present.

Advisor for the Putnam Exam, 2006-Present.

PRAXIS Review Session, 2005-Present.

Mathematics, Computer Science, and Statistics Five Year Review Committee, 2005-2006.

Judge and Problem Editor for Math/C.S./Stats High School Programming Contest, 2005-Present.

TALE Co-Chair, 2005-2007.

University Relations, 2004-2005.

Search Committee for Instructional Technology Specialist, Fall 2004.

Mathematics Search and Screen Committee, 2003-2004

Mathematics Recruitment Committee, 2003-2004

Search Committee for Student Recreation Center Director, Spring 2003.

Move-in Day Helper, August 2002, 2003, 2004.

Student Recreation Center Governing Board, Faculty Representative, 2002-2003.

Director of Special Session of Mathematical Modeling Contest Talks at SSHE-MA Conference, 2002-Present

Mathematics Calculus Book Committee, 2002.

Library Advisory Board, 2001-2003, 2003-2004, 2004-2006.

Mathematics Freshmen Initiatives Committee, 2001-2003.

Mathematics Placement Committee, 2001-Present.

Co-Supervision of Student Teachers through CETP-PA grant, Observations of mathematics student teachers, 2000-2003.

NSF Collaborative for Excellence in Teacher Preparation – Pennsylvania (CETP-PA) at Bloomsburg University Team Member, 2000-2005.

Search Committee for Bloomsburg University TALE Program Director, Fall 2000.

Director of the High School Speakers Program, 2000-Present

Serves both University and Community.

Mathematics Department TALE Ambassador, 2000-2005.

Mathematics Curriculum Committee Chair 2001-02, 2004-05, Member 1999-Present.

Advisor, Mathematical Contest in Modeling and Interdisciplinary Contest in Modeling, 1999-Present.

Mathematics Display Case Coordinator, 1999-Present.