1 Plenary Talks

Total Page:16

File Type:pdf, Size:1020Kb

1 Plenary Talks 1 Plenary talks 1 Monday 9:00, Zoom 1 A proof of the Erdos-Faber-Lov˝ asz´ conjecture Deryk Osthus University of Birmingham (This talk is based on joint work with Dong-Yeap Kang, Tom Kelly, Daniela K¨uhnand Abhishek Methuku.) MSC2000: 05D40,05C65 In 1972, Erd˝os,Faber, and Lov´aszconjectured the following equivalent statements. Let n N. ∈ (i) If A1,...,An are sets of size n such that every pair of them shares at most one n element, then the elements of i=1 Ai can be coloured by n colours so that all colours appear in each Ai. S (ii) If G is a graph that is the union of n cliques, each having at most n vertices, such that every pair of cliques shares at most one vertex, then the chromatic number of G is at most n. (iii) If is a linear hypergraph with n vertices, then the chromatic index of is at mostH n. H Here the chromatic index χ0( ) of a hypergraph is the smallest number of colours needed to colour the edges of H so that any two edgesH that share a vertex have different colours and a hypergraph is linearH if two hyperedges share at most one vertex. Erd˝oscon- sidered this to be ‘one of his three most favorite combinatorial problems’. The simplicity and elegance of its formulation initially led the authors to believe it to be easily solved. However, as the difficulty became apparent Erd˝osoffered successively increasing rewards for a proof of the conjecture, which eventually reached $500. We prove the Erd˝os-Faber-Lov´aszconjecture for every large n: Theorem 1. [1] For every sufficiently large n, every linear hypergraph on n vertices has chromatic index at most n. H In my talk, I will survey some background, related results and open problems. I will also discuss some of the ideas involved in the proof. [1] Dong-Yeap Kang, Tom Kelly, Daniela K¨uhn,Abhishek Methuku and Deryk Osthus, A proof of the Erd˝os-Faber-Lov´aszconjecture, arxiv:2101.04698. 2 Monday 13:30, Zoom 1 Decomposing the edges of a graph into simpler structures Marthe Bonamy Universit´ede Bordeaux MSC2000: 05C15 We will review various ways to decompose the edges of a graph into few simple substruc- tures. We will mainly focus on variants of edge colouring, and discuss specifically the discharging method and re-colouring techniques. 3 Tuesday 9:00, Zoom 1 Codes and designs in Johnson graphs Cheryl E. Praeger The University of Western Australia (This talk is based on joint work with R. A. Liebler, M. Neunhoeffer, and more recently J. Bamberg, A. C. Devillers and M. Ioppolo.) MSC2000: 05C25, 20B25, 94B60 The Johnson graph J(v, k) has, as vertices, all k-subsets of a v-set , with two k-subsets adjacent if and only if they share k 1 common elements of .V Subsets of vertices of J(v, k) can be interpreted as the block-set− of an incidence structure,V or as the set of codewords of a code, and automorphisms of J(v, k) leaving the subset invariant are then automorphisms of the corresponding incidence structure or code. This approach leads to interesting new designs and codes. For example, numerous actions of the Mathieu sporadic simple groups give rise to examples of Delandtsheer designs (which are both flag-transitive and anti-flag transitive), and codes with large minimum distance (and hence strong error-correcting properties). In my talk I will explore links between designs and codes in Johnson graphs which have a high degree of symmetry, and I will mention several open questions. 4 Tuesday 14:00, Zoom 1 The partition complex: an invitation to combinatorial commutative algebra Karim Adiprasito Hebrew University of Jerusalem (This talk is based on joint work with Geva Yashfe.) MSC2000: 05E40 We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [1]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge of algebra and topology. On the other hand, we also develop new techniques and results using this approach. In particular, we provide 1. A novel, self-contained method of establishing Reisner’s theorem and Schenzel’s for- mula for Buchsbaum complexes. 2. A simple new way to establish Poincar´eduality for face rings of manifolds, in much greater generality and precision than previous treatments. 3. A “master-theorem” to generalize several previous results concerning the Lefschetz theorem on subdivisions. 4. Proof for a conjecture of K¨uhnelconcerning triangulated manifolds with boundary. [1] Karim Adiprasito, Combinatorial Lefschetz theorems beyond positivity, 2018, preprint, arXiv:1812.10454. 5 Wednesday 9:00, Zoom 1 Base sizes and relational complexity of finite permutation groups Colva Roney-Dougal University of St Andrews MSC2000: 20D05 This talk will start by briefly surveying what is known about the maximal subgroups of the finite simple groups. We will then see how this knowledge has been applied to bound some combinatorial invariants of finite permutation groups. A base for a subgroup G of the symmetric group S(Ω) is a subset ∆ of Ω whose pointwise stabiliser in G is trivial. The first invariant we will look at is the size b(G) of a minimal base for G. We will see that b(G) gives a coarse estimate of the size of G, and survey results both old and new which bound b(G). Next, we’ll see how large an irredundant base for G can be: this is an ordered base ∆ = (δ1, . , δk) such that the stabiliser Gα1,...,αi 1 = Gα1,...,αi 1,αi , for all i. − 6 − We’ll end by linking these ideas to model theory, via the idea of relational complexity. 6 Thursday 9:00, Zoom 1 Hasse-Weil type theorems and relevant classes of polynomial functions Daniele Bartoli Universit`adegli Studi di Perugia MSC2000: 14-02 Several types of functions over finite fields have relevant applications in applied areas of mathematics, such as cryptography and coding theory. Among them, planar func- tions, APN permutations, permutation polynomials, and scattered polynomials have been widely studied in the last few years. In order to provide both non-existence results and explicit constructions of infinite fam- ilies, sometimes algebraic varieties over finite fields turn out to be a useful tool. In a typical argument involving algebraic varieties, the key step is estimating the number of their rational points over some finite field. For this reason, Hasse-Weil type theorems (such as Lang-Weil’s and Serre’s) play a fundamental role. 7 Thursday 13:30, Zoom 1 Borel combinatorics Oleg Pikhurko University of Warwick MSC2000: 05C63, 03E05, 28A05 We give an introduction, aimed at non-experts, to Borel combinatorics (that studies definable graphs on topological spaces and looks for constructive assignments satisfying some given local combinatorial constraints). This is an emerging field on the borderline between combinatorics and descriptive set theory with deep connections to many other areas. The aim of this talk is to advertise this field to a wider research community. 8 Friday 9:00, Zoom 1 Generating graphs randomly Catherine Greenhill UNSW Sydney MSC2000: 05C85, 60J10, 68R05, 68W20, 68W40 Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers often wish to compare their particular graph to a “typical” graph from a family (or ensemble) of graphs which are similar to theirs in some way. Such a family might be the set of all graphs with a given number of vertices and edges, or the set of all graphs with a particular degree sequence. One way to do this is to take several random samples from the family, to gather infor- mation about what is “typical”. This motivates the search for an algorithm which can generate graphs uniformly (or approximately uniformly) at random from the given fam- ily. Since many random samples may be required, the algorithm should also be efficient. Rigorous analysis of such algorithms is often challenging, involving both combinatorial and probabilistic arguments. I will discuss some algorithms for sampling graphs, and the methods used to analyse them. 9 Friday 16:00, Zoom 1 Recent Advances on the Graph Isomorphism Problem Martin Grohe RWTH Aachen University MSC2000: 05C60, 68R10, 20B25 The question of whether there is a polynomial time algorithm deciding if two graphs are isomorphic has been a one of the best known open problems in theoretical computer science for almost 50 years. Indeed, the graph isomorphism problem is one of the very few natural problems in the complexity class NP that is neither known to be solvable in polynomial time nor known to be NP-complete. Five years ago, Babai gave a quasipoly- nomial time isomorphism algorithm. Despite of this breakthrough result, the question for a polynomial algorithm remains wide open. My talk will be a survey of recent progress on the isomorphism problem. I will focus on two generic algorithmic strategies that have proved to be useful and interesting in various contexts. The first is the combinatorial Weisfeiler-Leman algorithm with a wide range of applications from practical graph isomorphism testing to machine learning. The second is the group theoretic divide-and-conquer strategy, going back to Luks (1983), that is the foundation of Babai’s quasi-polynomial time isomorphism test. In subsequent developments, it led to the design of isomorphism algorithms with a quasi-polynomial parameterised running time of the form npolylog k, where k is a graph parameter such as the maximum degree. 10 2 Minisymposia talks 11 Tuesday 10:30, Zoom 1 Diagonal semilattices and their graphs Peter J.
Recommended publications
  • Some New General Lower Bounds for Mixed Metric Dimension of Graphs
    Some new general lower bounds for mixed metric dimension of graphs Milica Milivojevi´cDanasa, Jozef Kraticab, Aleksandar Savi´cc, Zoran Lj. Maksimovi´cd, aFaculty of Science and Mathematics, University of Kragujevac, Radoja Domanovi´ca 12, Kragujevac, Serbia bMathematical Institute, Serbian Academy of Sciences and Arts, Kneza Mihaila 36/III, 11 000 Belgrade, Serbia cFaculty of Mathematics, University of Belgrade, Studentski trg 16/IV, 11000 Belgrade, Serbia dUniversity of Defence, Military Academy, Generala Pavla Juriˇsi´ca Sturmaˇ 33, 11000 Belgrade, Serbia Abstract Let G = (V, E) be a connected simple graph. The distance d(u, v) between vertices u and v from V is the number of edges in the shortest u − v path. If e = uv ∈ E is an edge in G than distance d(w, e) where w is some vertex in G is defined as d(w, e) = min(d(w,u),d(w, v)). Now we can say that vertex w ∈ V resolves two elements x, y ∈ V ∪ E if d(w, x) =6 d(w,y). The mixed resolving set is a set of vertices S, S ⊆ V if and only if any two elements of E ∪ V are resolved by some element of S. A minimal resolving set related to inclusion is called mixed resolving basis, and its cardinality is called the mixed metric dimension of a graph G. This graph invariant is recently introduced and it is of interest to find its general properties and determine its values for various classes of graphs. Since arXiv:2007.05808v1 [math.CO] 11 Jul 2020 the problem of finding mixed metric dimension is a minimization problem, of interest is also to find lower bounds of good quality.
    [Show full text]
  • Distances, Diameter, Girth, and Odd Girth in Generalized Johnson Graphs
    Distances, Diameter, Girth, and Odd Girth in Generalized Johnson Graphs Ari J. Herman Dept. of Mathematics & Statistics Portland State University, Portland, OR, USA Mathematical Literature and Problems project in partial fulfillment of requirements for the Masters of Science in Mathematics Under the direction of Dr. John Caughman with second reader Dr. Derek Garton Abstract Let v > k > i be non-negative integers. The generalized Johnson graph, J(v; k; i), is the graph whose vertices are the k-subsets of a v-set, where vertices A and B are adjacent whenever jA \ Bj = i. In this project, we present the results of the paper \On the girth and diameter of generalized Johnson graphs," by Agong, Amarra, Caughman, Herman, and Terada [1], along with a number of related additional results. In particular, we derive general formulas for the girth, diameter, and odd girth of J(v; k; i). Furthermore, we provide a formula for the distance between any two vertices A and B in terms of the cardinality of their intersection. We close with a number of possible future directions. 2 1. Introduction In this project, we present the results of the paper \On the girth and diameter of generalized Johnson graphs," by Agong, Amarra, Caughman, Herman, and Terada [1], along with a number of related additional results. Let v > k > i be non-negative integers. The generalized Johnson graph, X = J(v; k; i), is the graph whose vertices are the k-subsets of a v-set, with adjacency defined by A ∼ B , jA \ Bj = i: (1) Generalized Johnson graphs were introduced by Chen and Lih in [4].
    [Show full text]
  • Paper We Shall Assume That All Logs Are Base 2
    Maximally Recoverable Codes: the Bounded Case Venkata Gandikota ∗ Elena Grigorescu y Clayton Thomas z Minshen Zhu x Abstract Modern distributed storage systems employ Maximally Recoverable codes that aim to bal- ance failure recovery capabilities with encoding/decoding efficiency tradeoffs. Recent works of Gopalan et al [SODA 2017] and Kane et al [FOCS 2017] show that the alphabet size of grid-like topologies of practical interest must be large, a feature that hampers decoding efficiency. To bypass such shortcomings, in this work we initiate the study of a weaker version of recoverability, where instead of being able to correct all correctable erasure patterns (as is the case for maximal recoverability), we only require to correct all erasure patterns of bounded size. The study of this notion reduces to a variant of a combinatorial problem studied in the literature, which is interesting in its own right. We study the alphabet size of codes withstanding all erasure patterns of small (constant) size. We believe the questions we propose are relevant to both real storage systems and combinatorial analysis, and merit further study. 1 Introduction Modern distributed storage systems need to address the challenge of storing large amounts of data, with small overhead, while providing reliable recovery in the face of failures. Unlike in com- munication settings, if a failure occurs in a storage system, it is typically easy to detect where it occurs (e.g., rack or data center failure are obvious to the system). Hence, recent trends in practical systems adopt erasure coding schemes with fast encoding and decoding capabilities [BHH13, HSX+12, SLR+14].
    [Show full text]
  • Properties of Codes in the Johnson Scheme
    Properties of Codes in the Johnson Scheme Natalia Silberstein Properties of Codes in the Johnson Scheme Research Thesis In Partial Fulfillment of the Requirements for the Degree of Master of Science in Applied Mathematics Natalia Silberstein Submitted to the Senate of the Technion - Israel Institute of Technology Shvat 5767 Haifa February 2007 The Research Thesis Was Done Under the Supervision of Professor Tuvi Etzion in the Faculty of Mathematics I wish to express my sincere gratitude to my supervisor, Prof. Tuvi Etzion for his guidance and kind support. I would also like to thank my family and my friends for thear support. The Generous Financial Help Of The Technion and Israeli Science Foundation Is Gratefully Acknowledged. Contents Abstract 1 List of symbols and abbreviations 3 1 Introduction 4 1.1 Definitions.................................. 5 1.1.1 Blockdesigns............................ 5 1.2 PerfectcodesintheHammingmetric. .. 7 1.3 Perfect codes in the Johnson metric (survey of known results)....... 8 1.4 Organizationofthiswork. 13 2 Perfect codes in J(n, w) 15 2.1 t-designs and codes in J(n, w) ....................... 15 2.1.1 Divisibility conditions for 1-perfect codes in J(n, w) ....... 17 2.1.2 Improvement of Roos’ bound for 1-perfect codes . 20 2.1.3 Number theory’s constraints for size of Φ1(n, w) ......... 24 2.2 Moments .................................. 25 2.2.1 Introduction............................. 25 2.2.1.1 Configurationdistribution . 25 2.2.1.2 Moments. ........................ 26 2.2.2 Binomial moments for 1-perfect codes in J(n, w) ........ 27 2.2.2.1 Applicationsof Binomial momentsfor 1-perfect codes in J(n, w) .......................
    [Show full text]
  • Hermitian, Symmetric and Symplectic Random Ensembles
    Annals of Mathematics, 153 (2001), 149–189 Hermitian, symmetric and symplectic random ensembles: PDEs for the distribution of the spectrum By M. Adler and P. van Moerbeke* Abstract Given the Hermitian, symmetric and symplectic ensembles, it is shown that the probability that the spectrum belongs to one or several intervals sat- isfies a nonlinear PDE. This is done for the three classical ensembles: Gaussian, Laguerre and Jacobi. For the Hermitian ensemble, the PDE (in the boundary points of the intervals) is related to the Toda lattice and the KP equation, whereas for the symmetric and symplectic ensembles the PDE is an inductive equation, related to the so-called Pfaff-KP equation and the Pfaff lattice. The method consists of inserting time-variables in the integral and showing that this integral satisfies integrable lattice equations and Virasoro constraints. Contents 0. Introduction 0.1. Hermitian, symmetric and symplectic Gaussian ensembles 0.2. Hermitian, symmetric and symplectic Laguerre ensembles 0.3. Hermitian, symmetric and symplectic Jacobi ensembles 0.4. ODEs, when E has one boundary point 1. Beta-integrals 1.1. Virasoro constraints for β-integrals 1.2. Proof: β-integrals as fixed points of vertex operators 1.3. Examples arXiv:math-ph/0009001v2 14 Aug 2001 2. Matrix integrals and associated integrable systems 2.1. Hermitian matrix integrals and the Toda lattice 2.2. Symmetric/symplectic matrix integrals and the Pfaff lattice 3. Expressing t-partials in terms of boundary-partials 3.1. Gaussian and Laguerre ensembles 3.2. Jacobi ensemble 3.3. Evaluating the matrix integrals on the full range ∗The support of a National Science Foundation grant #DMS-98-4-50790 is gratefully acknowl- edged.
    [Show full text]
  • On the Generalized Θ-Number and Related Problems for Highly Symmetric Graphs
    On the generalized #-number and related problems for highly symmetric graphs Lennart Sinjorgo ∗ Renata Sotirov y Abstract This paper is an in-depth analysis of the generalized #-number of a graph. The generalized #-number, #k(G), serves as a bound for both the k-multichromatic number of a graph and the maximum k-colorable subgraph problem. We present various properties of #k(G), such as that the series (#k(G))k is increasing and bounded above by the order of the graph G. We study #k(G) when G is the graph strong, disjunction and Cartesian product of two graphs. We provide closed form expressions for the generalized #-number on several classes of graphs including the Kneser graphs, cycle graphs, strongly regular graphs and orthogonality graphs. Our paper provides bounds on the product and sum of the k-multichromatic number of a graph and its complement graph, as well as lower bounds for the k-multichromatic number on several graph classes including the Hamming and Johnson graphs. Keywords k{multicoloring, k-colorable subgraph problem, generalized #-number, Johnson graphs, Hamming graphs, strongly regular graphs. AMS subject classifications. 90C22, 05C15, 90C35 1 Introduction The k{multicoloring of a graph is to assign k distinct colors to each vertex in the graph such that two adjacent vertices are assigned disjoint sets of colors. The k-multicoloring is also known as k-fold coloring, n-tuple coloring or simply multicoloring. We denote by χk(G) the minimum number of colors needed for a valid k{multicoloring of a graph G, and refer to it as the k-th chromatic number of G or the multichromatic number of G.
    [Show full text]
  • On Decoding Additive Generalized Twisted Gabidulin Codes
    Cryptography and Communications (2020) 12:987–1009 https://doi.org/10.1007/s12095-020-00449-9 On decoding additive generalized twisted Gabidulin codes Wrya K. Kadir1 · Chunlei Li1 Received: 20 September 2019 / Accepted: 30 June 2020 /Published online: 23 July 2020 © The Author(s) 2020 Abstract In this paper, we consider an interpolation-based decoding algorithm for a large family of maximum rank distance codes, known as the additive generalized twisted Gabidulin codes, over the finite field Fqn for any prime power q. This paper extends the work of the con- ference paper Li and Kadir (2019) presented at the International Workshop on Coding and Cryptography 2019, which decoded these codes over finite fields in characteristic two. Keywords Rank metric · Maximum rank distance codes · Gabidulin codes · Twisted Gabidulin codes · Generalized twisted Gabidulin codes Mathematics Subject Classification (2010) 94B35 · 68P30 · 11T71 · 11T06 1 Introduction Error correction codes with the rank metric have found applications in space-time coding [27], random network coding [44] and cryptography [12]. Many important properties of rank metric codes including the Singleton like bound were independently studied by Del- sarte [9] , Gabidulin [13] and Roth [38]. Codes that achieve this bound were called maximum rank distance (MRD) codes. The most famous sub-family of MRD codes are Gabidulin codes which is the rank metric analog of Reed-Solomon codes. They have been extensively studied in the literature [9, 12, 13, 25, 36, 38]. Finding new families of MRD codes has been an interesting research topic since the invention of Gabidulin codes. In [20, 39], the Frobenious automorphism in the Gabidulin codes were generalized to arbitrary automorphism and generalized Gabidulin (GG) codes Chunlei Li [email protected] Wrya K.
    [Show full text]
  • The Geometry of Rank Decompositions of Matrix Multiplication Ii: 3 3 Matrices
    THE GEOMETRY OF RANK DECOMPOSITIONS OF MATRIX MULTIPLICATION II: 3 3 MATRICES × GREY BALLARD, CHRISTIAN IKENMEYER, J.M. LANDSBERG, AND NICK RYDER Abstract. This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank 23 decompositions for the 3×3 matrix multiplication tensor M⟨3⟩. All our decompositions have symmetry groups that include the standard cyclic permutation of factors but otherwise exhibit a range of behavior. One of them has 11 cubes as summands and admits an unexpected symmetry group of order 12. We establish basic information regarding symmetry groups of decompositions and outline two approaches for finding new rank decompositions of M⟨n⟩ for larger n. 1. Introduction This is the second in a planned series of papers on the geometry of rank decompositions n2 n2 n2 of the matrix multiplication tensor M n C C C . Our goal is to obtain new rank m m m decompositions of M n by exploiting symmetry. For a tensor T C C C , the rank of r ⟨ ⟩ m T is the smallest r such that T j 1 aj ∈bj cj⊗, with⊗ aj; bj; cj C . The rank of M n is a standard complexity measure⟨ ⟩ of matrix multiplication, in particular,∈ it governs⊗ ⊗ the total number of arithmetic operations needed to= multiply∑ = ⊗ two⊗ matrices. ∈ ⟨ ⟩ In this paper we present rank 23 decompositions of M 3 that have large symmetry groups, in particular all admit the standard cyclic Z3-symmetry of permuting the three tensor factors. ⟨ ⟩ Although many rank 23 decompositions of M 3 are known [15, 13], none of them was known to admit the standard cyclic Z3-symmetry.
    [Show full text]
  • On the Connectedness and Diameter of a Geometric Johnson Graph∗
    On the Connectedness and Diameter of a Geometric Johnson Graph∗ C. Bautista-Santiago y J. Cano y R. Fabila-Monroy z∗∗ D. Flores-Pe~naloza x H. Gonz´alez-Aguilar y D. Lara { E. Sarmiento z J. Urrutia yk June 4, 2018 Abstract Let P be a set of n points in general position in the plane. A subset I of P is called an island if there exists a convex set C such that I = P \ C. In this paper we define the generalized island Johnson graph of P as the graph whose vertex consists of all islands of P of cardinality k, two of which are adjacent if their intersection consists of exactly l elements. We show that for large enough values of n, this graph is connected, and give upper and lower bounds on its diameter. Keywords: Johnson graph, intersection graph, diameter, connectedness, islands. 1 Introduction Let [n] := f1; 2; : : : ; ng and let k ≤ n be a positive integer. A k-subset of a set is a subset of k elements. The Johnson graph J(n; k) is the graph whose vertex set consists of all k-subsets of [n], two of which are adjacent if their intersection has size k − 1. The Kneser graph K(n; k) is the graph whose vertex set consists of all k-subsets of [n], two of which are adjacent if they are generalized Johnson graph arXiv:1202.3455v1 [math.CO] 15 Feb 2012 disjoint. The GJ(n; k; l) is the graph whose vertex ∗Part of the work was done in the 2nd Workshop on Discrete Geometry and its Applications.
    [Show full text]
  • SOME PROPERTIES of LINE GRAPHS of HAMMING and JOHNSON GRAPHS by Miss Ratinan Chinda a Thesis Submitted in Partial
    SOME PROPERTIES OF LINE GRAPHS OF HAMMING AND JOHNSON GRAPHS By Miss Ratinan Chinda A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree Master of Science Program in Mathematics Department of Mathematics Graduate School, Silpakorn University Academic Year 2013 Copyright of Graduate School, Silpakorn University SOME PROPERTIES OF LINE GRAPHS OF HAMMING AND JOHNSON GRAPHS By Miss Ratinan Chinda A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree Master of Science Program in Mathematics Department of Mathematics Graduate School, Silpakorn University Academic Year 2013 Copyright of Graduate School, Silpakorn University ­¤´·µ¦³µ¦ °¦µ¢Á­o °¦µ¢Â±¤¤·É¨³¦µ¢°®r­´ Ã¥ µ­µª¦·´r ·µ ª·¥µ·¡r¸ÊÁ}­nª® °µ¦«¹É ¹¬µµ¤®¨´­¼¦¦·µª·¥µ«µ­¦¤®µ´ · ­µ µª·µ«µ­¦· r £µªµ· «µ­¦· r ´·ª·¥µ¨´¥ ¤®µª·¥µ¨¥«´ ·¨µ¦ eµ¦«¹¬µ 2556 ¨· ­··Í °´ ·ª·¥µ¨´¥ ¤®µª·¥µ¨´¥«·¨µ¦ The Graduate School, Silpakorn University has approved and accredited the Thesis title of “Some properties of line graphs of Hamming and Johnson graphs” submitted by Miss Ratinan Chinda as a partial fulfillment of the requirements for the degree of Master of Science in Mathematics ……........................................................................ (Associate Professor Panjai Tantatsanawong, Ph.D.) Dean of Graduate School ........../..................../.......... The Thesis Advisor Chalermpong Worawannotai, Ph.D. The Thesis Examination Committee .................................................... Chairman (Associate Professor Nawarat Ananchuen, Ph.D.) ............/......................../.............
    [Show full text]
  • Clay Lecture, Cheryl Praeger
    Codes and designs in Johnson graphs with high symmetry Cheryl E. Praeger Abstract The Johnson graph J(v; k) has, as vertices, all k-subsets of a v-set V, with two k-subsets adjacent if and only if they share k − 1 common elements of V. Subsets of vertices of J(v; k) can be interpreted as the blocks of an incidence structure, or as the codewords of a code, and automorphisms of J(v; k) leaving the subset invariant are then automorphisms of the corresponding incidence structure or code. This approach leads to interesting new designs and codes. For example, numerous actions of the Mathieu sporadic simple groups give rise to examples of Delandtsheer designs (which are both flag-transitive and anti-flag transitive), and codes with large minimum distance (and hence strong error-correcting properties). The paper surveys recent progress, explores links between designs and codes in Johnson graphs which have a high degree of symmetry, and discusses several open questions. Key-words: designs, codes in graphs, Johnson graph, 2-transitive permuta- tion group, neighbour-transitive, Delandtsheer design, flag-transitive, antiflag- transitive. Mathematics Subject Classification (2010): 05C25, 20B25, 94B60. 1 Introduction The Johnson graphs are ubiquitous in mathematics, perhaps because of their many useful properties. They are distance transitive, and indeed geodesic-transitive, they underpin the Johnson association schemes { and `everyone's favourite graph', the Petersen Graph, occurs as the complement of one of them1. Also, the class of Johnson graphs played a key role in Babai's recent breakthrough [2] to a quasipoly- nomial bound on the complexity of graph isomorphism testing2.
    [Show full text]
  • Conformal Field Theory Techniques in Random Matrix Models
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by CERN Document Server . SPHT/t98/112 Conformal Field Theory Techniques in Random Matrix models Ivan K. Kostov ∗† C.E.A. - Saclay, Service de Physique Th´eorique F-91191 Gif-sur-Yvette, France In these notes we explain how the CFT description of random matrix models can be used to perform actual calculations. Our basic example is the hermitian matrix model, reformulated as a conformal invariant theory of free fermions. We give an explicit operator construction of the corre- sponding collective field theory in terms of a bosonic field on a hyperel- liptic Riemann surface, with special operators associated with the branch points. The quasiclassical expressions for the spectral kernel and the joint eigenvalue probabilities are then easily obtained as correlation functions of current, fermionic and twist operators. The result for the spectral kernel is valid both in macroscopic and microscopic scales. At the end we briefly consider generalizations in different directions. Based on the talk of the author at the Third Claude Itzykson- Meet- ing, ”Integrable Models and Applications to Statistical Mechanics ”, Paris, July 27-29, 1998, and at the workshop “Random matrices and integrable systems”, Univ. of Warwick, November 2-4 1998. July 1999 ∗ Member of CNRS † [email protected] 1. Introduction The random matrix models have various applications in rather different domains, and sometimes language barriers prevents the flow of ideas and knowledge from one field to another. For example, such powerful techniques as the conformal field theory (CFT) description of the random matrix models and their relation with the integrable hierarchies, which were developped extensively by the string theorists in the early 90’s, are practically unknown to the mesoscopic physicists.
    [Show full text]