The Contributions of W.T. Tutte to Matroid Theory
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
To What Extent Did British Advancements in Cryptanalysis During World War II Influence the Development of Computer Technology?
Portland State University PDXScholar Young Historians Conference Young Historians Conference 2016 Apr 28th, 9:00 AM - 10:15 AM To What Extent Did British Advancements in Cryptanalysis During World War II Influence the Development of Computer Technology? Hayley A. LeBlanc Sunset High School Follow this and additional works at: https://pdxscholar.library.pdx.edu/younghistorians Part of the European History Commons, and the History of Science, Technology, and Medicine Commons Let us know how access to this document benefits ou.y LeBlanc, Hayley A., "To What Extent Did British Advancements in Cryptanalysis During World War II Influence the Development of Computer Technology?" (2016). Young Historians Conference. 1. https://pdxscholar.library.pdx.edu/younghistorians/2016/oralpres/1 This Event is brought to you for free and open access. It has been accepted for inclusion in Young Historians Conference by an authorized administrator of PDXScholar. Please contact us if we can make this document more accessible: [email protected]. To what extent did British advancements in cryptanalysis during World War 2 influence the development of computer technology? Hayley LeBlanc 1936 words 1 Table of Contents Section A: Plan of Investigation…………………………………………………………………..3 Section B: Summary of Evidence………………………………………………………………....4 Section C: Evaluation of Sources…………………………………………………………………6 Section D: Analysis………………………………………………………………………………..7 Section E: Conclusion……………………………………………………………………………10 Section F: List of Sources………………………………………………………………………..11 Appendix A: Explanation of the Enigma Machine……………………………………….……...13 Appendix B: Glossary of Cryptology Terms.…………………………………………………....16 2 Section A: Plan of Investigation This investigation will focus on the advancements made in the field of computing by British codebreakers working on German ciphers during World War 2 (19391945). -
Theeccentric Engineer by Justin Pollard
106 TIME OUT COLUMNIST The name of Tommy Flowers deserves to be as well known as the computing industry giants who profited from his wartime efforts. TheEccentric Engineer by Justin Pollard PEOPLE Competition purpose machine, it was the first electronic computer. THE FORGOTTEN What are these Bletchley The device set to work on Park Wrens thinking as they Tunny intercepts. It also gained ENGINEER OF work on Colossus? The best a new name, thought up by BLETCHLEY PARK caption emailed to the members of the Women’s [email protected] by Royal Naval who operated the 23 March wins a pair of one-tonne, room-sized behemoth books from Haynes. – Colossus. A 2,400-valve version entered service four days before D-Day, providing crucial decrypts of Tunny messages in the lead-up to the invasion. It’s said system offering five trillion that Eisenhower had a Tunny times more combinations decrypt, courtesy of Colossus, than the 157 trillion offered in his hand as he gave the order by Enigma. The possibility to launch Operation Overlord. of getting bombes to crunch By the end of the war there that many permutations fast were ten Colossus machines at enough for the intelligence to Bletchley. After the surrender of have any value seemed remote. Germany, eight of them were The man charged with solving destroyed and the other two this conundrum was Max secretly moved to the peacetime Newman, whose ‘Hut F’ team was government intelligence centre, assigned the task of cracking the GCHQ, where one remained in ‘Tunny’ intercepts known to operation until 1960. -
Tutte Polynomials for Trees
Tutte Polynomials for Trees Sharad Chaudhary DEPARTMENT OF MATHEMATICS DUKE UNIVERSITY DURHAM, NORTH CAROLINA Gary Gordon DEPARTMENT OF MATHEMATICS LAFAYETTE COLLEGE EASTON, PENNSYLVANIA ABSTRACT We define two two-variable polynomials for rooted trees and one two- variable polynomial for unrooted trees, all of which are based on the corank- nullity formulation of the Tutte polynomial of a graph or matroid. For the rooted polynomials, we show that the polynomial completely determines the rooted tree, i.e., rooted trees TI and T, are isomorphic if and only if f(T,) = f(T2).The corresponding question is open in the unrooted case, al- though we can reconstruct the degree sequence, number of subtrees of size k for all k, and the number of paths of length k for all k from the (unrooted) polynomial. The key difference between these three poly- nomials and the standard Tutte polynomial is the rank function used; we use pruning and branching ranks to define the polynomials. We also give a subtree expansion of the polynomials and a deletion-contraction recursion they satisfy. 1. INTRODUCTION In this paper, we are concerned with defining and investigating two-variable polynomials for trees and rooted trees that are motivated by the Tutte poly- nomial. The Tutte polynomial, a two-variable polynomial defined for a graph or a matroid, has been studied extensively over the past few decades. The fundamental ideas are traceable to Veblen [9], Birkhoff [l], Whitney [lo], and Tutte [8], who were concerned with colorings and flows in graphs. The chromatic polynomial of a graph is a special case of the Tutte polynomial. -
How I Learned to Stop Worrying and Love the Bombe: Machine Research and Development and Bletchley Park
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by CURVE/open How I learned to stop worrying and love the Bombe: Machine Research and Development and Bletchley Park Smith, C Author post-print (accepted) deposited by Coventry University’s Repository Original citation & hyperlink: Smith, C 2014, 'How I learned to stop worrying and love the Bombe: Machine Research and Development and Bletchley Park' History of Science, vol 52, no. 2, pp. 200-222 https://dx.doi.org/10.1177/0073275314529861 DOI 10.1177/0073275314529861 ISSN 0073-2753 ESSN 1753-8564 Publisher: Sage Publications Copyright © and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders. This document is the author’s post-print version, incorporating any revisions agreed during the peer-review process. Some differences between the published version and this version may remain and you are advised to consult the published version if you wish to cite from it. Mechanising the Information War – Machine Research and Development and Bletchley Park Christopher Smith Abstract The Bombe machine was a key device in the cryptanalysis of the ciphers created by the machine system widely employed by the Axis powers during the Second World War – Enigma. -
Computing Tutte Polynomials
Computing Tutte Polynomials Gary Haggard1, David J. Pearce2, and Gordon Royle3 1 Bucknell University [email protected] 2 Computer Science Group, Victoria University of Wellington, [email protected] 3 School of Mathematics and Statistics, University of Western Australia [email protected] Abstract. The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph in- variant of considerable importance in both combinatorics and statistical physics. It contains several other polynomial invariants, such as the chro- matic polynomial and flow polynomial as partial evaluations, and various numerical invariants such as the number of spanning trees as complete evaluations. However despite its ubiquity, there are no widely-available effective computational tools able to compute the Tutte polynomial of a general graph of reasonable size. In this paper we describe the implemen- tation of a program that exploits isomorphisms in the computation tree to extend the range of graphs for which it is feasible to compute their Tutte polynomials. We also consider edge-selection heuristics which give good performance in practice. We empirically demonstrate the utility of our program on random graphs. More evidence of its usefulness arises from our success in finding counterexamples to a conjecture of Welsh on the location of the real flow roots of a graph. 1 Introduction The Tutte polynomial of a graph is a 2-variable polynomial of significant im- portance in mathematics, statistical physics and biology [25]. In a strong sense it “contains” every graphical invariant that can be computed by deletion and contraction. -
The Tutte Polynomial of Some Matroids Arxiv:1203.0090V1 [Math
The Tutte polynomial of some matroids Criel Merino∗, Marcelino Ram´ırez-Iba~nezy Guadalupe Rodr´ıguez-S´anchezz March 2, 2012 Abstract The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal property that essentially any mul- tiplicative graph or network invariant with a deletion and contraction reduction must be an evaluation of it. The deletion and contraction operations are natural reductions for many network models arising from a wide range of problems at the heart of computer science, engi- neering, optimization, physics, and biology. Even though the invariant is #P-hard to compute in general, there are many occasions when we face the task of computing the Tutte polynomial for some families of graphs or matroids. In this work we compile known formulas for the Tutte polynomial of some families of graphs and matroids. Also, we give brief explanations of the techniques that were use to find the for- mulas. Hopefully, this will be useful for researchers in Combinatorics arXiv:1203.0090v1 [math.CO] 1 Mar 2012 and elsewhere. ∗Instituto de Matem´aticas,Universidad Nacional Aut´onomade M´exico,Area de la Investigaci´onCient´ıfica, Circuito Exterior, C.U. Coyoac´an04510, M´exico,D.F.M´exico. e-mail:[email protected]. Supported by Conacyt of M´exicoProyect 83977 yEscuela de Ciencias, Universidad Aut´onoma Benito Ju´arez de Oaxaca, Oaxaca, M´exico.e-mail:[email protected] zDepartamento de Ciencias B´asicas Universidad Aut´onoma Metropolitana, Az- capozalco, Av. San Pablo No. 180, Col. Reynosa Tamaulipas, Azcapozalco 02200, M´exico D.F. -
Covering Vectors by Spaces: Regular Matroids∗
Covering vectors by spaces: Regular matroids∗ Fedor V. Fomin1, Petr A. Golovach1, Daniel Lokshtanov1, and Saket Saurabh1,2 1 Department of Informatics, University of Bergen, Norway, {fedor.fomin,petr.golovach,daniello}@ii.uib.no 2 Institute of Mathematical Sciences, Chennai, India, [email protected] Abstract We consider the problem of covering a set of vectors of a given finite dimensional linear space (vector space) by a subspace generated by a set of vectors of minimum size. Specifically, we study the Space Cover problem, where we are given a matrix M and a subset of its columns T ; the task is to find a minimum set F of columns of M disjoint with T such that that the linear span of F contains all vectors of T . This is a fundamental problem arising in different domains, such as coding theory, machine learning, and graph algorithms. We give a parameterized algorithm with running time 2O(k) · ||M||O(1) solving this problem in the case when M is a totally unimodular matrix over rationals, where k is the size of F . In other words, we show that the problem is fixed-parameter tractable parameterized by the rank of the covering subspace. The algorithm is “asymptotically optimal” for the following reasons. Choice of matrices: Vector matroids corresponding to totally unimodular matrices over ration- als are exactly the regular matroids. It is known that for matrices corresponding to a more general class of matroids, namely, binary matroids, the problem becomes W[1]-hard being parameterized by k. Choice of the parameter: The problem is NP-hard even if |T | = 3 on matrix-representations of a subclass of regular matroids, namely cographic matroids. -
OBITUARY 307 Obituary Sir Erik Christopher Zeeman FRS 1925–2016
OBITUARY 307 Obituary Sir Erik Christopher Zeeman FRS 1925–2016 Christopher Zeeman was born in Japan on 4 February 1925 to a Danish father, Christian, and British mother, Christine. When he was one year old, his parents moved to England. He was a pupil at the independent school Christ's Hospital, in Horsham, West Sussex. Between 1943 and 1947 he was a flying officer in the Royal Air Force. In a career change that was to have major impact on British mathematics, he studied the subject at Christ's College, Cambridge University, graduating with an MA degree. He then carried out research for a PhD at Cambridge, supervised by the topologist Shaun Wylie. His topic was an area of algebraic topology, which associates abstract algebraic structures (‘invariants’) to topological spaces in such a way that continuous maps between spaces induce structure-preserving maps between the corresponding algebraic structures. In this manner, questions about topology can be reduced to more tractable questions in algebra. His thesis combined two such invariants, homology and cohomology, which go back to the seminal work of Henri Poincaré at the start of the 20th century.* The result was named dihomology. He introduced an important technical tool to extract useful information from this set-up, now known as the Zeeman spectral sequence. His work led Robert MacPherson and Mark Goresky to invent the basic notion of intersection homology; these ideas in turn led to proofs of some major conjectures, including the Kazhdan–Lusztig conjectures in group representation theory and the Riemann–Hilbert correspondence for complex differential equations. -
Filozofski Fakultet Sveučilišta U Zagrebu Odsjek Za Informacijske I Komunikacijske Znanosti 2017/2018
Filozofski fakultet Sveučilišta u Zagrebu Odsjek za informacijske i komunikacijske znanosti 2017/2018. Maja Mikac Kako je Colossusom razbijena Lorenzova šifra Završni rad Mentorica: dr. sc. Vjera Lopina Zagreb, 2018. Sadržaj Uvod ........................................................................................................................................... 4 1. Kratki presjek razvoja kriptografskih sustava ............................................................. 5 1.1. Kriptologija u Drugom svjetskom ratu ....................................................................... 8 2. Lorenz ................................................................................................................................ 9 2.1. Vernamova šifra ....................................................................................................... 11 2.2. Kriptoanaliza Lorenza .............................................................................................. 15 2.3. Logika stroja ............................................................................................................. 16 2.4. Turingery .................................................................................................................. 19 2.5. Testery ...................................................................................................................... 20 2.6. Newmanry ................................................................................................................ 21 3. Bletchley Park ................................................................................................................ -
Matroids Graphs Give Isomorphic Matroid Structure?
EECS 495: Combinatorial Optimization Lecture 7 Matroid Representation, Matroid Optimization Reading: Schrijver, Chapters 39 and 40 graph and S = E. A set F ⊆ E is indepen- dent if it is acyclic. Food for thought: can two non-isomorphic Matroids graphs give isomorphic matroid structure? Recap Representation Def: A matroid M = (S; I) is a finite ground Def: For a field F , a matroid M is repre- set S together with a collection of indepen- sentable over F if it is isomorphic to a linear dent sets I ⊆ 2S satisfying: matroid with matrix A and linear indepen- dence taken over F . • downward closed: if I 2 I and J ⊆ I, 2 then J 2 I, and Example: Is uniform matroid U4 binary? Need: matrix A with entries in f0; 1g s.t. no • exchange property: if I;J 2 I and jJj > column is the zero vector, no two rows sum jIj, then there exists an element z 2 J nI to zero over GF(2), any three rows sum to s.t. I [ fzg 2 I. GF(2). Def: A basis is a maximal independent set. • if so, can assume A is 2×4 with columns The cardinality of a basis is the rank of the 1/2 being (0; 1) and (1; 0) and remaining matroid. two vectors with entries in 0; 1 neither all k Def: Uniform matroids Un are given by jSj = zero. n, I = fI ⊆ S : jIj ≤ kg. • only three such non-zero vectors, so can't Def: Linear matroids: Let F be a field, A 2 have all pairs indep. -
Responding to the Impact of Artificial Intelligence on Business
THE 4TH INDUSTRIAL REVOLUTION Responding to the Impact of Artificial Intelligence on Business MARK SKILTON & FELIX HOVSEPIAN The 4th Industrial Revolution “Unprecedented and simultaneous advances in artifcial intelligence (AI), robotics, the internet of things, autonomous vehicles, 3D printing, nanotechnology, bio- technology, materials science, energy storage, quantum computing and others are redefning industries, blurring traditional boundaries, and creating new opportuni- ties. We have dubbed this the Fourth Industrial Revolution, and it is fundamentally changing the way we live, work and relate to one another.” —Professor Klaus Schwab, 2016 Mark Skilton · Felix Hovsepian The 4th Industrial Revolution Responding to the Impact of Artifcial Intelligence on Business Mark Skilton Felix Hovsepian Warwick Business School Meriden, UK Knowle, Solihull, UK ISBN 978-3-319-62478-5 ISBN 978-3-319-62479-2 (eBook) https://doi.org/10.1007/978-3-319-62479-2 Library of Congress Control Number: 2017948314 © Te Editor(s) (if applicable) and Te Author(s) 2018 Tis work is subject to copyright. All rights are solely and exclusively licensed by the Publisher, whether the whole or part of the material is concerned, specifcally the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microflms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Te use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specifc statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. -
[ATY/TCAC] Update - January 7, 2014
[ATY/TCAC] Update - January 7, 2014 At last - the promised New Year 2014 update. We've attempted to organise the items into themes. It is hard to avoid starting with the Royal Pardon ... but before that: A TURING YEAR 2014 CARD FROM HONG KONG ATY 1) We asked Loke Lay in Hong Kong if her creative friends might design a card for the start of Turing Year 2014 - 60 years since Alan Turing's passing in 1954. After much work and one or two revisions, this was the outcome - beautiful, we think - small version at: http://www.turingcentenary.eu/ or full-size image at: http://www.mathcomp.leeds.ac.uk/turing2012/Images/Card_vChun.jpg Notice the diamond (60th anniversary) design theme. We asked Loke Lay for a list of friends who helped with the card - her list: --------------------------------------------------------------- (1) Winnie Fu's (official) designer, "Ah-B" Bede Leung. (2) Winnie Fu's "Hong Kong Film Archive" assistants, Gladys and Kay. (3) Ernest Chan Chi-Wa, Chair of "Hong Kong Film Critics Society". (4) "The Wonder Lad" Law Chi-Chun, Senior Executive Officer of "Hong Kong Computer Society". ---------------------------------------------------------------------------- She added: This time "Ah-Chun" has saved The Card in the early morning of New Year's Day, like Arnold Schwarzenegger saving Edward Furlong in "Terminator 2"!! Originally, a more complex, cryptic and sombre version of the card was produced, and simplified (by request) to the final version - we may share the original later in the year. Loke Lay also sent photos of media coverage of the pardon: http://www.mathcomp.leeds.ac.uk/turing2012/Images/sing-tao1.jpg ALAN TURING's ROYAL PARDON This has given rise to the most extensive national and international media coverage of Alan Turing and his legacy ever.