Sam Dittmer
Graduate Student
UCLA Mathematics Department
Office: MS 3969
Winter 2019 Office Hours: Tu 1-2 W 9-10 Th 3-4
Currently Teaching: TA for PIC 20A
Section 1 and Section 2 with Omri Azencot.
I am a fifth-year graduate student. My research focuses on combinatorics and related questions in discrete probability and computational complexity. My
advisor is Igor Pak.
I did my undergraduate study at Brigham Young University. My undergraduate advisor was Pace Nielsen.
Here is my CV, my Research Statement and my Teaching Statement.
I am one of the organizers of the Utah Math Olympiad.
Research
Papers:
- (with Igor Pak) Counting linear extensions of restricted posets, submitted (2018), 33 pp.
Download pdf file. ArXiv version here.
- (with Alexander J. Diesl and Pace P. Nielsen) Idempotent lifting and ring extensions, J. Algebra Appl., vol. 15 issue 6, (2016) 16 pp.
Download pdf file. Published version: here.
- Spoof odd perfect numbers, Math. Comp. vol. 83 (2014), 2575-2582.
Math. Comp., pdf. Published version: here.
- (with Pace Nielsen) On a question of Hartwig and Luh, Bull. Aust. Math. Soc. vol. 89 (2014), 271-278.
Download pdf file. Published version: here.
- (with Michael Proulx and Stephanie Seybert) Some arithmetic problems related to class group L-functions, Ramanujan Jour. vol. 37, issue 2 (2015), 257-268.
Download pdf file. Published version: here.
In preparation:
- (with Igor Pak) Sampling sparse contingency tables, preprint available upon request.
We use a Monte Carlo Markov chain approach to count and sample from the nearly uniform distribution on contingency tables.
- (with Igor Pak) Contingency tables have empirical bias, preprint available upon request.
In 2002, Barvinok proposed the presence of a bias in the distribution of entries of contingency tables.
We use the algorithm from the previous paper to evaluate this claim experimentally, confirming the conjecture in some cases and refining it in others.
- (with Igor Pak) Fast sampling of high dimensional contingency tables, in preparation.
We present a new algorithm which samples high dimensional contingency tables, then perform simulations on a number of existing datasets to demonstrate its efficiency.
- (with Igor Pak) Counting linear extensions of dimension two posets, , in preparation.
We show that counting linear extensions of dimension two posets is #P-complete by constructing logic gates through a brute force computer search.
Presentations
- Counting restricted posets, Claremont McKenna College, Apr 2018.
- Counting linear extensions of height two and incidence posets, UCLA, Mar 2018.
- Dimension two posets are parity-P complete, UCLA, May 2017.
Teaching
I have been a TA for:
- PIC 20A: Java with Applications, Winter 2019
- PIC 16: Python with Applications, Fall 2018
- PIC 10A: Introduction to Programming, Summer 2018
- Math 182: Algorithms, Spring 2018
- Math 170: Probability Theory, Winter 2018
- Math 31A: Differential and Integral Calculus, Fall 2017
- Math 31AL: Differential and Integral Calculus (an experimental variant with more TA involvement), Fall 2017
- Math 3C: Ordinary Differential Equations with Linear Algebra for Life Science Students, Fall 2016, Spring 2017, Summer 2018
- Math 115: Linear Algebra (first UCLA proofs class), Fall 2016, Winter, Summer 2017
- Math 61 Fall 2015, Winter, Spring 2016
- Math 33A: Linear Algebra and Applications, Fall, Winter, Spring 2015, Winter 2016, Winter 2017
- Math 1: Precalculus, Fall 2014
For my PIC 16 students in section 2A: Claire De Lune.
For my PIC 20A students:
Week 1 sample code.
Week 2 sample code and sorting algorithm time trial.
Week 3 sample code: Choose your own adventure game from Section 1 and Section 2 and mini math problems.
Five in a row game: With buttons only and with buttons and labels.
Final review: zip file.
Contact:
UCLA Mathematics Department
Box 951555, Los Angeles, CA 90095
samuel.dittmer@math.ucla[dot edu]