DOCSLIB.ORG

The Auslander-Reiten Quiver of Equipped Posets of Finite Growth Representation Type, Some Functorial Descriptions and Its Applications

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Auslander-Reiten Quiver of Equipped Posets of Finite Growth Representation Type, Some Functorial Descriptions and Its Applications The Auslander-Reiten Quiver of Equipped Posets of Finite Growth Representation Type, some Functorial Descriptions and Its Applications Isa´ıas David Mar´ın Gaviria Universidad Nacional de Colombia Facultad de Ciencias Departamento de Matematicas´ Bogota,´ D.C. November, 2019 The Auslander-Reiten Quiver of Equipped Posets of Finite Growth Representation Type, some Functorial Descriptions and Its Applications Isa´ıas David Mar´ın Gaviria Thesis work to obtain the degree of Doctor in Mathematics Advisor Professor Octavio Mendoza Hernandez,´ Ph.D. Full professor, National Autonomous University of Mexico-D.F Coadvisor Agust´ın Moreno Canadas,~ Ph.D. Associate Professor, National University of Colombia Research line Representation theory of posets Research group TERENUFIA-UNAL Universidad Nacional de Colombia Facultad de Ciencias Departamento de Matematicas´ Bogota,´ D.C. November, 2019 5 Title The Auslander-Reiten Quiver of Equipped Posets of Finite Growth Representation Type, some Functorial Descriptions and Its Applications Abstract: The theory of representation of partially ordered sets or posets was introduced in the early 1970's as an effort to give an answer to the second Brauer-Thrall conjecture. Recall that one of the main goals of this theory is to give a complete description of the indecomposable objects of the category of representations of a given poset. Perhaps the most useful tool to obtain such classification are the algorithms of differentiation. For instance, Nazarova and Roiter introduced an algorithm known as the algorithm of differentiation with respect to a maximal point which allowed to Kleiner in 1972 to obtain a classification of posets of finite representation type. Soon afterwards between 1974 and 1977, Zavadskij defined the more general algorithm I with respect to a suitable pair of points, this algorithm was used in 1981 by Nazarova and Zavadskij in order to give a criterion for the classification of posets of finite growth representation type. Actually, several years later, Zavadskij himself described the structure of the Auslander-Reiten quiver of this kind of posets, to do that, it was established that such an algorithm is in fact a categorical equivalence. Since the theory of representation of posets was developed in the 1980's and 1990's for posets with additional structures, for example, for posets with involution or for equipped posets by Bondarenko, Nazarova, Roiter, Zabarilo and Zavadskij among others. It was necessary to define a new class of algorithms to classify posets with these additional structures. In fact, Zavadskij introduced 17 algorithms. Algorithms, I-V (and some additional differentiations) were used by him and Bondarenko to classify posets with involution, whereas algorithms I, VII-XVII were used to classify equipped posets. In particular, algorithms I, VII, VIII and IX were used to classify equipped posets of finite growth representation type without paying attention to the behavior of the morphisms of the corresponding categories. In other words, it was obtained a classification of the objects without proving that the algorithms used to tackle the problems are in fact categorical equivalences, therefore, the main problem of the theory of the algorithms of differentiation consists of giving a detailed description of the behavior of the morphisms under these additive functors, such description allows to give a deep understanding of the Auslander-Reiten quiver of the corresponding categories. On the other hand, in the last few years has been noted a great interest in the application of the theory of representation of algebras in different fields of computer science, for example, in combinatorics, information security and topological data analysis. Ringel and Fahr, for instance, gave a categorification of Fibonacci numbers by using the 3-Kronecker quiver whereas representation of posets and the theory of posets have been used to analyze tactics of war and cyberwar. Besides, the theory of Auslander has been used to analyze big data via the homological persistent theory. In this research, it is proved that the algorithms of differentiation VIII-X induce categorical equivalences between some quotient categories, giving a description of the Auslander-Reiten quiver of some equipped posets by using the evolvent associated to these kind of posets. In this work, ideas arising from the theory of representation of equipped posets are used to give a categorification of Delannoy numbers. Actually, such numbers are interpreted as dimensions of some suitable equipped posets. We also interpret the algorithm of differentiation VII as a steganographic algorithm which allows to generate digital watermarks, such an algorithm can be also used to describe the behavior of some kind of informatics viruses, in fact, it is explained how this algorithm describe the infection-detection process when a computer network is affected for this type of malware. At last but not least, we recall that the theory of representation of equipped posets is a way to deal with the homogeneous biquadratic problem which is an open matrix problem, in this case, with respect to a pair of fields (F; G) with G a quadratic extension of the field F with respect to a polynomial of the form t2 + q, q 2 F . Actually, explicit solutions to this problem were given by Zavadskij who rediscovered in 2007 the Krawtchouk matrices introducing an interesting Θ-transformation as well. In this research, such Krawtchouk matrices are used in order to give explicit solutions to non-linear systems of differential equations of the form X0(t) + AX2(t) = B, where X(t);X0(t);A and B are n × n square matrices. Tools arising from this solution are called in this work the Zavadskij calculus. This research was partially supported by COLCIENCIAS convocatoria doctorados nacionales 727 de 2015. Keywords: Representation theory of partially ordered sets, Representation theory of quivers, Auslander-Reiten theory, Matrix problem, Equipped poset, Equipped posets with Involution, Algorithms of Differentiation, Delannoy numbers, Zavadskij Calculus, Partitions of integer numbers, Integer sequences, Digital Watermark, Virus and Worms. Acceptation Note Thesis Work \ mention" Jury Jury Jury Advisor Octavio Mendoza Hern´andez Coadvisor Agust´ınMoreno Ca~nadas Bogot´a,D.C., November, 2019 Dedicated to My mom Luz Dary Gaviria and to my wife Andrea Valencia for their constant support and who never gave up on me. A.M. Ca~nadas, who put me on the road, who accompanied me throughout the journey and encouraged me in difficult times. Acknowledgments I would like to express my special appreciation to my advisor Professor Agustin Moreno, Ph.D. for being such a tremendous mentor for me. I would like to thank you for encourag- ing my research and for allowing me to grow as a research and as a scientist. His advice on both research as well as on my career have been invaluable. I would also like to thank my other advisor, Professor Octavio Mendoza, Ph.D. for his hard work and thorough review of this thesis. I also want to thank him for his brilliant comments and suggestions, so that this work could be read in a clearer and more scientific way, thanks for his support and discussion sessions during my visit research internship in National Autonomous University of Mexico in 2017, many thanks. A special thanks to my family, words cannot express how grateful I am to my mother Luz Dary, for all of the sacrifices she has made for my well-being on my behalf. Her prayer for me was what sustained me thus far. I would also like to thank my beloved wife Andrea Valencia, MSc. Thanks for always supporting me, for allowing me to sacrifice our family time to finish this research, she took care of me in times where I used to work too much. I specially express my regards to my partners of the TERENUFIA-UNAL research group for the stimulating discussions, for their feedback, for their contributions and mainly for encouraging me throughout this experience. I also want to express my gratitude to my close friends PFF Espinosa and VC Vargas for being such good friends, for always motivating me and for being with me throughout this process, also for providing discussion spaces for the advance of this investigation. Last but not least, I would like to thank to Professor A.G. Zavadskij, who inspired all this research by leaving us his legacy of research. Finally, I thank God, for letting me to overcome all the difficulties. I have experienced His guidance day by day; He was the one who let me finish my doctorate studies. Thanks My Lord. Contents Contents III List of Tables VII List of Figures IX Introduction XIII 1. Partially ordered sets with additional structure 1 1.1 Equipped posets and equipped posets with involution . .1 1.2 Categories . .5 1.2.1 Auslander-Reiten theory in a Krull-Schmidth category . .9 1.3 Complexification and reellification . 12 1.4 Representation of equipped posets and equipped posets with involution . 15 1.5 The matrix problem . 17 1.6 Some indecomposable objects . 19 1.7 Some classification theorems . 22 2. Algorithms of differentiation 27 2.1 (A; B)-cleaving pairs and the Zavadskij symbol . 27 2.2 Algorithm of differentiation I with respect to a suitable pair of points and the completion algorithm . 28 2.2.1 Algorithm of differentiation I . 29 2.2.2 Completion algorithm . 30 2.3 Categorical properties of differentiation VII for equipped posets . 32 2.4 Categorical properties of the algorithm of differentiation VIII for equipped posets.................................................. 37 2.5 Categorical properties of the algorithm of differentiation IX for equipped posets.................................................. 44 III CONTENTS IV 2.6 Categorical properties of the algorithm of differentiation X for equipped posets with involution . 50 3. The Auslander-Reiten quiver of some equipped posets 58 3.1 The lifting algorithm . 58 3.2 The Auslander-Reiten quiver of the equipped posets F13 − F18 .........
Load more

Recommended publications
  • Conference Program
    !"#$%&'(&)'*+%*+,! ! #$%&'%('! "! )*+,%-*!.%!/0112345""6! #! )*+,%-*!.%!789+:&;!<(*+=&>6! $! <&'.(8,.:%&'!?%(!#*'':%&!1@=:('!=&>!A(*'*&.*('! %! B(=,C!D:'.! &! 7=:+E!#,@*>8+*!=.!=!/+=&,*! '! A=$*(!A(*'*&.=.:%&'!9E!B(=,C! ("! GeneticGenetic andand EvolutionaryEvolutionary1%&?*(*&,*!F+%%($+=& Computation Computation! (%!! Conference Conference 2009 2012 ConferenceConference2(G=&:H*(' ProgramProgram! ('! Table of Contents B(=,C!1@=:('! ()! GECCO has grown up Table of Contents 1 A(%G(=-!1%--:..**! "*! Program Outline 2 WelcomeOrganizers from General Chair! I*'.!A=$*(!J%-:&**'! "'! 3 4 Instruction for Session Chairs and Presenters! 4 Program Committee K*E&%.*'! #*! 5 ProgramPapers Schedule Nominated and Floor for BestPlans Paper! Awards 5 12 B@*!L.@!M&&8=+!NO8-:*'P!MQ=(>'! #"! TrackAbout List the and Evolutionary Abbreviations! Computation in Practice Track 5 15 Floor Plans! 6 Tutorials and Workshops0R%+8.:%&=(E!1%-$8.=.:%&!:&!A(=,.:,* Schedule ! ##! 16 Daily Schedule at a Glance! 8 Meeting Rooms Floor Plan 18 GECCO-2012 Conference B@*!/0112!<&>8'.(:=+!1@=++*&G*Organizers and Track Chairs! ! #$! 13 Wednesday Workshop Presentations 20 GECCO-2012Thursday Program Workshop Committee 45""!/0112!1%-$*.:.:%&'Presentations Members ! ! #%! 15 30 Best PaperPaper NominationsPresentations! Sessions-at-a-Glance 24 34 )%(C'@%$!A(*'*&.=.:%&'! #'! Keynote withThursday, Chris Adami 18:30! Poster Session 30 36 Keynote forInstructions the GDS track for Sessionwith Stuart Chairs+,-./!+/.0.1 Kauffman and Presenters! 2,23410 ! ! 30 55 Friday, 8:30 Presentations
    [Show full text]
  • Krawtchouk Matrices from Classical and Quantum Random Walks
    Krawtchouk matrices from classical and quantum random walks Philip Feinsilver and Jerzy Kocik Abstract. Krawtchouk’s polynomials occur classically as orthogonal polyno- mials with respect to the binomial distribution. They may be also expressed in the form of matrices, that emerge as arrays of the values that the polynomials take. The algebraic properties of these matrices provide a very interesting and accessible example in the approach to probability theory known as quantum probability. First it is noted how the Krawtchouk matrices are connected to the classical symmetric Bernoulli random walk. And we show how to derive Krawtchouk matrices in the quantum probability context via tensor powers of the elementary Hadamard matrix. Then connections with the classical situa- tion are shown by calculating expectation values in the quantum case. 1. Introduction Some very basic algebraic rules can be expressed using matrices. Take, for example, (a + b)2 = a2 + 2ab + b2 1 1 1 (2) (a + b)(a − b) = a2 − b2 ⇒ Φ = 2 0 −2 (a − b)2 = a2 − 2ab + b2 1 −1 1 (the expansion coefficients make up the columns of the matrix). In general, we make the definition: Definition 1.1. The N th-order Krawtchouk matrix Φ(N) is an (N +1)×(N +1) matrix, the entries of which are determined by the expansion: N N−j j X i (N) (1.1) (1 + v) (1 − v) = v Φij . i=0 The left-hand-side G(v) = (1 + v)N−j (1 − v)j is thus the generating function for the row entries of the jth column of Φ(N).
    [Show full text]
  • Probability on Algebraic and Geometric Structures
    668 Probability on Algebraic and Geometric Structures International Research Conference in Honor of Philip Feinsilver, Salah-Eldin A. Mohammed, and Arunava Mukherjea Probability on Algebraic and Geometric Structures June 5–7, 2014 Southern Illinois University, Carbondale, Illinois Gregory Budzban Harry Randolph Hughes Henri Schurz Editors American Mathematical Society Probability on Algebraic and Geometric Structures International Research Conference in Honor of Philip Feinsilver, Salah-Eldin A. Mohammed, and Arunava Mukherjea Probability on Algebraic and Geometric Structures June 5–7, 2014 Southern Illinois University, Carbondale, Illinois Gregory Budzban Harry Randolph Hughes Henri Schurz Editors 668 Probability on Algebraic and Geometric Structures International Research Conference in Honor of Philip Feinsilver, Salah-Eldin A. Mohammed, and Arunava Mukherjea Probability on Algebraic and Geometric Structures June 5–7, 2014 Southern Illinois University, Carbondale, Illinois Gregory Budzban Harry Randolph Hughes Henri Schurz Editors American Mathematical Society Providence, Rhode Island EDITORIAL COMMITTEE Dennis DeTurck, Managing Editor Michael Loss Kailash Misra Catherine Yan 2010 Mathematics Subject Classification. Primary 05C50, 15A66, 49N90, 54C40, 60B15, 60G50, 60H07, 60H15, 60H30, 60J05. Library of Congress Cataloging-in-Publication Data Names: Feinsilver, Philip J. (Philip Joel), 1948- — Mohammed, Salah-Eldin, 1946– — Mukherjea, Arunava, 1941– — Budzban, Gregory, 1957– editor. — Hughes, Harry Randolph, 1957– editor. — Schurz, Henri,
    [Show full text]
  • Kravchuk Polynomials and Induced/Reduced Operators on Clifford Algebras G
    Southern Illinois University Edwardsville SPARK SIUE Faculty Research, Scholarship, and Creative Activity 2015 Kravchuk Polynomials and Induced/Reduced Operators on Clifford Algebras G. Stacey Staples Southern Illinois University Edwardsville, [email protected] Follow this and additional works at: http://spark.siue.edu/siue_fac Part of the Algebra Commons, and the Discrete Mathematics and Combinatorics Commons Recommended Citation G.S. Staples, Kravchuk polynomials and induced/reduced operators on Clifford algebras, Complex Analysis and Operator Theory, 9 (2015), 445 - 478. http://dx.doi.org/10.1007/s11785-014-0377-z This Article is brought to you for free and open access by SPARK. It has been accepted for inclusion in SIUE Faculty Research, Scholarship, and Creative Activity by an authorized administrator of SPARK. For more information, please contact [email protected]. Cover Page Footnote The definitive version of this article was published by Springer in Complex Analysis and Operator Theory. The final publication is available at Springer via http://dx.doi.org/10.1007/s11785-014-0377-z . This article is available at SPARK: http://spark.siue.edu/siue_fac/6 Kravchuk Polynomials and Induced/Reduced Operators on Clifford Algebras G. Stacey Staples∗ Abstract Kravchuk polynomials arise as orthogonal polynomials with respect to the binomial distribution and have numerous applications in harmonic analysis, statistics, coding theory, and quantum probability. The relation- ship between Kravchuk polynomials and Clifford algebras is multifaceted. In this paper, Kravchuk polynomials are discovered as traces of conjuga- tion operators in Clifford algebras, and appear in Clifford Berezin integrals of Clifford polynomials. Regarding Kravchuk matrices as linear operators on a vector space V , the action induced on the Clifford algebra over V is equivalent to blade conjugation, i.e., reflections across sets of orthogonal hyperplanes.
    [Show full text]
  • Arxiv:2007.11711V3 [Quant-Ph] 28 Jun 2021 and Estimate the Expected Error As N Becomes Large
    arXiv:2007.11711 Quantum hypothesis testing in many-body systems Jan de Boera, Victor Godeta, Jani Kastikainenb;d, Esko Keski-Vakkurib;c a Institute for Theoretical Physics, University of Amsterdam, PO Box 94485, 1090 GL Amsterdam, The Netherlands bDepartment of Physics, P.O.Box 64, FIN-00014 University of Helsinki, Finland cHelsinki Institute of Physics, P.O.Box 64, FIN-00014 University of Helsinki, Finland dAPC, AstroParticule et Cosmologie, Universit´ede Paris, CNRS/IN2P3, CEA/IRFU, Observatoire de Paris, 10, rue Alice Domon et L´eonieDuquet, 75205 Paris Cedex 13, France [email protected], [email protected], [email protected], [email protected] ABSTRACT One of the key tasks in physics is to perform measurements in order to determine the state of a system. Often, measurements are aimed at determining the values of physical parameters, but one can also ask simpler questions, such as \is the system in state A or state B?". In quantum mechanics, the latter type of measurements can be studied and optimized using the framework of quantum hypothesis testing. In many cases one can explicitly find the optimal measurement in the limit where one has simultaneous access to a large number n of identical copies of the system, arXiv:2007.11711v3 [quant-ph] 28 Jun 2021 and estimate the expected error as n becomes large. Interestingly, error estimates turn out to involve various quantum information theoretic quantities such as relative entropy, thereby giving these quantities operational meaning. In this paper we consider the application of quantum hypothesis testing to quantum many-body systems and quantum field theory.
    [Show full text]
  • Why Jacket Matrices?
    Why Jacket Matrices? 1 1 T [][]AN a ij Moon Ho Lee (E-mail:[email protected]) wcu.chonbuk.ac.kr, mdmc.chonbuk.ac.kr Institute of Information & Communication Chonbuk National University Jeonju, 561-756, Korea Tel: +82632702463 Fax: +82632704166 htttp://en.wikipedia.org/wiki/Category:Matrices htttp://en.wikipedia.org/wiki/Jacket:Matrix 1 http://en.wikipedia.org/wiki/user:leejacket 2 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + + -j -j j j - - + + - - + + - - + + j j -j -j - - + + - - + + - - + - -j j j -j - + + - - + + - - + + - j -j -j j - + + - - + + - - + + + j j -j -j - - + + + + - - - - + + -j -j j j - - + + + + - - - - + - j -j -j j - + + - + - - + - + + - -j j j -j - + + - + - - + - + + + - - - - + + + + - - - - + + + + - - - - + + + + - - - - + + + - - + - + + - + - - + - + + - + - - + - + + - + - - + - + + - Real Domain Complex Domain The basic idea was motivated by the cloths of Jacket. As our two sided Jacket is inside and outside compatible, at least two positions of a Jacket matrix are replaced by their inverse; these elements are changed in their position and are moved, for example, from inside of the middle circle to outside or from to inside without loss of sign. 3 In mathematics a Jacket matrix is a square matrix A = aij of order n whose entries are from a field (including real field, complex field, finite field ), if AA * = A * A = nIn Where : A * is the transpose of the matrix of inverse entries of A , i.e. Written in different form is a u, v {1,2,...,n }, u v : u, i 0 av, i The inverse form which is only from the entrywise inverse and transpose : Jacket Matrices T j0,0 j0,1 .... j0,n1 1/ j0,0 1/ j0,1 .... 1/ j0,n1 j j .... j 1/ j 1/ j ...
    [Show full text]
  • Exact Computation of the Expectation Curves of the Bit-Flip Mutation Using Landscapes Theory
    Exact Computation of the Expectation Curves of the Bit-Flip Mutation using Landscapes Theory Francisco Chicano Enrique Alba University of Málaga, Spain University of Málaga, Spain [email protected] [email protected] ABSTRACT Bit-flip mutation is a common operation when a genetic al- λ avg f(y) = f(x)+ f¯ f(x) gorithm is applied to solve a problem with binary repre- y∈{N(x) } d − sentation. We use in this paper some results of landscapes where d is the size of the neighborhood, N(x) , which we theory and Krawtchouk polynomials to exactly compute the | | expected value of the fitness of a mutated solution. We prove assume is the same for all the solutions in the search space, ¯ that this expectation is a polynomial in p, the probability of f is the average solution evaluation over the entire search flipping a single bit. We analyze these polynomials and pro- space, and λ is a characteristic constant. The wave equa- pose some applications of the obtained theoretical results. tion makes it possible to compute the average value of the fitness function f evaluated over all of the neighbors of x Categories and Subject Descriptors using only the value f(x); we denote this average by using avg f(y) y∈N(x): I.2.8 [Artificial Intelligence]: Problem Solving, Control { } 1 Methods, and Search avg f(y) = f(y) (1) { } N(x) y∈N(x) y N x General Terms | | ∈X( ) The previous average can be interpreted as the expected Theory, Algorithms value of the objective function when a random neighbor of x is selected using a uniform distribution.
    [Show full text]
  • Quantum Hypothesis Testing in Many-Body Systems Abstract Contents
    SciPost Phys. Core 4, 019 (2021) Quantum hypothesis testing in many-body systems 1? 1† 2,4‡ 2,3‘ Jan de Boer , Victor Godet , Jani Kastikainen and Esko Keski-Vakkuri ◦ 1 Institute for Theoretical Physics, University of Amsterdam, PO Box 94485, 1090 GL Amsterdam, The Netherlands 2 Department of Physics, P.O.Box 64, FIN-00014 University of Helsinki, Finland 3 Helsinki Institute of Physics, P.O.Box 64, FIN-00014 University of Helsinki, Finland 4 APC, AstroParticule et Cosmologie, Université de Paris, CNRS/IN2P3, CEA/IRFU, Observatoire de Paris, 10, rue Alice Domon et Léonie Duquet, 75205 Paris Cedex 13, France ? [email protected],† [email protected], ‡ jani.kastikainen@helsinki.fi, esko.keski-vakkuri@helsinki.fi ◦ Abstract One of the key tasks in physics is to perform measurements in order to determine the state of a system. Often, measurements are aimed at determining the values of physical parameters, but one can also ask simpler questions, such as “is the system in state A or state B?”. In quantum mechanics, the latter type of measurements can be studied and optimized using the framework of quantum hypothesis testing. In many cases one can explicitly find the optimal measurement in the limit where one has simultaneous access to a large number n of identical copies of the system, and estimate the expected error as n becomes large. Interestingly, error estimates turn out to involve various quantum information theoretic quantities such as relative entropy, thereby giving these quantities operational meaning. In this paper we consider the application of quantum hypothesis testing to quantum many-body systems and quantum field theory.
    [Show full text]
  • Krawtchouk-Griffiths Systems I: Matrix Approach Philip Feinsilver
    Communications on Stochastic Analysis Volume 10 | Number 3 Article 3 9-1-2016 Krawtchouk-Griffiths systems I: matrix approach Philip Feinsilver Follow this and additional works at: https://digitalcommons.lsu.edu/cosa Part of the Analysis Commons, and the Other Mathematics Commons Recommended Citation Feinsilver, Philip (2016) "Krawtchouk-Griffiths systems I: matrix approach," Communications on Stochastic Analysis: Vol. 10 : No. 3 , Article 3. DOI: 10.31390/cosa.10.3.03 Available at: https://digitalcommons.lsu.edu/cosa/vol10/iss3/3 Communications on Stochastic Analysis Serials Publications Vol. 10, No. 3 (2016) 297-320 www.serialspublications.com KRAWTCHOUK-GRIFFITHS SYSTEMS I: MATRIX APPROACH PHILIP FEINSILVER Abstract. We call Krawtchouk-Griffiths systems, or KG-systems, systems of multivariate polynomials orthogonal with respect to corresponding multi- nomial distributions. The original Krawtchouk polynomials are orthogonal with respect to a binomial distribution. Our approach is to work directly with matrices comprising the values of the polynomials at points of a discrete grid based on the possible counting values of the underlying multinomial distribu- tion. The starting point for the construction of a KG-system is a generating matrix satisfying the K-condition, orthogonality with respect to the basic probability distribution associated to an individual step of the multinomial process. The variables of the polynomials corresponding to matrices may be interpreted as quantum observables in the real case, or quantum variables in the complex case. The structure of the recurrence relations for the orthog- onal polynomials is presented with multiplication operators as the matrices corresponding to the quantum variables. An interesting feature is that the associated random walks correspond to the Lie algebra of the representation of symmetric tensor powers of matrices.
    [Show full text]
  • Dimension-Free L2 Maximal Inequality for Spherical Means in the Hypercube
    THEORY OF COMPUTING, Volume 10 (3), 2014, pp. 55–75 www.theoryofcomputing.org SPECIAL ISSUE:ANALYSIS OF BOOLEAN FUNCTIONS Dimension-Free L2 Maximal Inequality for Spherical Means in the Hypercube Aram W. Harrow∗ Alexandra Kolla† Leonard J. Schulman‡ Received February 21, 2013; Revised November 12, 2013; Published May 23, 2014 Abstract: We establish the maximal inequality claimed in the title. In combinatorial terms this has the implication that for sufficiently small e > 0, for all n, any marking of an e fraction of the vertices of the n-dimensional hypercube necessarily leaves a vertex x such that marked vertices are a minority of every sphere centered at x. ACM Classification: G.3 AMS Classification: 42B25 Key words and phrases: maximal inequality, Fourier analysis, boolean hypercube 1 Introduction n n Let I be the n-dimensional hypercube: the set f0;1g equipped with Hamming metric d(x;y) = jfi : xi 6= yigj: n n Let V = RI be the vector space of real-valued functions on the hypercube. For x 2 I , let px denote the 1 evaluation map from V ! R defined by px f = f (x), for f 2 V. If A ⊆ Hom(V;V) (the vector space ∗Supported by NSF grants CCF-0916400 and CCF-1111382, DARPA QuEST contract FA9550-09-1-0044 and ARO contract W911NF-12-1-0486. Part of this work was done while working at the University of Washington. †Was at Microsoft Research at the beginning and during part of this work. ‡Supported by NSF grants CCF-0829909, CCF-1038578, CCF-1319745, and the NSF-supported Institute for Quantum Information and Matter.
    [Show full text]
  • Krawtchouk Polynomials and Krawtchouk Matrices
    Krawtchouk polynomials and Krawtchouk matrices Philip Feinsilver and Jerzy Kocik Department of Mathematics Southern Illinois University Carbondale, IL 62901 Abstract Krawtchouk matrices have as entries values of the Krawtchouk poly- nomials for nonnegative integer arguments. We show how they arise as condensed Sylvester-Hadamard matrices via a binary shuffling function. The underlying symmetric tensor algebra is then presented. To advertise the breadth and depth of the field of Krawtchouk poly- nomials/matrices through connections with various parts of mathematics, some topics that are being developed into a Krawtchouk Encyclopedia are listed in the concluding section. Interested folks are encouraged to visit the website http://chanoir.math.siu.edu/Kravchuk/index.html which is currently in a state of development. 1 What are Krawtchouk matrices Of Sylvester-Hadamard matrices and Krawtchouk matrices, the latter are less familiar, hence we start with them. Definition 1.1 The N th-order Krawtchouk matrix K(N) is an (N +1)×(N +1) matrix, the entries of which are determined by the expansion: N N−j j X i (N) (1 + v) (1 − v) = v Kij (1.1) i=0 Thus, the polynomial G(v) = (1 + v)N−j (1 − v)j is the generating function for the row entries of the jth column of K(N). Expanding gives the explicit values of the matrix entries: (N) X j N − j K = (−1)k . ij k i − k k where matrix indices run from 0 to N. 1 Here are the Krawtchouk matrices of order zero, one, and two: 1 1 1 1 1 K(0) = 1 K(1) = K(2) = 2 0 −2 1 −1 1 −1 1 The reader is invited to see more examples in Table 1 of the Appendix.
    [Show full text]
  • Mathematics Calendar
    Mathematics Calendar The most comprehensive and up-to-date Mathematics Calendar information is available on the AMS website at http://www.ams.org/mathcal/. September 2007 Call for Papers: Further information is available at: http://www. elsevier.com/wps/find/journaldescription.cws_home/ 3–6 38th Annual Iranian Mathematics Conference,ZanjanUni- 505613/authorinstructions/.To submit a paper, send an email versity, Zanjan, Iran. (Jun/Jul 2007, p. 778) to: [email protected]. Scientific Committee: F. Mirzapour (The head of conference), Important Dates: Submission of abstracts: March 31, 2007. Notifi- [email protected]; M. T. Dastjerdi (The head of scientific cation of acceptance: April 30, 2007. Full versions of the accepted committee of conference), [email protected]; E. S. Mahmoodian, presentations to be included in the Proceedings of the Conference: [email protected];M.Adib,[email protected];M.Ari- May 31, 2007. annejad, [email protected]; M. Emami, [email protected]. ac.ir; J. Malaki, [email protected];H.Mohebi,hmohbei@ Financial Support: Some financial support will be available from mail.uk.ac.ir; A. Rasooli, [email protected]; Sh.Rezapour, sh. the conference, to cover expenses of graduate students and post- [email protected]; S. Salehipourmehr, [email protected]. doctoral fellows. Applications should be sent electronically to the ir;S.Varsaie,[email protected]; R. Zarenahandi, rashidzn@ conference e-mail address: [email protected]. iasbs.ir. Information: Contact: email: [email protected]; http: Information: Contact: 6-Kilometer of Tabriz Road, Zanjan, IRAN, //www.math.upatras.gr/numan2007/.
    [Show full text]