Publications

Thresholds for patterns in random permutations with a given number of inversions

Bevan David, Threlfall Daniel

The Electronic Journal of Combinatorics Vol 31 (2024)

https://doi.org/10.37236/12601

Threshold functions and the birthday paradox

Bevan David

Mathematical Gazette Vol 106, pp. 344-348 (2022)

https://doi.org/10.1017/mag.2022.84

Independence of permutation limits at infinitely many scales

Bevan David

Journal of Combinatorial Theory. Series A Vol 186 (2022)

https://doi.org/10.1016/j.jcta.2021.105557

Games of no chance 5 edited by Urban Larsson, pp 490, £110.00 (hard), ISBN 978-1-108-48580-7, Cambridge University Press (2019)

Bevan David

Mathematical Gazette Vol 105, pp. 569-570 (2021)

https://doi.org/10.1017/mag.2021.145

A structural characterisation of Av(1324) and new bounds on its growth rate

Bevan David, Brignall Robert, Elvey Price Andrew, Pantone Jay

European Journal of Combinatorics Vol 88 (2020)

https://doi.org/10.1016/j.ejc.2020.103115

Bijections between directed animals, multisets and Grand-Dyck paths

Baril Jean-Luc, Bevan David, Kirgizov Sergey

The Electronic Journal of Combinatorics Vol 27 (2020)

https://doi.org/10.37236/8826

More publications

Teaching

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.

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.

Professional Activities

Combinatorial Theory (Journal)

Peer reviewer

6/2023

Discrete Mathematics and Theoretical Computer Science (Journal)

Guest editor

2023

Pattern Avoidance, Statistical Mechanics and Computational Complexity

Organiser

2022

Scottish Combinatorics Meeting 2023

Organiser

2022

Permutation Patterns 2021 Virtual Workshop

Organiser

3/2021

Enumerative Combinatorics and Applications (Journal)

Guest editor

2021

More professional activities

Projects

Maths DTP 2020 University of Strathclyde | Threlfall, Daniel

Bevan, David (Principal Investigator) Steingrimsson, Einar (Co-investigator) Threlfall, Daniel (Research Co-investigator)

01-Oct-2020 - 01-Oct-2024

More projects