DOCSLIB.ORG

The Tutte Group of a Weakly Orientable Matroid Marc

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Tutte Group of a Weakly Orientable Matroid Marc View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector The Tutte Group of a Weakly Orientable Matroid Marc Wagowski Universit6 Pierre et Marie Curie -Paris 6 U.E.R. 48 - Mathbmatiques 4 place Jzmieu, 75005 Paris, France Submittedby Richard A. Brualdi ABSTRACT We show that a matroid M is weakly orientable if and only if the element cM (an abstraction of - 1) of its Tutte group is not a square. 1. INTRODUCTION A circuit signature of a matroid is an assignment of a sign + or - to all elements of each circuit. Four classes of signatures have been studied so far; they are, in their order of appearance, digraphoids [7], orientations [2], weak orientations [l, 61, and ternary signatures [8]. Digraphoids are an abstraction of directed graphs defined by Minty, which are exactly signatures arising from representations of regular matroids by unimodular subspaces over Iw. Orientations, a generalization of vector spaces over an ordered field, have received considerable attention during the past ten years and have been given many applications to convex polytopes, arrangements of hyperplanes, and linear programming. Weak orientations are obtained by a weakening, in a natural way, of the definition of orientations, and this class contains the three others. Ternary signatures are signatures arising from representations of ternary matroids over GF(3). Recently Dress has introduced the concept of matroids with coefficients [3], a generalization of the Tutte representation, providing a common frame- work for ordinary matroids, matroid representation over a field, and oriented matroids. In [lo] it has been shown that signatures, coordinatizable over a semiring, in the sense of Dress, are exactly the four aforementioned classes. Associated with a matroid M is an Abelian group TM, christened the “Tutte group” because it allows one to reinterpret Tutte’s homotopy theory LINEAR ALGEBRA AND ITS APPLICATIONS 117: 21-24 (1989) 21 0 Elsevier Science Publishing Co., Inc., 1989 655 Avenue of the Americas, New York, NY 10010 0024-3795/89/$3.50 22 MARC WAGOWSKI in algebraic terms. Furthermore the universal representation ring of a matroid M can be obtained as a factor ring of the group algebra Z[U,] [5]. A study of this group can be found in [5], [12], and [13]. In Corollary 3.3 we derive from our characterization of weakly oriented matroids a reformulation, due to A. Dress, of a deep result by Tutte [9, 7.51 in terms of the Tutte group. A characterization of ternary matroids whose statement is very similar to Theorem 3.2 is given in [5] and [13]. 2. NOTATION AND DEFINITIONS Let M be a matroid, and %? (V*) be its set of circuits (cocircuits). The Tutte group of M, T,, is the factor group of the free Abelian group, IL,,,, generated by the symbols .sM and Xc;.,, for all C E %’ G g* and all e, f E C (e # f ),modulo the relations EL = 1, X,; e, f. Xc. f e = 1, Xc.e eOX,; e2 e3. for all CE%? and’all C*E%?*‘wi% Cn’C* XC;e3,e,=1’XC,e,f*X&,f=EM = {e,f}. A signed set is a set X together with a partition into two subsets Xt and X- [the pair (X’, X- ) is also called a signature of the underlying set]. We define the opposite - X of the signed set X to be the signed set of signature (X-, X+ ). A circuit signature of M is a set Y of signed sets such that each element of Sp is a signature of a circuit, and for every circuit C there exists exactly two signed sets in Y with underlying set C, and these two signed sets are opposite. For X a signed set and e one of its elements, X(e) denotes thesignof e on X,i.e. + if eEX+ and - if eEX_. A circuit signature 9 of a matroid M and a cocircuit signature z?‘* of M form a dual pair of weakly oriented mutroids if for any X E 9 and for any Y E y* with IX n Y] = 2 we have [l] (X+nY+)U(X- fly-)+0 ifandonlyif (X+nY-)u(X- nY+)#0, equivalently, ](X’ n Yt ) U (X- n Y- )I = 1 [and therefore also ili+nY-)u(x- nY+)I=l]. 3. PROPERTIES OF THE TUTTE GROUP OF A WEAKLY ORIENTABLE MATROID The following theorem is the particular case of [4, Theorem 101 dealing with weak orientations. But in [4] the results are stated without proof, therefore we give for completeness a proof of Theorem 3.1. WEAKLY ORIENTABLE MATROIDS 23 THEOREM 3.1 (Dress [4, 6.11). A mutroid M is weakly orientable if and only if there exists a morphism Cpj%m 8, into the group { + , - } such that ia = - . Proof. Assume M to be weakly orientable. By definition there exists a dual pair of weak orientations (9’,9’*) of M. Let \k denote the morphism from ILM into the group { + , - } defined by \Ir(l) = + , \k(~~) = - , and for all C~gbIj* and all e,f EC with ef f, \k(X,G.,f)=Y(e).Y(f), where Y denotes one of the two opposite signed sets associated with C. For simplicity, in the remainder of this proof we will denote a signed circuit and its associated circuit by the same letter. We have ‘k( EL) = + , ‘k( X,; e, f. X C;fie) = [C(e)*C(f )I2= +, \k(Xc;.,,e2.XC;ep.e3.XC;e3.e,)= [CGOC(e2)~ C(e,)12=+, and for all CE~’ and all CLEF* with CnC*= {e, f}, since by definition of a weak orientation C(e) * C(f) +C*(e) * C*(f) = - , we have \~(E~.X~;~,~ . Xc*, e,f) = + . From these equalities we deduce that \k induces a morphism Q from the factor group UM into the group { + , - }, satisfying <a(.sy) = - . Conversely, assume the existence of a morphism Q from T, into the group { +, - } satisfying @(sM) = - . Take C E % 6 V*, choose e E C, and denote by Y the signature of C defined by Y(e) = + , and for f E C\e by Y(f) = + when @(Xc;.,,) = + and Y(f) = - otherwise. In such a manner we define a circuit signature 9’ and a cocircuit signature 9* of M. We leave it to the reader to check that the relations inducing the factor group U,, together with the hypothesis a’(~~~) = - , imply that (9’,9 *) is a dual pair of weak orientations. n As mentioned in [l], matroids coordinatizable over a finite field in which - 1 is not a square are weakly orientable. Theorem 3.2 generalizes this result to the Tutte group. THEOREM 3.2. A matroid M is weakly orientable if and only if Ed 4 (W2. Proof. If M is weakly orientable and if @ is a morphism from U, into { +, - } with @(.sM) = -, then sM @ (UM)2, since Ed = a2 for some (YE UM would imply @( eM) = @(02) = Cp(o)2 = + . Vice versa, if eM @ (UM)2,then we may view U,/(UM)2 as a vector space over GF(2) to find a morphism into { +, - } [ G GF(2)] which maps the nontrivial vector eM .(UM)2into - . n COROLLARY 3.3 (Tutte; see also [5] or [13]). A binary matroid M is regular if and only if Ed 4 (UM)2. 24 MARC WAGOWSKI Proof. Since regular matroids are exactly binary weakly orientable ma- troids (see [ll, II 2.3.5]), the conclusion follows from Theorem 3.2. n I am grateful to the referee fora simplification in the proof of Theorem 3.2 and forseveral helpful suggestions. REFERENCES R. Bland and D. L. Jensen, Weakly Oriented Matroids, Cornell University School of OR/IE Technical Report No. 732, Apr. 1987. R. Bland and M. Las Vergnas, Orientabihty of matroids, J. Cornbin. Theory Ser. B 24:94-123 (1978). A. Dress, Duality theory for finite and infinite matroids with coefficients, Ado. in Math. 59 (2):97-123 (1986). A. Dress, unpublished notes. A. Dress and W. Wenzel, Geometric algebra for combinatorial geometries, Preprint, 1988. D. L. Jensen, Coloring and Duality: Combinatorial Augmentation Methods, Thesis (under the supervision of R. Bland), Cornell Univ., 1985, 371 pp. G. Minty, On the axiomatic foundations of the theories of directed linear graphs, electrical networks, and network-programming, J. Math. Mech. 15:485-520 (1966). 8 J. P. Roundneff and M. Wagowski, Characterizations of ternary matroids in terms of circuit signatures, J. Combin. Theory Ser. B, to appear. 9 W. T. Tutte, Lectures on matroids, J. Res. Nat. Bur. Standards B69:1-47 (1965). 10 M. Wagowski, Matroid signatures coordinatizable over a semiring, European J. Combin., to appear. 11 M. Wagowski, Representations Algebriques des Matroides, These, Univ. Paris VI, 1987. 12 W. Wenzel, ijber die Stmktur der Tutte-Gruppe von Matroiden, Thesis, Univ. of Bielefeld, 1986. 13 W. Wenzel, A Grouptheoretic interpretation of Tutte’s homotopy theory, preprint, 1988. Received 6 April 1987; final manuscript accepted 25 July 1988 .
Load more

Recommended publications
  • Some Topics Concerning Graphs, Signed Graphs and Matroids
    SOME TOPICS CONCERNING GRAPHS, SIGNED GRAPHS AND MATROIDS DISSERTATION Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of the Ohio State University By Vaidyanathan Sivaraman, M.S. Graduate Program in Mathematics The Ohio State University 2012 Dissertation Committee: Prof. Neil Robertson, Advisor Prof. Akos´ Seress Prof. Matthew Kahle ABSTRACT We discuss well-quasi-ordering in graphs and signed graphs, giving two short proofs of the bounded case of S. B. Rao's conjecture. We give a characterization of graphs whose bicircular matroids are signed-graphic, thus generalizing a theorem of Matthews from the 1970s. We prove a recent conjecture of Zaslavsky on the equality of frus- tration number and frustration index in a certain class of signed graphs. We prove that there are exactly seven signed Heawood graphs, up to switching isomorphism. We present a computational approach to an interesting conjecture of D. J. A. Welsh on the number of bases of matroids. We then move on to study the frame matroids of signed graphs, giving explicit signed-graphic representations of certain families of matroids. We also discuss the cycle, bicircular and even-cycle matroid of a graph and characterize matroids arising as two different such structures. We study graphs in which any two vertices have the same number of common neighbors, giving a quick proof of Shrikhande's theorem. We provide a solution to a problem of E. W. Dijkstra. Also, we discuss the flexibility of graphs on the projective plane. We conclude by men- tioning partial progress towards characterizing signed graphs whose frame matroids are transversal, and some miscellaneous results.
    [Show full text]
  • Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity
    Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity Daniel Lokshtanov1, Pranabendu Misra2, Fahad Panolan1, Saket Saurabh1,2, and Meirav Zehavi3 1 University of Bergen, Bergen, Norway. {daniello,pranabendu.misra,fahad.panolan}@ii.uib.no 2 The Institute of Mathematical Sciences, HBNI, Chennai, India. [email protected] 3 Ben-Gurion University, Beersheba, Israel. [email protected] Abstract Deterministic polynomial-time computation of a representation of a transversal matroid is a longstanding open problem. We present a deterministic computation of a so-called union rep- resentation of a transversal matroid in time quasipolynomial in the rank of the matroid. More precisely, we output a collection of linear matroids such that a set is independent in the trans- versal matroid if and only if it is independent in at least one of them. Our proof directly implies that if one is interested in preserving independent sets of size at most r, for a given r ∈ N, but does not care whether larger independent sets are preserved, then a union representation can be computed deterministically in time quasipolynomial in r. This consequence is of independent interest, and sheds light on the power of union representation. Our main result also has applications in Parameterized Complexity. First, it yields a fast computation of representative sets, and due to our relaxation in the context of r, this computation also extends to (standard) truncations. In turn, this computation enables to efficiently solve various problems, such as subcases of subgraph isomorphism, motif search and packing problems, in the presence of color lists. Such problems have been studied to model scenarios where pairs of elements to be matched may not be identical but only similar, and color lists aim to describe the set of compatible elements associated with each element.
    [Show full text]
  • Partial Fields and Matroid Representation
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by UC Research Repository Partial Fields and Matroid Representation Charles Semple and Geoff Whittle Department of Mathematics Victoria University PO Box 600 Wellington New Zealand April 10, 1995 Abstract A partial field P is an algebraic structure that behaves very much like a field except that addition is a partial binary operation, that is, for some a; b ∈ P, a + b may not be defined. We develop a theory of matroid representation over partial fields. It is shown that many im- portant classes of matroids arise as the class of matroids representable over a partial field. The matroids representable over a partial field are closed under standard matroid operations such as the taking of mi- nors, duals, direct sums and 2{sums. Homomorphisms of partial fields are defined. It is shown that if ' : P1 → P2 is a non-trivial partial field homomorphism, then every matroid representable over P1 is rep- resentable over P2. The connection with Dowling group geometries is examined. It is shown that if G is a finite abelian group, and r>2, then there exists a partial field over which the rank{r Dowling group geometry is representable if and only if G has at most one element of order 2, that is, if G is a group in which the identity has at most two square roots. 1 1 Introduction It follows from a classical (1958) result of Tutte [19] that a matroid is rep- resentable over GF (2) and some field of characteristic other than 2 if and only if it can be represented over the rationals by the columns of a totally unimodular matrix, that is, by a matrix over the rationals all of whose non- zero subdeterminants are in {1; −1}.
    [Show full text]
  • Parameterized Algorithms Using Matroids Lecture I: Matroid Basics and Its Use As Data Structure
    Parameterized Algorithms using Matroids Lecture I: Matroid Basics and its use as data structure Saket Saurabh The Institute of Mathematical Sciences, India and University of Bergen, Norway, ADFOCS 2013, MPI, August 5{9, 2013 1 Introduction and Kernelization 2 Fixed Parameter Tractable (FPT) Algorithms For decision problems with input size n, and a parameter k, (which typically is the solution size), the goal here is to design an algorithm with (1) running time f (k) nO , where f is a function of k alone. · Problems that have such an algorithm are said to be fixed parameter tractable (FPT). 3 A Few Examples Vertex Cover Input: A graph G = (V ; E) and a positive integer k. Parameter: k Question: Does there exist a subset V 0 V of size at most k such ⊆ that for every edge( u; v) E either u V 0 or v V 0? 2 2 2 Path Input: A graph G = (V ; E) and a positive integer k. Parameter: k Question: Does there exist a path P in G of length at least k? 4 Kernelization: A Method for Everyone Informally: A kernelization algorithm is a polynomial-time transformation that transforms any given parameterized instance to an equivalent instance of the same problem, with size and parameter bounded by a function of the parameter. 5 Kernel: Formally Formally: A kernelization algorithm, or in short, a kernel for a parameterized problem L Σ∗ N is an algorithm that given ⊆ × (x; k) Σ∗ N, outputs in p( x + k) time a pair( x 0; k0) Σ∗ N such that 2 × j j 2 × • (x; k) L (x 0; k0) L , 2 () 2 • x 0 ; k0 f (k), j j ≤ where f is an arbitrary computable function, and p a polynomial.
    [Show full text]
  • Matroid Theory Release 9.4
    Sage 9.4 Reference Manual: Matroid Theory Release 9.4 The Sage Development Team Aug 24, 2021 CONTENTS 1 Basics 1 2 Built-in families and individual matroids 77 3 Concrete implementations 97 4 Abstract matroid classes 149 5 Advanced functionality 161 6 Internals 173 7 Indices and Tables 197 Python Module Index 199 Index 201 i ii CHAPTER ONE BASICS 1.1 Matroid construction 1.1.1 Theory Matroids are combinatorial structures that capture the abstract properties of (linear/algebraic/...) dependence. For- mally, a matroid is a pair M = (E; I) of a finite set E, the groundset, and a collection of subsets I, the independent sets, subject to the following axioms: • I contains the empty set • If X is a set in I, then each subset of X is in I • If two subsets X, Y are in I, and jXj > jY j, then there exists x 2 X − Y such that Y + fxg is in I. See the Wikipedia article on matroids for more theory and examples. Matroids can be obtained from many types of mathematical structures, and Sage supports a number of them. There are two main entry points to Sage’s matroid functionality. The object matroids. contains a number of con- structors for well-known matroids. The function Matroid() allows you to define your own matroids from a variety of sources. We briefly introduce both below; follow the links for more comprehensive documentation. Each matroid object in Sage comes with a number of built-in operations. An overview can be found in the documen- tation of the abstract matroid class.
    [Show full text]
  • Lecture 13 — February, 1 2014 1 Overview 2 Matroids
    Advanced Graph Algorithms Jan-Apr 2014 Lecture 13 | February, 1 2014 Lecturer: Saket Saurabh Scribe: Sanjukta Roy 1 Overview In this lecture we learn what is Matroid, the connection between greedy algorithms and matroids. We also look at some examples of Matroids e.g., Linear Matroids, Graphic Matroids etc. 2 Matroids 2.1 A Greedy Approach Let G = (V, E) be a connected undirected graph and let w : E ! R≥0 be a weight function on the edges. For MWST Kruskal's so-called greedy algorithm works. Consider Maximum Weight Matching problem. 1 a b 3 3 d c 4 Application of the greedy algorithm gives (d,c) and (a,b). However, (d,c) and (a,b) do not form a matching of maximum weight. It is obviously not true that such a greedy approach would lead to an optimal solution for any combinatorial optimization problem. It turns out that the structures for which the greedy algorithm does lead to an optimal solution, are the matroids. 2.2 Matroids Definition 1. A pair M = (E, I), where E is a ground set and I is a family of subsets (called independent sets) of E, is a matroid if it satisfies the following conditions: (I1) φ 2 IorI = ø: 1 (I2) If A0 ⊆ A and A 2 I then A0 2 I. (I3) If A, B 2 I and jAj < jBj, then 9e 2 (B n A) such that A [feg 2 I: The axiom (I2) is also called the hereditary property and a pair M = (E, I) satisfying (I1) and (I2) is called hereditary family or set-family.
    [Show full text]
  • Partial Fields and Matroid Representation
    ADVANCES IN APPLIED MATHEMATICS 17, 184]208Ž. 1996 ARTICLE NO. 0010 Partial Fields and Matroid Representation Charles Semple and Geoff Whittle Department of Mathematics, Victoria Uni¨ersity, PO Box 600 Wellington, New Zealand Received May 12, 1995 A partial field P is an algebraic structure that behaves very much like a field except that addition is a partial binary operation, that is, for some a, b g P, a q b may not be defined. We develop a theory of matroid representation over partial fields. It is shown that many important classes of matroids arise as the class of matroids representable over a partial field. The matroids representable over a partial field are closed under standard matroid operations such as the taking of minors, duals, direct sums, and 2-sums. Homomorphisms of partial fields are defined. It is shown that if w: P12ª P is a non-trivial partial-field homomorphism, then every matroid representable over P12is representable over P . The connec- tion with Dowling group geometries is examined. It is shown that if G is a finite abelian group, and r ) 2, then there exists a partial field over which the rank-r Dowling group geometry is representable if and only if G has at most one element of order 2, that is, if G is a group in which the identity has at most two square roots. Q 1996 Academic Press, Inc. 1. INTRODUCTION It follows from a classical result of Tuttewx 19 that a matroid is repre- sentable over GFŽ.2 and some field of characteristic other than 2 if and only if it can be represented over the rationals by the columns of a totally unimodular matrix, that is, by a matrix over the rationals all of whose non-zero subdeterminants are inÄ4 1, y1 .
    [Show full text]
  • Matroid Representation of Clique Complexes∗
    Matroid representation of clique complexes¤ x Kenji Kashiwabaray Yoshio Okamotoz Takeaki Uno{ Abstract In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique complex of a graph (the collection of all cliques of the graph) which is also called a flag complex, and investigate the minimum number k such that the clique complex of a given graph can be represented as the intersection of k matroids. This number k can be regarded as a measure of “how complex a graph is with respect to the maximum weighted clique problem” since a greedy algorithm is a k-approximation algorithm for this problem. For any k > 0, we characterize graphs whose clique complexes can be represented as the intersection of k matroids. As a consequence, we can see that the class of clique complexes is the same as the class of the intersections of partition matroids. Moreover, we determine how many matroids are necessary and sufficient for the representation of all graphs with n vertices. This number turns out to be n - 1. Other related investigations are also given. Keywords: Abstract simplicial complex, Clique complex, Flag complex, Independence system, Matroid intersec- tion, Partition matroid 1 Introduction An independence system is a family of subsets of a nonempty finite set such that all subsets of a member of the family are also members of the family. A lot of combinatorial optimization problems can be seen as optimization problems on the corresponding independence systems. For example, in the minimum cost spanning tree problem, we want to find a maximal set with minimum total weight in the collection of all forests of a given graph, which is an independence system.
    [Show full text]
  • Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity
    Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity Daniel Lokshtanov1, Pranabendu Misra2, Fahad Panolan3, Saket Saurabh4, and Meirav Zehavi5 1 University of Bergen, Bergen, Norway [email protected] 2 The Institute of Mathematical Sciences, HBNI, Chennai, India [email protected] 3 University of Bergen, Bergen, Norway [email protected] 4 University of Bergen, Bergen, Norway and The Institute of Mathematical Sciences, HBNI, Chennai, India [email protected] 5 Ben-Gurion University, Beersheba, Israel [email protected] Abstract Deterministic polynomial-time computation of a representation of a transversal matroid is a longstanding open problem. We present a deterministic computation of a so-called union rep- resentation of a transversal matroid in time quasipolynomial in the rank of the matroid. More precisely, we output a collection of linear matroids such that a set is independent in the trans- versal matroid if and only if it is independent in at least one of them. Our proof directly implies that if one is interested in preserving independent sets of size at most r, for a given r ∈ N, but does not care whether larger independent sets are preserved, then a union representation can be computed deterministically in time quasipolynomial in r. This consequence is of independent interest, and sheds light on the power of union representation. Our main result also has applications in Parameterized Complexity. First, it yields a fast computation of representative sets, and due to our relaxation in the context of r, this computation also extends to (standard) truncations. In turn, this computation enables to efficiently solve various problems, such as subcases of subgraph isomorphism, motif search and packing problems, in the presence of color lists.
    [Show full text]
  • 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.
    [Show full text]
  • TOPOLOGICAL REPRESENTATIONS of MATROIDS 1. Introduction One
    JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 16, Number 2, Pages 427{442 S 0894-0347(02)00413-7 Article electronically published on November 29, 2002 TOPOLOGICAL REPRESENTATIONS OF MATROIDS E. SWARTZ 1. Introduction One of the foundations of oriented matroid theory is the topological represen- tation theorem of Folkman and Lawrence [8]. It says that an oriented (simple) matroid can be realized uniquely as an arrangement of pseudospheres. That there is no similar interpretation for the class of all matroids has been taken for granted. For instance, \A non-coordinatizable matroid of abstract origin may be thought of as a geometric object only in a purely formal way, whereas an oriented matroid may always be thought of as a geometric-topological configuration on the d-sphere (or in projective space)" [3, p. 19]. Our main theorem is that the class of geometric lattices, which is cryptomorphic to the category of simple matroids, is the same as the class of intersection lattices of arrangements of homotopy spheres. The interpretation of a geometric lattice as an arrangement of homotopy spheres is a natural generalization of the Folkman-Lawrence theorem. An oriented matroid realizable over R has a representation with geodesic spheres. Allowing pseudo- spheres, i.e., those which are homeomorphic, but possibly not isometric to the unit sphere, leads to the category of (simple) oriented matroids. If we further relax the conditions on the spheres to only homotopy equivalence to the standard sphere, then we are led to the category of all (simple) matroids. Some of the theory of oriented matroids which only depends on the underly- ing matroid can be extended to homotopy sphere arrangements.
    [Show full text]
  • Matroids As Well
    Antti Pöllänen Locally Repairable Codes and Matroid Theory Bachelor’s thesis arXiv:1512.05325v1 [cs.IT] 16 Dec 2015 Espoo November 22, 2015 Supervisor: Associate Professor Camilla Hollanti Instructor: Ph.D. Thomas Westerbäck Aalto University Abstract of the bachelor’s School of Science thesis PL 11000, 00076 Aalto http://sci.aalto.fi/en/ Author: Antti Pöllänen Title: Locally Repairable Codes and Matroid Theory Degree programme: Engineering Physics and Mathematics Major subject: Mathematics and Sys- Major subject code: SCI3029 tems Analysis Supervisor: Associate Professor Camilla Hollanti Instructor: Ph.D. Thomas Westerbäck Abstract: Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. A traditional approach is to look for codes which simultaneously maximize error tolerance and minimize storage space consumption. However, this tends to yield codes for which error correction requires an unrealistic amount of communication between storage nodes. LRCs solve this problem by allowing errors to be corrected locally. This thesis reviews previous results on the subject presented in [1]. These include that every almost affine LRC induces a matroid such that the essential properties of the code are determined by the matroid. Also, the generalized Singleton bound for LRCs can be extended to matroids as well. Then, matroid theory can be used to find classes of matroids that either achieve the bound, meaning they are optimal in a certain sense, or at least come close to the bound. This thesis presents an improvement
    [Show full text]