Jorn van der Pol

Jorn van der Pol is a Lecturer in the Department of Mathematics of Operations Research. His research focuses on matroid theory, combinatorics, and discrete mathematics, with notable contributions to the study of matroid enumeration, properties of matroids, and their applications in graph theory and optimization. His work often intersects with extremal combinatorics, hypergraph structures, and algorithmic enumeration techniques.

Key research interests include Turán densities in hypergraphs, binary geometries, and the analysis of matroid minors. Recent collaborations explore the interplay between matroid theory and stochastic simulation methods. His publications span prestigious journals such as SIAM Journal on Discrete Mathematics and the Electronic Journal of Combinatorics, with an emphasis on open-access research.

Van der Pol’s research trends highlight advancements in enumerative combinatorics, symmetry analysis in matroids, and probabilistic approaches to matroid structures. His work contributes to foundational questions in discrete mathematics and operations research, with applications in graph theory and algorithm design.

No scientific awards are explicitly mentioned. His advising and grant activities remain unspecified in the provided texts. Research collaborations include studies on Earth and Planetary Sciences, though the primary focus remains matroid theory and combinatorial structures.