Dr Steven Noble

Overview
Overview
Biography
I obtained my first degree in mathematics in 1993 from the University of Oxford, where I was a member of New College. I was fortunate enough to be able to continue studying in Oxford for a DPhil on the Complexity of Graph Polynomials under the supervision of Dominic Welsh which I completed in 1997. Between 1996 and 1998, I had parttime teaching appointments in Oxford at New College and then at Merton, covering for faculty who were on sabbatical. In October 1998 I was appointed as a lecturer at Brunel University and promoted to senior lecturer in 2010. From summer 2012 to summer 2015, I was head of department of mathematics at Brunel. During my time at Brunel I was admissions tutor and level one coordinator for several years. I moved to Birkbeck as Sundstrom Reader in Mathematics in 2016.

Research
Research
Research overview
My research is in combinatorics, particularly graph polynomials, which is a very broad area of mathematics with many beautiful problems still to be solved. I have also been interested in computational complexity and the frequency assignment problem. More recently I have worked on deltamatroids.

Supervision and teaching
Supervision and teaching
Teaching
Teaching modules
 Advanced Mathematical Methods (BUEM004S6)
 Numbers, Proofs and Counting (BUEM096S4)

Publications
Publications
Article
 Edwards, K. and Noble, Steven (2019) The complexity of solutionfree sets of integers for general linear equations. Discrete Applied Mathematics 270, pp. 115133. ISSN 0166218X.
 Bonin, J. and Chun, C. and Noble, Steven (2019) The excluded 3minors for vfsafe deltamatroids. Advances in Applied Mathematics ISSN 01968858. (In Press)
 Bonin, J. and Chun, C. and Noble, Steven (2019) Deltamatroids as subsystems of sequences of Higgs lifts. Advances in Applied Mathematics ISSN 01968858. (In Press)
 Chun, C. and Moffatt, I. and Noble, Steven and Rueckriemen, R. (2019) Matroids, deltamatroids and embedded graphs. Journal of Combinatorial Theory, Series A 167, pp. 759. ISSN 00973165.
 Chun, C. and Chun, D. and Moss, T. and Noble, Steven (2018) The eExchange Basis Graph and Matroid connectedness. Discrete Mathematics 342 (3), pp. 723725. ISSN 0012365X.
 Chun, C. and Moffatt, I. and Noble, Steven and Rueckriemen, R. (2018) On the interplay between embedded graphs and deltamatroids. Proceedings of the London Mathematical Society 118 (3), pp. 675700. ISSN 00246115.
 Chun, C. and Hall, R. and Merino, C. and Moffatt, I. and Noble, Steven (2018) The structure of deltamatroids with width one twists. Electronic Journal of Combinatorics 25 (1), ISSN 10778926.
 Funk, Daryl and Mayhew, Dillon and Noble, Steven (2017) How many deltamatroids are there?. European Journal of Combinatorics 69, pp. 149158. ISSN 01956698.
 Chun, C. and Chun, D. and Noble, Steven (2017) Inductive tools for connected deltamatroids and multimatroids. European Journal of Combinatorics 63, pp. 5969. ISSN 01956698.
 Goodall, A. and Hermann, M. and Kotek, T. and Makowsky, J.A. and Noble, Steven (2017) On the complexity of generalized chromatic polynomials. Advances in Applied Mathematics 94, pp. 71102. ISSN 01968858.
 Chun, C. and Hall, R. and Merino, C. and Noble, Steven (2017) On zeros of the characteristic polynomial of matroids of bounded treewidth. European Journal of Combinatorics 60, pp. 1020. ISSN 01956698.
 Noble, Steven and Royle, G.F. (2014) The Merino–Welsh conjecture holds for series–parallel graphs. European Journal of Combinatorics 38, pp. 2435. ISSN 01956698.
 Noble, Steven (2006) Evaluating the rank generating function of a graphic 2polymatroid. Combinatorics, Probability and Computing 15 (3), pp. 449461. ISSN 09635483.
 Koller, A.E. and Noble, Steven (2004) Domination analysis of greedy heuristics for the frequency assignment problem. Discrete Mathematics 275 (13), pp. 331338. ISSN 0012365X.
 Krasikov, I. and Noble, Steven (2004) Finding nexttoshortest paths in a graph. Information Processing Letters 92 (3), pp. 117119. ISSN 00200190.
 Leese, R.A. and Noble, Steven (2004) Cyclic labelling with constraints at two distances. The Electronic Journal of Combinatorics 11 (1), ISSN 10778926.
 Calkin, N. and Merino, C. and Noble, Steven and Noy, M. (2003) Improved bounds for the number of forests and acyclic orientations in the square lattice. The Electronic Journal of Combinatorics 10, ISSN 10778926.
 Noble, Steven and Welsh, D.J.A. (2000) Knot graphs. Journal of Graph Theory 34 (1), pp. 100111. ISSN 03649024.
 Noble, Steven and Welsh, D.J.A. (1999) A weighted graph polynomial from chromatic invariants of knots. Annales de l'Institut Fourier 49 (3), pp. 10571087. ISSN 03730956.
 Noble, Steven (1998) Evaluating the Tutte polynomial for graphs of bounded treewidth. Combinatorics, Probability and Computing 7 (3), pp. 307321. ISSN 09635483.
 Noble, Steven (1996) Recognising a partitionable simplicial complex is in NP. Discrete Mathematics 152 (13), pp. 303305. ISSN 0012365X.
Book Section
 Noble, Steven (2007) Complexity of graph polynomials. In: McDiarmid, C.J.H. and Grimmett, G.R. (eds.) Combinatorics, Complexity and Chance: A Tribute to Dominic Welsh. Oxford, UK: Oxford University Press. ISBN 9780198571278.
Monograph
 Bonin, J.E. and Chun, C. and Noble, Steven (2018) Deltamatroids as subsystems of sequences of Higgs Lifts. London, UK: Birkbeck, University of London.
 Bonin, J.E. and Chun, C. and Noble, Steven (2018) The excluded 3minors for Vfsafe Deltamatroids. London, UK: Birkbeck, University of London.
 Chun, C. and Hall, R. and Merino, C. and Moffatt, I. and Noble, Steven (2017) The structure of Deltamatroids with Width One Twists. London, UK: Birkbeck, University of London.
 Goodall, A. and Hermann, M. and Kotek, T. and Makowsky, J.A. and Noble, Steven (2017) On the complexity of Generalized Chromatic Polynomials. London, UK: Birkbeck, University of London.
 Funk, D. and Mayhew, D. and Noble, Steven (2016) How many deltamatroids are there?. London, UK: Birkbeck, University of London.
 Chun, C. and Hall, R. and Merino, C. and Noble, Steven (2016) On zeros of the characteristic polynomial of matroids of bounded treewidth. London, UK: Birkbeck, University of London.
 Chun, C. and Chun, D. and Noble, Steven (2016) Inductive tools for connected ribbon graphs, deltamatroids and multimatroids. London, UK: Birkbeck, University of London.
Other
 Noble, Steven (2017) C++ code referred to in Funk, Mayhew, Noble, "How many deltamatroids are there?".