DOCSLIB.ORG

Signed Graphs and Their Friends

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Signed Graphs and Their Friends Graphs, Gain Graphs, and Geometry a.k.a. Signed Graphs and their Friends Course notes for Math 581: Graphs and Geometry Fall, 2008 | Spring{Summer, 2009 | Spring, 2010 Math 581: Signed Graphs Fall, 2014 Binghamton University (SUNY) Version of November 23, 2014 Lectures by Thomas Zaslavsky Notes by Richard Behr, Peter Cohen, Melissa Fuentes, Simon Joyce, Jackie Kaminski, Yash Lodha, Nathan Reff, Ting Su, and Thomas Zaslavsky Redaction by Thomas Zaslavsky Copyright c 2008{2014 Thomas Zaslavsky Contents Chapter II. Signed Graphs 2 A. Introduction to Signed Graphs 2 A.1. What a signed graph is 2 A.2. Examples of signed graphs 3 A.3. Degrees 3 A.4. Walk and circle signs 4 A.5. Balance 4 A.6. Switching 6 Switching and balance 7 Switching equivalence and switching isomorphism 9 B. Characterizing Signed Graphs 10 B.1. Signature as a homomorphism 10 B.2. Balanced circles and theta oddity 11 C. Connection 13 C.1. Balanced components 13 C.2. Unbalanced blocks 15 C.2.1. Menger's theorem 15 C.2.2. Vertices and edges in unbalanced blocks 16 D. Imbalance and its Measurement 16 D.1. Ways to balance 16 D.1.1. Balancing edges 17 D.1.2. Balancing sets 18 D.2. A plethora of measures 19 D.3. Frustration index 20 D.3.1. Properties 20 D.3.2. Computational complexity 22 D.3.3. Computational methods 23 D.4. Maximum frustration 23 D.5. Disjoint negative circles 26 E. Minors of Signed Graphs 27 E.1. Contraction 27 E.1.1. Contracting a single edge. 27 E.1.2. Contracting an edge set S. 27 E.2. Minors 30 F. Closure and Closed Sets 33 F.1. Closure operator 33 Closure via frame circuits 35 F.2. Closed sets 36 F.3. Signed partial partitions 37 F.3.1. Partial partitions 37 F.3.2. Signed partial partitions 38 F.3.3. Signed partitions 39 F.4. Examples of signed graphs and closed sets 40 ii Table of Contents G. Incidence and Adjacency Matrices 43 G.1. Incidence matrix 43 G.2. Incidence matrix and frame circuits 44 G.3. Adjacency matrix 48 H. Orientation 49 H.1. Bidirected graphs 50 H.2. Incidence matrix of a bidirected graph 51 Walks and coherence 51 I. Equations from Edges, and Signed Graphic Hyperplane Arrangements 52 I.1. Equations from edges 52 I.2. Additive representations: binary and affine 53 J. Chromatic Functions 55 J.1. Coloring a signed graph 56 J.2. Chromatic numbers 57 J.3. Chromatic polynomials 57 J.4. Counting acyclic orientations 61 The sesquijection of acyclic orientations 61 Proper and compatible pairs 71 The number of acyclic orientations 71 J.5. The dichromatic and corank-nullity polynomials 72 Dichromatic polynomials 72 Corank-nullity polynomials 74 J.6. Counting colorations 75 K. Signed Complete Graphs 76 K.1. Coloring 76 Open questions on coloring of signed complete graphs 78 K.2. Two-graphs 78 Graph switching 78 The multiplicity trick 80 K.3. Strongly regular graphs 81 The combinatorics of a detached vertex 82 The matrix of a detached vertex 83 From a strongly regular graph 83 To a strongly regular graph 83 L. Line Graphs of Signed Graphs 84 L.1. What are line graphs for? 84 L.2. Ideas for the line graph of a signed graph 85 Two previous definitions 85 The definition through bidirection 86 M. Circuits, Cocircuits, and their Spaces 87 M.1. Unsigned graphs 88 M.1.1. Cycles, cuts, circuits and bonds 88 M.1.2. Directed cycles and cuts. Indicator vectors. 88 M.2. Signed graphs 90 M.3. Indicator vector of a directed walk 91 M.4. Flows and Cycles 93 Table of Contents 1 M.4.1. Flows 93 M.5. Cuts 95 M.6. The three types of cut 97 Two kinds of balancing set 97 Cuts 97 M.7. Spaces and orthogonality 100 Flows and 1-cycles 100 M.7.1. Cuts 102 Cuts and minimal cuts 102 Readings and Bibliography 104 A. Background 104 B. Signed Graphs 105 C. Geometry of Signed Graphs 105 D. Gain Graphs 106 E. Biased Graphs and Gain Graphs 106 F. General References 106 Chapter II. Signed Graphs Oct 6: Now at last we've arrived at the meat of the course.1 Our purpose is to generalize graph Jackie theory to signed graphs. Not all of graph theory does so generalize, but an enormous amount Kaminski of it does|or should, if the effort were made. Since that has not happened yet, there is plenty of room for a fertile imagination to create new graph theory about signed graphs. A. Introduction to Signed Graphs [[LABEL 2.basics]][[LABEL 2.sg]] A signed graph is a graph with signed edges. But what, precisely, does that mean? In fact, not every edge has a sign; it is only ordinary edges|links and loops|that do. A.1. What a signed graph is. [[LABEL 2.sgintro]] We give two definitions. The first is the simpler: every edge gets a sign. The cost is that we cannot have loose or half edges; but as we shall see in the treatment of contraction (Section E.1) that is rather too constraining, whence the second, more general definition. Definition A.1. [[LABEL D:1006 Ord. Signed Graph]] An ordinary signed graph is a signed ordinary graph, that is, Σ = (Γ; σ) = (V; E; σ) where Γ is an ordinary graph (its edges are links and loops) and σ : E +; is any function. ! f −} Definition A.2. [[LABEL D:1006 Signed Graph]] For any graph Γ, which may have half or loose edges, we define E∗ = e : E(Γ) : e is a loop or link .A signed graph is Σ = (Γ; σ) = (V; E; σ) where Γ is any graphf and σ is any function σ : Eg∗ +; . ! f −} In either case, we call σ the (edge) signature or sign function. Not surprisingly, we refer + + to +; as the sign group. One may instead use the additive group Z2 = F2 = 0; 1 as thef sign−} group, or the group of signed units +1; 1 . We prefer the strictly multiplicativef g point of view implied by +; for reasons thatf will− becomeg clear when we discuss equations (Section I); a hint appearsf when−} we define the sign of a walk. 0 0 0 0 A subgraph Γ = (V ;E ) of Γ is naturally signed by the signature σ = σ E0 . An edge j subset S E makes the natural signed spanning subgraph (V; S; σ S). ⊆ j Definition A.3. [[LABEL D:1006 Isomorphism]] Signed graphs Σ1 and Σ2 are isomorphic if there is a graph isomorphism between Σ1 and Σ2 that preserves edge signs. Many people write +1 and 1 instead of + and . This is harmless as long as we remember the symbols are not numbers− to be added. (I will− eat these words when it comes to defining the adjacency matrix.) To some signed graph theorists (in particular, Slilaty), loose edges are positive, and half edges are negative. This is not a convention I will use. For general culture, I point out that it is well known that graph theory has been invented independently by many people. Signed graph theory was also independently invented by multiple people for multiple purposes. A curious sidelight is that, in knot theory, there is a similar-looking assignment of labels +1; 1 to edges. This is not a signed graph in our sense because the \signs" +1 and 1 f − g − 1For benefit of vegetarians: the term \meat" is intended in its early sense of `substantial food', not ‘flesh’. Section A.4 3 are interchangeable, so they do not form a group. The sign group +; is present implicitly through the action of swapping or not swapping the edge labels.f −} A.2. Examples of signed graphs. [[LABEL 2.examples]] The restriction of Σ to an edge set S is Σ S := (V; S; σ S). Oct 22: Several different signed graphs can be constructedj fromj an ordinary graph Γ. Jackie Kaminski Example A.1. [[LABEL X:1022all+]] +Γ = (Γ; +), where all edges are positive. We call it the all-positive Γ. Example A.2. [[LABEL X:1022all-]] Γ = (Γ; ), where all edges are negative. Unsurpris- ingly, we call it the all-negative Γ. − − Example A.3. [[LABEL X:1022homogeneous]] If Σ is all positive or all negative we call it homogeneous. Otherwise it is heterogeneous.2 Example A.4. [[LABEL X:1022pmG]] Γ = (+Γ) ( Γ), where we differentiate the positive and negative edges, i.e., e Γ± +e; e [ −Γ. Thus, V ( Γ) = V (Γ) and E( Γ) = +(E(Γ)) (E(Γ)). We call2 this7! the signed− 2 expansion ± of Γ. Loops± and especially half± edges can be problematic[· − here, so we generally would assume Γ is a link graph. Example A.5. [[LABEL X:1022full]] Σ is full if every vertex supports a half edge or a negative loop. In other words, referring ahead to Section A.5, every vertex supports an unbalanced edge. This is not the same as having every vertex supporting a negative edge. Note that the terms positive and balanced, or negative and unbalanced, are equivalent for circles, but not for edges. Example A.6. [[LABEL X:1022filled]] Σ◦ is Σ with a negative loop adjoined to every vertex that doesn't have a negative loop or half edge. Σ• is Σ with a negative loop or half edge adjoined to every vertex that doesn't have one. We can also define +Γ◦, Γ◦, and Γ◦. We think of doing the +, , or before adding the negative loops, so that the− final result± has one negative loop at each− vertex,± not a positive loop or two loops.
Load more

Recommended publications
  • Theory of Angular Momentum Rotations About Different Axes Fail to Commute
    153 CHAPTER 3 3.1. Rotations and Angular Momentum Commutation Relations followed by a 90° rotation about the z-axis. The net results are different, as we can see from Figure 3.1. Our first basic task is to work out quantitatively the manner in which Theory of Angular Momentum rotations about different axes fail to commute. To this end, we first recall how to represent rotations in three dimensions by 3 X 3 real, orthogonal matrices. Consider a vector V with components Vx ' VY ' and When we rotate, the three components become some other set of numbers, V;, V;, and Vz'. The old and new components are related via a 3 X 3 orthogonal matrix R: V'X Vx V'y R Vy I, (3.1.1a) V'z RRT = RTR =1, (3.1.1b) where the superscript T stands for a transpose of a matrix. It is a property of orthogonal matrices that 2 2 /2 /2 /2 vVx + V2y + Vz =IVVx + Vy + Vz (3.1.2) is automatically satisfied. This chapter is concerned with a systematic treatment of angular momen- tum and related topics. The importance of angular momentum in modern z physics can hardly be overemphasized. A thorough understanding of angu- Z z lar momentum is essential in molecular, atomic, and nuclear spectroscopy; I I angular-momentum considerations play an important role in scattering and I I collision problems as well as in bound-state problems. Furthermore, angu- I lar-momentum concepts have important generalizations-isospin in nuclear physics, SU(3), SU(2)® U(l) in particle physics, and so forth.
    [Show full text]
  • Introduction
    Introduction This dissertation is a reading of chapters 16 (Introduction to Integer Liner Programming) and 19 (Totally Unimodular Matrices: fundamental properties and examples) in the book : Theory of Linear and Integer Programming, Alexander Schrijver, John Wiley & Sons © 1986. The chapter one is a collection of basic definitions (polyhedron, polyhedral cone, polytope etc.) and the statement of the decomposition theorem of polyhedra. Chapter two is “Introduction to Integer Linear Programming”. A finite set of vectors a1 at is a Hilbert basis if each integral vector b in cone { a1 at} is a non- ,… , ,… , negative integral combination of a1 at. We shall prove Hilbert basis theorem: Each ,… , rational polyhedral cone C is generated by an integral Hilbert basis. Further, an analogue of Caratheodory’s theorem is proved: If a system n a1x β1 amx βm has no integral solution then there are 2 or less constraints ƙ ,…, ƙ among above inequalities which already have no integral solution. Chapter three contains some basic result on totally unimodular matrices. The main theorem is due to Hoffman and Kruskal: Let A be an integral matrix then A is totally unimodular if and only if for each integral vector b the polyhedron x x 0 Ax b is integral. ʜ | ƚ ; ƙ ʝ Next, seven equivalent characterization of total unimodularity are proved. These characterizations are due to Hoffman & Kruskal, Ghouila-Houri, Camion and R.E.Gomory. Basic examples of totally unimodular matrices are incidence matrices of bipartite graphs & Directed graphs and Network matrices. We prove Konig-Egervary theorem for bipartite graph. 1 Chapter 1 Preliminaries Definition 1.1: (Polyhedron) A polyhedron P is the set of points that satisfies Μ finite number of linear inequalities i.e., P = {xɛ ő | ≤ b} where (A, b) is an Μ m (n + 1) matrix.
    [Show full text]
  • Arxiv:2003.05578V2 [Math.CO] 5 Apr 2021 Iegah a Efudi 7
    SIGNED ANALOGUE OF LINE GRAPHS AND THEIR SMALLEST EIGENVALUES ALEXANDER L. GAVRILYUK, AKIHIRO MUNEMASA, YOSHIO SANO, AND TETSUJI TANIGUCHI Abstract. In this paper, we show that every connected signed graph with smallest eigenvalue strictly greater than 2 and large enough minimum degree is switching equivalent to− a complete graph. This is a signed analogue of a theorem of Hoffman. The proof is based on what we call Hoffman’s limit theorem which we formulate for Hermitian matrices, and also the extension of the concept of Hoffman graph and line graph for the setting of signed graphs. 1. Introduction Let G be a simple graph with the vertices-versus-edges incidence (0, 1)-matrix N. It is well known that the line graph L(G) of G, whose vertices are the edges of G with two edges being adjacent whenever they are incident, has adjacency matrix A(L(G)) = N ⊤N 2I , − |E(G)| and hence its smallest eigenvalue λmin is at least 2. Although this property is not exclusive, a theorem of Cameron, Goethals,− Shult, and Seidel [4], which is one of the most beautiful results in algebraic graph theory, classifies connected graphs having λmin 2. Namely, such a graph L on at least 37 vertices must be a generalized≥ − line graph in the arXiv:2003.05578v2 [math.CO] 5 Apr 2021 sense that its adjacency matrix satisfies A(L)= N ⊤N 2I, − for some (0, 1)-matrix N. (A combinatorial definition of generalized line graphs can± be found in [7].) The proof relies on the classification of root systems in Euclidean space [4].
    [Show full text]
  • Two-Graphs and Skew Two-Graphs in Finite Geometries
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Two-Graphs and Skew Two-Graphs in Finite Geometries G. Eric Moorhouse Department of Mathematics University of Wyoming Laramie Wyoming Dedicated to Professor J. J. Seidel Submitted by Aart Blokhuis ABSTRACT We describe the use of two-graphs and skew (oriented) two-graphs as isomor- phism invariants for translation planes and m-systems (including avoids and spreads) of polar spaces in odd characteristic. 1. INTRODUCTION Two-graphs were first introduced by G. Higman, as natural objects for the action of certain sporadic simple groups. They have since been studied extensively by Seidel, Taylor, and others, in relation to equiangular lines, strongly regular graphs, and other notions; see [26]-[28]. The analogous oriented two-graphs (which we call skew two-graphs) were introduced by Cameron [7], and there is some literature on the equivalent notion of switching classes of tournaments. Our exposition focuses on the use of two-graphs and skew two-graphs as isomorphism invariants of translation planes, and caps, avoids, and spreads of polar spaces in odd characteristic. The earliest precedent for using two-graphs to study ovoids and caps is apparently owing to Shult [29]. The degree sequences of these two-graphs and skew two-graphs yield the invariants known as fingerprints, introduced by J. H. Conway (see Chames [9, lo]). Two LZNEAR ALGEBRA AND ITS APPLZCATZONS 226-228:529-551 (1995) 0 Elsevier Science Inc., 1995 0024-3795/95/$9.50 655 Avenue of the Americas, New York, NY 10010 SSDI 0024-3795(95)00242-J 530 G.
    [Show full text]
  • Common-Edge Signed Graph of a Signed Graph
    J. Indones. Math. Soc. Vol. 16, No. 2 (2010), pp. 105–113. COMMON-EDGE SIGNED GRAPH OF A SIGNED GRAPH P. Siva Kota Reddy1, E. Sampathkumar2 and M. S. Subramanya3 1Department of Mathematics, Acharya Institute of Technology, Soldevanahalli, Bangalore 560 090, India, [email protected] 2Department of Studies in Mathematics, University of Mysore, Manasagangotri, Mysore 570 006, India, [email protected] 3Department of Studies in Mathematics, University of Mysore, Manasagangotri, Mysore 570 006, India, subramanya ms@rediffmail.com Abstract. A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G, σ)(S = (G, µ)) where G = (V, E) is a graph called underlying graph of S and σ : E → (e1, e2, ..., ek)(µ : V → (e1, e2, ..., ek)) is a function, where each ei ∈ {+, −}. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is abbreviated a signed graph or a marked graph. The common- edge graph of a graph G = (V, E) is a graph CE (G) = (VE ,EE ), where VE = {A ⊆ V ; |A| = 3, and A is a connected set} and two vertices in VE are adjacent if they have an edge of G in common. Analogously, one can define the common-edge ′ signed graph of a signed graph S = (G, σ) as a signed graph CE (S) = (CE (G), σ ), where CE (G) is the underlying graph of CE (S), where for any edge (e1e2, e2e3) ′ in CE (S), σ (e1e2, e2e3) = σ(e1e2)σ(e2e3). It is shown that for any signed graph S, its common-edge signed graph CE (S) is balanced.
    [Show full text]
  • Hadamard and Conference Matrices
    Hadamard and conference matrices Peter J. Cameron December 2011 with input from Dennis Lin, Will Orrick and Gordon Royle Now det(H) is equal to the volume of the n-dimensional parallelepiped spanned by the rows of H. By assumption, each row has Euclidean length at most n1/2, so that det(H) ≤ nn/2; equality holds if and only if I every entry of H is ±1; > I the rows of H are orthogonal, that is, HH = nI. A matrix attaining the bound is a Hadamard matrix. Hadamard's theorem Let H be an n × n matrix, all of whose entries are at most 1 in modulus. How large can det(H) be? A matrix attaining the bound is a Hadamard matrix. Hadamard's theorem Let H be an n × n matrix, all of whose entries are at most 1 in modulus. How large can det(H) be? Now det(H) is equal to the volume of the n-dimensional parallelepiped spanned by the rows of H. By assumption, each row has Euclidean length at most n1/2, so that det(H) ≤ nn/2; equality holds if and only if I every entry of H is ±1; > I the rows of H are orthogonal, that is, HH = nI. Hadamard's theorem Let H be an n × n matrix, all of whose entries are at most 1 in modulus. How large can det(H) be? Now det(H) is equal to the volume of the n-dimensional parallelepiped spanned by the rows of H. By assumption, each row has Euclidean length at most n1/2, so that det(H) ≤ nn/2; equality holds if and only if I every entry of H is ±1; > I the rows of H are orthogonal, that is, HH = nI.
    [Show full text]
  • On Sign-Symmetric Signed Graphs∗
    ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 19 (2020) 83–93 https://doi.org/10.26493/1855-3974.2161.f55 (Also available at http://amc-journal.eu) On sign-symmetric signed graphs∗ Ebrahim Ghorbani Department of Mathematics, K. N. Toosi University of Technology, P.O. Box 16765-3381, Tehran, Iran Willem H. Haemers Department of Econometrics and Operations Research, Tilburg University, Tilburg, The Netherlands Hamid Reza Maimani , Leila Parsaei Majd y Mathematics Section, Department of Basic Sciences, Shahid Rajaee Teacher Training University, P.O. Box 16785-163, Tehran, Iran Received 24 October 2019, accepted 27 March 2020, published online 10 November 2020 Abstract A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non- bipartite sign-symmetric signed graphs. Sign-symmetric signed graphs have a symmetric spectrum but not the other way around. We present constructions of signed graphs with symmetric spectra which are not sign-symmetric. This, in particular answers a problem posed by Belardo, Cioaba,˘ Koolen, and Wang in 2018. Keywords: Signed graph, spectrum. Math. Subj. Class. (2020): 05C22, 05C50 1 Introduction Let G be a graph with vertex set V and edge set E. All graphs considered in this paper are undirected, finite, and simple (without loops or multiple edges). A signed graph is a graph in which every edge has been declared positive or negative. In fact, a signed graph Γ is a pair (G; σ), where G = (V; E) is a graph, called the underlying ∗The authors would like to thank the anonymous referees for their helpful comments and suggestions.
    [Show full text]
  • Voter Model on Signed Social Networks
    Voter Model on Signed Social Networks Yanhua Li†∗, Wei Chen§, Yajun Wang§ and Zhi-Li Zhang† †Dept. of Computer Science & Engineering, Univ. of Minnesota, Twin Cities § Microsoft Research {yanhua,zhzhang}@cs.umn.edu,{weic,yajunw}@microsoft.com Abstract Online social networks (OSNs) are becoming increasingly popular in recent years, which have generated great interest in studying the influence diffusion and influence maximization with applications to online viral mar- keting. Existing studies focus on social networks with only friendship re- lations, whereas the foe or enemy relations that commonly exist in many OSNs, e.g., Epinions and Slashdot, are completely ignored. In this paper, we make the first attempt to investigate the influence diffusion and influence maximization in OSNs with both friend and foe relations, which are mod- eled using positive and negative edges on signed networks. In particular, we extend the classic voter model to signed networks and analyze the dynamics of influence diffusion of two opposite opinions. We first provide systemat- ic characterization of both short-term and long-term dynamics of influence diffusion in this model, and illustrate that the steady state behaviors of the dynamics depend on three types of graph structures, which we refer to as balanced graphs, anti-balanced graphs, and strictly unbalanced graphs. We then apply our results to solve the influence maximization problem and de- velop efficient algorithms to select initial seeds of one opinion that maximize either its short-term influence coverage or long-term steady state influence coverage. Extensive simulation results on both synthetic and real-world net- works, such as Epinions and Slashdot, confirm our theoretical analysis on influence diffusion dynamics, and demonstrate the efficacy of our influence maximization algorithm over other heuristic algorithms.
    [Show full text]
  • List Homomorphism Problems for Signed Graphs
    List homomorphism problems for signed graphs Jan Bok Computer Science Institute, Faculty of Mathematics and Physics, Charles University, Czech Republic [email protected]ff.cuni.cz Richard Brewster Department of Mathematics and Statistics, Thompson Rivers University, Canada [email protected] Tomás Feder 268 Waverley St., Palo Alto, USA [email protected] Pavol Hell School of Computing Science, Simon Fraser University, Canada [email protected] Nikola Jedličková Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Czech Republic [email protected]ff.cuni.cz Abstract We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking a homomorphism of an input signed graph (G, σ), equipped with lists L(v) ⊆ V (H), v ∈ V (G), of allowed images, to a fixed target signed graph (H, π). The complexity of the similar homomorphism problem without lists (corresponding to all lists being L(v) = V (H)) has been previously classified by Brewster and Siggers, but the list version remains open and appears difficult. We illustrate this difficulty by classifying the complexity of the problem when H is a tree (with possible loops). The tools we develop will be useful for classifications of other classes of signed graphs, and we illustrate this by classifying the complexity of irreflexive signed graphs in which the unicoloured edges form some simple structures, namely paths or cycles. The structure of the signed graphs in the polynomial cases is interesting, suggesting they may constitute a nice class of signed graphs analogous to the so-called bi-arc graphs (which characterized the polynomial cases of list homomorphisms to unsigned graphs).
    [Show full text]
  • Pretty Good State Transfer in Discrete-Time Quantum Walks
    Pretty good state transfer in discrete-time quantum walks Ada Chan and Hanmeng Zhan Department of Mathematics and Statistics, York University, Toronto, ON, Canada fssachan, [email protected] Abstract We establish the theory for pretty good state transfer in discrete- time quantum walks. For a class of walks, we show that pretty good state transfer is characterized by the spectrum of certain Hermitian adjacency matrix of the graph; more specifically, the vertices involved in pretty good state transfer must be m-strongly cospectral relative to this matrix, and the arccosines of its eigenvalues must satisfy some number theoretic conditions. Using normalized adjacency matrices, cyclic covers, and the theory on linear relations between geodetic an- gles, we construct several infinite families of walks that exhibits this phenomenon. 1 Introduction arXiv:2105.03762v1 [math.CO] 8 May 2021 A quantum walk with nice transport properties is desirable in quantum com- putation. For example, Grover's search algorithm [12] is a quantum walk on the looped complete graph, which sends the all-ones vector to a vector that almost \concentrate on" a vertex. In this paper, we study a slightly stronger notion of state transfer, where the target state can be approximated with arbitrary precision. This is called pretty good state transfer. Pretty good state transfer has been extensively studied in continuous-time quantum walks, especially on the paths [9, 22, 1, 5, 21]. However, not much 1 is known for the discrete-time analogues. The biggest difference between these two models is that in a continuous-time quantum walk, the evolution is completely determined by the adjacency or Laplacian matrix of the graph, while in a discrete-time quantum walk, the transition matrix depends on more than just the graph - usually, it is a product of two unitary matrices: U = SC; where S permutes the arcs of the graph, and C, called the coin matrix, send each arc to a linear combination of the outgoing arcs of the same vertex.
    [Show full text]
  • Hadamard Matrices Include
    Hadamard and conference matrices Peter J. Cameron University of St Andrews & Queen Mary University of London Mathematics Study Group with input from Rosemary Bailey, Katarzyna Filipiak, Joachim Kunert, Dennis Lin, Augustyn Markiewicz, Will Orrick, Gordon Royle and many happy returns . Happy Birthday, MSG!! Happy Birthday, MSG!! and many happy returns . Now det(H) is equal to the volume of the n-dimensional parallelepiped spanned by the rows of H. By assumption, each row has Euclidean length at most n1/2, so that det(H) ≤ nn/2; equality holds if and only if I every entry of H is ±1; > I the rows of H are orthogonal, that is, HH = nI. A matrix attaining the bound is a Hadamard matrix. This is a nice example of a continuous problem whose solution brings us into discrete mathematics. Hadamard's theorem Let H be an n × n matrix, all of whose entries are at most 1 in modulus. How large can det(H) be? A matrix attaining the bound is a Hadamard matrix. This is a nice example of a continuous problem whose solution brings us into discrete mathematics. Hadamard's theorem Let H be an n × n matrix, all of whose entries are at most 1 in modulus. How large can det(H) be? Now det(H) is equal to the volume of the n-dimensional parallelepiped spanned by the rows of H. By assumption, each row has Euclidean length at most n1/2, so that det(H) ≤ nn/2; equality holds if and only if I every entry of H is ±1; > I the rows of H are orthogonal, that is, HH = nI.
    [Show full text]
  • Perfect, Ideal and Balanced Matrices: a Survey
    Perfect Ideal and Balanced Matrices Michele Conforti y Gerard Cornuejols Ajai Kap o or z and Kristina Vuskovic December Abstract In this pap er we survey results and op en problems on p erfect ideal and balanced matrices These matrices arise in connection with the set packing and set covering problems two integer programming mo dels with a wide range of applications We concentrate on some of the b eautiful p olyhedral results that have b een obtained in this area in the last thirty years This survey rst app eared in Ricerca Operativa Dipartimento di Matematica Pura ed Applicata Universitadi Padova Via Belzoni Padova Italy y Graduate School of Industrial administration Carnegie Mellon University Schenley Park Pittsburgh PA USA z Department of Mathematics University of Kentucky Lexington Ky USA This work was supp orted in part by NSF grant DMI and ONR grant N Introduction The integer programming mo dels known as set packing and set covering have a wide range of applications As examples the set packing mo del o ccurs in the phasing of trac lights Stoer in pattern recognition Lee Shan and Yang and the set covering mo del in scheduling crews for railways airlines buses Caprara Fischetti and Toth lo cation theory and vehicle routing Sometimes due to the sp ecial structure of the constraint matrix the natural linear programming relaxation yields an optimal solution that is integer thus solving the problem We investigate conditions under which this integrality prop erty holds Let A b e a matrix This matrix is perfect if the fractional
    [Show full text]