Adam Hausknecht, PhD

Professor

Mathematics

Curriculum Vitae

508-999-8322

508-910-6917

cjcwumpgejvBwocuuf0gfw

Liberal Arts 394B


Education

1969U.C. BerkeleyA.B.
1972U.C. BerkeleyM.A.
1975U.C. BerkeleyPh.D

Teaching

  • Modern Algebra
  • Discrete Mathematics
  • Scientific Computation
  • Data Structures and Algorithms
  • Computer Graphics

Teaching

Programs

Teaching

Courses

An introduction to mathematical reasoning, mathematical logic, and methods of proof. Topics include: properties of numbers, elementary counting methods, discrete structures, Boolean algebra, introduction to directed and undirected graphs, methods of proof, and applications in mathematics and computer science. This is the first semester of a discrete mathematics sequence designed for Mathematics, Computer and Information Sciences majors. This course fulfills the general education core requirements for Mathematics, Computer and Information Sciences majors who matriculated prior to Fall 2012 and has been approved by University Studies Curriculum for students matriculating in Fall 2012 or later.

A study of mathematical foundations for advanced mathematics and theoretical computer science. Topics include: mathematical reasoning including mathematical induction, combinatorial analysis including simple probability, discrete structures (such as sets, recursions, relations, and trees), algorithmic thinking, applications, and modeling (such as combinatorial circuits). This is the second semester of a discrete mathematics sequence designed for Mathematics and Computer Information Sciences majors. This course fulfills the general education core requirements for Mathematics, Computer and Information Sciences majors who matriculated prior to Fall 2012 and has been approved by University Studies Curriculum for students matriculating in Fall 2012 or later.

A study of mathematical foundations for advanced mathematics and theoretical computer science. Topics include: mathematical reasoning including mathematical induction, combinatorial analysis including simple probability, discrete structures (such as sets, recursions, relations, and trees), algorithmic thinking, applications, and modeling (such as combinatorial circuits). This is the second semester of a discrete mathematics sequence designed for Mathematics and Computer Information Sciences majors. This course fulfills the general education core requirements for Mathematics, Computer and Information Sciences majors who matriculated prior to Fall 2012 and has been approved by University Studies Curriculum for students matriculating in Fall 2012 or later.

Continuation of MTH 211. Ordinary differential equations of the first order, linear differential equations of the nth order, some nonlinear second order equations, series solutions and Laplace transforms.

Continuation of MTH 211. Ordinary differential equations of the first order, linear differential equations of the nth order, some nonlinear second order equations, series solutions and Laplace transforms.

Continuation of MTH 211. Ordinary differential equations of the first order, linear differential equations of the nth order, some nonlinear second order equations, series solutions and Laplace transforms.

Continuation of MTH 211. Ordinary differential equations of the first order, linear differential equations of the nth order, some nonlinear second order equations, series solutions and Laplace transforms.

The study of relations, functions, groups, rings and fields.

Analysis of curves and surfaces. Frenet-Serret formulae. Fist and second fundamental forms for surfaces, Gaussian and mean curvature, theorems of Meusnier and Rodriques and the Gauss-Bonnet theorem are also studied.

A special course to meet the needs of students for material not encountered in other courses. Topics dealt with require the approval of the departmental chairperson.

Research

Research Interests

  • Software for Mathematics Education
  • Computer Graphics
  • Scientific Computation
  • Noncommutative Algebra

External links

Request edits to your profile