John Truss

Last updated

John Truss
BornApril 1947 (age 76–77)
Alma mater King's College, Cambridge
University of Leeds
Children4; including Liz
Scientific career
Fields Pure mathematics
Institutions Paisley College of Technology
University of Leeds

John Kenneth Truss (born April 1947) is a mathematician and emeritus professor of pure mathematics at the University of Leeds where he specialises in mathematical logic, infinite permutation groups, homogeneous structures and model theory. [1] Truss began his career as a junior research fellow at the University of Oxford before holding a series of academic positions and lastly joining the University of Leeds. He has written books on discrete mathematics (1991) and mathematical analysis (1997) and was co-editor in chief of the Journal of the London Mathematical Society until June 2003. He is the father of the former Prime Minister of the United Kingdom, Liz Truss.

Contents

Early life and family

John Truss was born in April 1947. [2] [3] He graduated from King's College, Cambridge in 1968 and earned his PhD at the University of Leeds in 1973 for a dissertation titled "Some Results about Cardinal Numbers without the Axiom of Choice" which was supervised by Frank Drake. [4] In 1969, he married Priscilla Mary Grasby, a nurse, [5] who he had met while they were students at Cambridge. [5] Together, they have a daughter, Liz Truss, and three sons. [6] Liz Truss has described her parents' politics as "to the left of Labour". [7] Truss and his wife were both supporters of the Campaign for Nuclear Disarmament. [8] They divorced in 2003. [5]

Truss refused to campaign with his daughter on her selection for Conservative candidate for South West Norfolk in the 2010 UK general election. [9]

Career

Truss's first academic position was as a junior research fellow at the Mathematical Institute of the University of Oxford. [10] He then taught at a school in Kidderminster, [11] Worcestershire, before lecturing at Paisley College of Technology from 1979 to 1985. [5] In 1987, he worked at Simon Fraser University [12] in British Columbia, Canada, and later at the University of Leeds where in 1988 with Frank Drake he edited the collected papers of Logic Colloquium '86, held at the University of Hull in 1986. [13]

In 1990, Peter Cameron paid tribute to Truss in his notes on Oligomorphic Permutation Groups in the London Mathematical Society Lecture Notes Series No. 152, for saving him from "making some rash conjectures (by disproving them)", and "notably" for his contribution to the question of what are the possible cycle structures of automorphisms of M? [14] In 1991, Truss published Discrete Mathematics for Computer Scientists which John Bayliss described in The Mathematical Gazette as "masterful and thorough" and getting "rapidly to the heart of some very exciting topics" but felt that it was more of a mathematician's book than a book for computer scientists as claimed by the author. Nonethless, Bayliss felt that the approach taken by Truss in organising and presenting his material was highly successful in condensing different strands of mathematics so that the author had shown that "discrete mathematics has come of age and is no longer a collection of disparate topics." [15]

In 1999, Truss and S. Barry Cooper, also of the University of Leeds, jointly edited two volumes of papers in the London Mathematical Society Lecture Notes Series arising from the European meeting of the Association for Symbolic Logic in Leeds in July 1997 on sets and proofs [16] [17] and models and computability. [16] The volumes were welcomed by philosopher Graham Priest of the University of Queensland who noted that they concentrated on logic as practiced in mathematics departments with little content of a philosophical or computer science nature, but, possibly as a result, were more coherent than usual for collections of conference papers. [16] By then, Truss and Jonathan Partington were co-editors of the Journal of the London Mathematical Society . [18] They were succeeded on 6 June 2003 by Francis Burstall and John Toland. [19]

In 2014, Sam Tarzi's Multicoloured Random Graphs: Constructions and Symmetry, prepared with Peter Cameron, made extensive use of Truss's research, noting that Truss had proved that countable universal edge-coloured graphs have simple automorphism groups. A summary of Truss's work in this area was included as appendix A(8) of Tarzi's work. [20]

Selected publications

Books

Edited volumes

Journal articles

Related Research Articles

<span class="mw-page-title-main">Discrete mathematics</span> Study of discrete mathematical structures

Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets. However, there is no exact definition of the term "discrete mathematics".

<span class="mw-page-title-main">Permutation group</span> Group whose operation is composition of permutations

In mathematics, a permutation group is a group G whose elements are permutations of a given set M and whose group operation is the composition of permutations in G (which are thought of as bijective functions from the set M to itself). The group of all permutations of a set M is the symmetric group of M, often written as Sym(M). The term permutation group thus means a subgroup of the symmetric group. If M = {1, 2, ..., n} then Sym(M) is usually denoted by Sn, and may be called the symmetric group on n letters.

<span class="mw-page-title-main">Monster group</span> Finite simple group

In the area of abstract algebra known as group theory, the monster group M (also known as the Fischer–Griess monster, or the friendly giant) is the largest sporadic simple group, having order
   808,017,424,794,512,875,886,459,904,961,710,757,005,754,368,000,000,000
   = 246 · 320 · 59 · 76 · 112 · 133 · 17 · 19 · 23 · 29 · 31 · 41 · 47 · 59 · 71
   ≈ 8×1053.

<span class="mw-page-title-main">Mathieu group</span> Five sporadic simple groups

In group theory, a topic in abstract algebra, the Mathieu groups are the five sporadic simple groups M11, M12, M22, M23 and M24 introduced by Mathieu. They are multiply transitive permutation groups on 11, 12, 22, 23 or 24 objects. They are the first sporadic groups to be discovered.

<span class="mw-page-title-main">Cyclic order</span> Alternative mathematical ordering

In mathematics, a cyclic order is a way to arrange a set of objects in a circle. Unlike most structures in order theory, a cyclic order is not modeled as a binary relation, such as "a < b". One does not say that east is "more clockwise" than west. Instead, a cyclic order is defined as a ternary relation [a, b, c], meaning "after a, one reaches b before c". For example, [June, October, February], but not [June, February, October], cf. picture. A ternary relation is called a cyclic order if it is cyclic, asymmetric, transitive, and connected. Dropping the "connected" requirement results in a partial cyclic order.

<span class="mw-page-title-main">Geometric group theory</span> Area in mathematics devoted to the study of finitely generated groups

Geometric group theory is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such groups and topological and geometric properties of spaces on which these groups can act non-trivially.

The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic.

<span class="mw-page-title-main">S. Barry Cooper</span> English mathematician and computability theorist

S. Barry Cooper was an English mathematician and computability theorist. He was a professor of Pure Mathematics at the University of Leeds.

<span class="mw-page-title-main">Rado graph</span> Infinite graph containing all countable graphs

In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed by choosing independently at random for each pair of its vertices whether to connect the vertices by an edge. The names of this graph honor Richard Rado, Paul Erdős, and Alfréd Rényi, mathematicians who studied it in the early 1960s; it appears even earlier in the work of Wilhelm Ackermann. The Rado graph can also be constructed non-randomly, by symmetrizing the membership relation of the hereditarily finite sets, by applying the BIT predicate to the binary representations of the natural numbers, or as an infinite Paley graph that has edges connecting pairs of prime numbers congruent to 1 mod 4 that are quadratic residues modulo each other.

<span class="mw-page-title-main">Steve Vickers (computer scientist)</span>

Steve Vickers is a British mathematician and computer scientist. In the early 1980s, he wrote ROM firmware and manuals for three home computers, the ZX81, ZX Spectrum, and Jupiter Ace. The latter was produced by Jupiter Cantab, a short-lived company Vickers formed together with Richard Altwasser, after the two had left Sinclair Research. Since the late 1980s, Vickers has been an academic in the field of geometric logic, writing over 30 papers in scholarly journals on mathematical aspects of computer science. His book Topology via Logic has been influential over a range of fields. In October 2018, he retired as senior lecturer at the University of Birmingham. As announced on his university homepage, he continues to supervise PhD students at the university and focus on his research.

<span class="mw-page-title-main">Peter Cameron (mathematician)</span> Australian mathematician

Peter Jephson Cameron FRSE is an Australian mathematician who works in group theory, combinatorics, coding theory, and model theory. He is currently half-time Professor of Mathematics at the University of St Andrews, and Emeritus Professor at Queen Mary University of London.

<span class="mw-page-title-main">Cheryl Praeger</span> Australian mathematician

Cheryl Elisabeth Praeger is an Australian mathematician. Praeger received BSc (1969) and MSc degrees from the University of Queensland (1974), and a doctorate from the University of Oxford in 1973 under direction of Peter M. Neumann. She has published widely and has advised 27 PhD students. She is currently Emeritus Professor of Mathematics at the University of Western Australia. She is best known for her works in group theory, algebraic graph theory and combinatorial designs.

In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge–vertex connectivity.

Mathieu group M<sub>22</sub>

In the area of modern algebra known as group theory, the Mathieu groupM22 is a sporadic simple group of order

<span class="mw-page-title-main">Karen Vogtmann</span> American mathematician

Karen Vogtmann (born July 13, 1949 in Pittsburg, California) is an American mathematician working primarily in the area of geometric group theory. She is known for having introduced, in a 1986 paper with Marc Culler, an object now known as the Culler–Vogtmann Outer space. The Outer space is a free group analog of the Teichmüller space of a Riemann surface and is particularly useful in the study of the group of outer automorphisms of the free group on n generators, Out(Fn). Vogtmann is a professor of mathematics at Cornell University and the University of Warwick.

<span class="mw-page-title-main">Ieke Moerdijk</span> Dutch mathematician

Izak (Ieke) Moerdijk is a Dutch mathematician, currently working at Utrecht University, who in 2012 won the Spinoza prize.

In mathematical logic, an omega-categorical theory is a theory that has exactly one countably infinite model up to isomorphism. Omega-categoricity is the special case κ =  = ω of κ-categoricity, and omega-categorical theories are also referred to as ω-categorical. The notion is most important for countable first-order theories.

Norman Linstead Biggs is a leading British mathematician focusing on discrete mathematics and in particular algebraic combinatorics.

Anna Lubiw is a computer scientist known for her work in computational geometry and graph theory. She is currently a professor at the University of Waterloo.

<span class="mw-page-title-main">Conway's 99-graph problem</span> On existence of a strongly regular graph

In graph theory, Conway's 99-graph problem is an unsolved problem asking whether there exists an undirected graph with 99 vertices, in which each two adjacent vertices have exactly one common neighbor, and in which each two non-adjacent vertices have exactly two common neighbors. Equivalently, every edge should be part of a unique triangle and every non-adjacent pair should be one of the two diagonals of a unique 4-cycle. John Horton Conway offered a $1000 prize for its solution.

References

  1. ↑ "Professor J K Truss | School of Mathematics | University of Leeds". eps.leeds.ac.uk. Archived from the original on 23 February 2022. Retrieved 7 September 2022.
  2. ↑ Truss, J. K., Library of Congress. Retrieved 15 September 2022.
  3. ↑ Virtual International Authority File. Retrieved 15 September 2022.
  4. ↑ John Kenneth Truss. Mathematics Genealogy Project. Retrieved 12 September 2022.
  5. 1 2 3 4 Norfolk, Andrew; Wace, Charlotte; Grylls, George. "Liz Truss: from teenage Lib Dem to darling of the Tory right" . The Times . ISSN   0140-0460 . Retrieved 7 September 2022.
  6. ↑ Josh Glancy; Hugo Daniel (3 September 2022). "Just where is Liz Truss from? Her incredible journey spans three countries and two continents". The Times . Archived from the original on 4 September 2022. Retrieved 6 September 2022.
  7. ↑ Quinn, Ben (5 September 2022). "How Liz Truss became leader of the Conservative party – a timeline". The Guardian .
  8. ↑ Hawke, Jack (5 September 2022). "How Liz Truss, Britain's next prime minister, went from anti-monarchist rebel to the next Margaret Thatcher". ABC News . Retrieved 14 March 2023.
  9. ↑ Cole, Harry; Heale, James (2022). Out of the Blue: The Inside Story of the Unexpected Rise and Rapid Fall of Liz Truss . HarperCollins. ISBN   978-0-00-860578-0.
  10. ↑ "Models of set theory containing many perfect sets", Ann. Math. Logic 7, 197–219 (1974).
  11. ↑ Where in Oxford is Liz Truss from? Miranda Norris, Oxford Mail, 6 September 2022. Retrieved 12 September 2022.
  12. ↑ Chan, Cheryl (6 September 2022). "New U.K. prime minister Liz Truss attended school in Burnaby". Vancouver Sun . Retrieved 6 September 2022.
  13. ↑ Skowron, Andrzej (1989). "Review of Logic Colloquium '86". Studia Logica. 48 (3): 396–400. ISSN   0039-3215. JSTOR   20015451.
  14. ↑ Cameron, Peter J. (1990). Oligomorphic Permutation Groups . London Mathematical Society Lecture Notes Series No. 152. Cambridge: Cambridge University Press. pp. v, 3, 86, 104. ISBN 0-521-38836-8
  15. 1 2 Baylis, John (1992). "Review of Discrete Mathematics for Computer Scientists". The Mathematical Gazette . 76 (476): 303–305. doi:10.2307/3619163. ISSN   0025-5572. JSTOR   3619163.
  16. 1 2 3 Priest, Graham (2001). "Review of Sets and Proofs; Models and Computability, S. Barry Cooper, John K. Truss". Studia Logica . 69 (3): 446–448. ISSN   0039-3215. JSTOR   20016368.
  17. ↑ Cantini, Andrea (2002). "Review of First Steps into Metapredicativity in Explicit Mathematics". The Bulletin of Symbolic Logic . 8 (4): 535–536. doi:10.2307/797965. ISSN   1079-8986. JSTOR   797965.
  18. ↑ "Journal of the London Mathematical Society". Archived from the original on 13 September 1999.
  19. ↑ "Journal of the London Mathematical Society". www1.maths.leeds.ac.uk. Retrieved 6 September 2022.
  20. ↑ Tarzi, Sam. (2014) Multicoloured Random Graphs: Constructions and Symmetry . London: Sam Tarzi. p. xx. ISBN 9781505879957
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.