Welcome to the home page of Jeremy Aikin
Associate Professor of Mathematics
CSU San Bernardino
Email: jaikin "at" csusb "dot" edu
- Math 212-04 (Calculus 2) TR 10:00 - 11:50 am, JB-138
- Math 251-02 (Multivariable Calculus 1) TR 2:00 - 3:50 pm, JB-383
My general area of research is combinatorics, and more specifically, matroid theory and graph theory. A matroid
is a finite set E
with a notion of what it means for subsets of E
to be independent
. Important examples of matroids are: 1) finite sets of vectors from a vector space, where linear independence serves as the notion of independence; and 2) finite graphs or networks, where E
is the set of edges in the graph and subsets of E
are independent precisely when they do not contain a cycle. In general, not all matroids arise from these settings, and it is this variety and versatility that makes studying matroids so exciting.
- (with A. Bland) Monochromatic sinks in 3-switched tournaments , Australasian Journal of Combinatorics,
73 (1) (2019), 71–83.
- (with J. Oxley) The structure of the 4-separations in 4-connected matroids, Adv. in Appl. Math. 48 (2012), 1-24.
- (with C. Chun, R. Hall, and D. Mayhew) Internally 4-connected binary matroids with cyclically sequential orderings, Discrete Math. 310 (2010) 92-108.
- (with J. Oxley) The structure of crossing separations in matroids, Adv. in Appl. Math. 41 (2008), 10-26.