Kevin Keith Ferland
Mathematical and Digital Sciences |
Bloomsburg |
Bloomsburg, |
(570) 389 – 4502 kferland@bloomu.edu |
Ph.D.
in Mathematics, July 1999
M.S.
in Mathematics, May 1994
B.S.
with Honors in Mathematics Interdisciplinary with Computer Science, Summa Cum
Laude, May 1991
TALE Outstanding Teaching
Award, May 2004
Graduating
seniors nominate faculty members for this award, which is organized by the
Teaching and
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.
Professor, August 2008 – Present.
Associate Professor, August 2004 – August 2008.
Assistant Professor, August 1999 – August 2004.
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 1
Math 126, Calculus 2
Math 185, Discrete Mathematics
Math 225, Calculus 3
Math 226, Calculus 4
Math 314, Linear Algebra
Math 360, Number Theory
Math
385, Intro to Combinatorics and Graph Theory
Math
421, Real Analysis
Math 422, Complex Variables
Math 491, Special Topics – Combinatorics and Graph
Theory
Math
492, Independent Study – Honors (History of Calculus).
Math
492, Independent Study – Real Analysis 2.
K. K. Ferland,
Discrete Mathematics and Applications,
Second Edition, CRC Press – Taylor & Francis, Copyright 2017.
K. K. Ferland,
Instructor’s Resource for Discrete Mathematics and Applications, Second
Edition, CRC Press – Taylor & Francis, Copyright 2017.
K. K. Ferland,
Student Solutions Guide for Discrete
Mathematics and Applications, Second Edition, CRC Press – Taylor &
Francis, Copyright 2017.
K. K. Ferland, Discrete Mathematics: An Introduction to
Proofs and Combinatorics, Houghton Mifflin (now CENGAGE), Copyright 2009.
K. K. Ferland, Instructor’s Resource for Discrete Mathematics: An Introduction to
Proofs and Combinatorics, Houghton Mifflin (now CENGAGE), Copyright 2009.
K. K. Ferland, Student’s Solution Guide for Discrete Mathematics: An Introduction to
Proofs and Combinatorics, Houghton Mifflin (now CENGAGE), Copyright 2009.
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,
K. K. Ferland
and Robert W. Pratt, Maximal Crossword Grids, Journal of Combinatorial Mathematics and Combinatorial Computing,
accepted February 2017.
K. K. Ferland, Extending Two
Classic Proofs of the Pythagorean Theorem to the Law of Cosines, MAA Mathematics Magazine, Volume 90, No.
3, June 2017, To Appear.
K. K. Ferland, Record
Crosswords, Amer. Math. Monthly 121 (2014), No. 6, pp. 534–536.
K. K. Ferland,
Mathematician’s Crossword, MAA Focus,
Volume 32, No. 6, p. 9, December 2012/January 2013.
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,
Fitting the Most Words in a Crossword Puzzle, (to be submitted)
Contributed Talk, EPaDel,
November 2017.
Proving the Law of Cosines Like
the Pythagorean Theorem,
AMS Sectional Meeting, Hunter
College, New York, NY, May 2017
The Pi Song Video, YouTube, September 2016
The Easiest Posssible NY Times
Crossword Puzzle
MAA
MathFest, Hartford CT, August 2013.
Xwords,
Mathematics
Department Seminar, Bloomsburg University, March 2013.
Do-It-Yourself Foreign Language Immersion,
BU
French Club, Bloomsburg University, November 2011.
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,
Building the Toughest Networks,
Contributed
Talk, SSHEMA Mathematics Conference,
Constructing 5-Regular 5/2-Tough Graphs,
Contributed Talk, AMS-MAA Joint Mathematics Meetings,
Celebrate Pi Day,
Contributed Presentation,
Mathematics and
The
What, How, and Why of Pi,
Contributed Talk, SSHEMA
Mathematics Conference,
Research
Collaboration Between an Undergraduate and a Faculty Member in Mathematics:
Graph Theory,
Mathematics Seminar,
A
Characterization of the Tough Sets for the Generalized Petersen Graphs G(n,2),
Contributed Talk, AMS-MAA Joint Mathematics Meetings,
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,
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,
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,
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,
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,
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,
On the RO(G)-Graded
Equivariant Ordinary Cohomology of Generalized G-cell Complexes for G = Z/p
Contributed Talk, AMS-MAA Joint Mathematics Meetings,
Referee – Australasian Journal of Combinatorics,
2016
Referee for Journal of Graph Labeling, Fall 2015
Book Review for For All Practical Purposes 9^{th} Edition, Comap, Freeman, Spring 2013
Referee for Computer Mathematics, Spring 2013
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
National Science Foundation
Research Experience for Undergraduates Program, Summer 1990, Worcester
Polytechnic Institute,
Under the direction
of Professor Peter Christopher, I did independent research in graph theory.
American
Mathematical Society
Mathematics
Association of
Phi
Beta Kappa
BU Honorary Degrees, 2016-2018.
General Administration Committee, 2007-2011,
2015-Present
University Sabbatical Committee, 2007-2011,
2013-15.
University Tenure Committee, 2012 – 2013.
Math Department Tenure, Promotion, and
Sabbatical Committee, Chair, 2008-Present.
Math Department Tenure Track Search
Committee, 2016 – 2017.
Mathematics Curriculum Committee 1999-Present.
Math Department Evaluation Committee, 2012 –
Present.
Math Department Tenure Track Screening
Committee, Chair 2015-2016.
Math Club Advisor, 2013 – Present.
Advisor for the Putnam Exam, 2006-Present.
PRAXIS Review Session, 2005-Present.
Advisor, Mathematical Contest in Modeling and Interdisciplinary Contest
in Modeling, 1999-2011.