Projects per year
Personal profile
Personal Statement
Please see https://dibevan.wordpress.com/.
For more information about research in combinatorics at the University of Strathclyde,
see the Strathclyde Combinatorics Group webpage.
Research Interests
Please see https://dibevan.wordpress.com/.
For more information about research in combinatorics at the University of Strathclyde,
see the Strathclyde Combinatorics Group webpage.
Teaching Interests
Past teaching responsibilities include the following:
MM109 Applying Mathematics 2: Graph Theory
Types of graphs; graph operations, walks on graphs; connectivity; Eulerian graphs; Hamiltonian graphs; algorithms for weighted graphs; trees and forests; spanning trees; planarity; colouring; matchings; digraphs; network flows.
MM917 Networks in Finance
Random networks; the small-world phenomenon; scale-free networks; the Barabási–Albert model; centrality; degree correlation; robustness; spreading; communities.
CS103 Machines, Languages and Computation (Semester 2)
Propositional logic and proofs using natural deduction; normal forms and satisfiability; computational complexity, P and NP; finite state automata and regular expressions, the Brzozowski algebraic method and the pumping lemma; Turing machines, undecidability, the halting problem and the Entscheidungsproblem.
CS104 Information and Information Systems (Module 1: Information Theory)
Data and information (syntax and semantics, text encodings, Unicode and UTF-8); error detection and correction (repetition codes, parity bits and Hamming codes); data compression (run-length encoding and LZW); measuring information (entropy) and Shannon's Source Coding Theorem.
CS106 Computer Systems and Organisation (Semester 2)
CS107 Fundamentals of Computer Systems
Computer organization; MIPS assembly programming and the MIPS Instruction Set Architecture (registers, memory addressing, logical and shifting operations, jumps and branches, loops and arrays, integers and integer arithmetic, subroutines and the call stack, recursion); memory caching; virtual memory.
Education/Academic qualification
Doctor of Philosophy, On the growth of permutation classes, Open University
2012 → 2015
Award Date: 18 Jun 2015
Bachelor of Arts, London Bible College
1986 → 1989
Master of Science, University of Oxford
1983 → 1984
Master of Arts, University of Oxford
1980 → 1983
External positions
Visiting Research Fellow, Open University
Aug 2015 → Oct 2016
Fingerprint
- 1 Similar Profiles
Projects
- 1 Finished
-
Maths DTP 2020 University of Strathclyde | Threlfall, Daniel
Bevan, D. (Principal Investigator), Steingrimsson, E. (Co-investigator) & Threlfall, D. (Research Co-investigator)
EPSRC (Engineering and Physical Sciences Research Council)
1/10/20 → 1/10/24
Project: Research Studentship - Internally Allocated
Research output
-
On naturally labelled posets and permutations avoiding 12–34
Bevan, D., Cheon, G.-S. & Kitaev, S., 31 May 2025, In: European Journal of Combinatorics. 126, 18 p., 104117.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Thresholds for patterns in random permutations with a given number of inversions
Bevan, D. & Threlfall, D., 4 Oct 2024, In: The Electronic Journal of Combinatorics. 31, 4, 27 p., P4.6.Research output: Contribution to journal › Article › peer-review
Open AccessFile2 Downloads (Pure)
Datasets
-
Calculating intervals of permutation class growth rates
Bevan, D. (Creator), University of Strathclyde, 28 Sept 2016
DOI: 10.15129/8eb39e9c-53e2-4fa6-b611-db0ed53653b7, http://arxiv.org/src/1410.3679/anc/intervalCalculations.nb and one more link, http://arxiv.org/src/1410.3679/anc/intervalCalculations.pdf (show fewer)
Dataset
Activities
-
Combinatorial Theory (Journal)
Bevan, D. (Peer reviewer)
Jun 2023 → …Activity: Publication peer-review and editorial work types › Journal peer review
-
Discrete Mathematics and Theoretical Computer Science (Journal)
Bevan, D. (Guest editor)
2023 → 2025Activity: Publication peer-review and editorial work types › Journal or guest editorship