Generalised Ramsey numbers and Bruhat order on involutions PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Generalised Ramsey numbers and Bruhat order on involutions PDF full book. Access full book title Generalised Ramsey numbers and Bruhat order on involutions by Mikael Hansson. Download full books in PDF and EPUB format.
Author: Mikael Hansson
Publisher: Linköping University Electronic Press
ISBN: 9176858928
Category :
Languages : en
Pages : 29
Get Book Here
Book Description
This thesis consists of two papers within two different areas of combinatorics. Ramsey theory is a classic topic in graph theory, and Paper A deals with two of its most fundamental problems: to compute Ramsey numbers and to characterise critical graphs. More precisely, we study generalised Ramsey numbers for two sets ?1 and ?2 of cycles. We determine, in particular, all generalised Ramsey numbers R(?1, ?2) such that ?1 or ?2 contains a cycle of length at most 6, or the shortest cycle in each set is even. This generalises previous results of Erdös, Faudree, Rosta, Rousseau, and Schelp. Furthermore, we give a conjecture for the general case. We also characterise many (?1, ?2)-critical graphs. As special cases, we obtain complete characterisations of all (Cn,C3)-critical graphs for n ? 5, and all (Cn,C5)-critical graphs for n ? 6. In Paper B, we study the combinatorics of certain partially ordered sets. These posets are unions of conjugacy classes of involutions in the symmetric group Sn, with the order induced by the Bruhat order on Sn. We obtain a complete characterisation of the posets that are graded. In particular, we prove that the set of involutions with exactly one fixed point is graded, which settles a conjecture of Hultman in the affirmative. When the posets are graded, we give their rank functions. We also give a short, new proof of the EL-shellability of the set of fixed-point-free involutions, recently proved by Can, Cherniavsky, and Twelbeck.
Author: Mikael Hansson
Publisher: Linköping University Electronic Press
ISBN: 9176858928
Category :
Languages : en
Pages : 29
Get Book Here
Book Description
This thesis consists of two papers within two different areas of combinatorics. Ramsey theory is a classic topic in graph theory, and Paper A deals with two of its most fundamental problems: to compute Ramsey numbers and to characterise critical graphs. More precisely, we study generalised Ramsey numbers for two sets ?1 and ?2 of cycles. We determine, in particular, all generalised Ramsey numbers R(?1, ?2) such that ?1 or ?2 contains a cycle of length at most 6, or the shortest cycle in each set is even. This generalises previous results of Erdös, Faudree, Rosta, Rousseau, and Schelp. Furthermore, we give a conjecture for the general case. We also characterise many (?1, ?2)-critical graphs. As special cases, we obtain complete characterisations of all (Cn,C3)-critical graphs for n ? 5, and all (Cn,C5)-critical graphs for n ? 6. In Paper B, we study the combinatorics of certain partially ordered sets. These posets are unions of conjugacy classes of involutions in the symmetric group Sn, with the order induced by the Bruhat order on Sn. We obtain a complete characterisation of the posets that are graded. In particular, we prove that the set of involutions with exactly one fixed point is graded, which settles a conjecture of Hultman in the affirmative. When the posets are graded, we give their rank functions. We also give a short, new proof of the EL-shellability of the set of fixed-point-free involutions, recently proved by Can, Cherniavsky, and Twelbeck.
Author: Mikael Hansson
Publisher: Linköping University Electronic Press
ISBN: 9176853349
Category :
Languages : en
Pages : 46
Get Book Here
Book Description
This dissertation consists of three papers in combinatorial Coxeter group theory. A Coxeter group is a group W generated by a set S, where all relations can be derived from the relations s2 = e for all s ?? S, and (ss?)m(s,s?) = e for some pairs of generators s ? s? in S, where e ?? W is the identity element and m(s, s?) is an integer satisfying that m(s, s?) = m(s?, s) ? 2. Two prominent examples of Coxeter groups are provided by the symmetric group Sn (i.e., the set of permutations of {1, 2, . . . , n}) and finite reflection groups (i.e., finite groups generated by reflections in some real euclidean space). There are also important infinite Coxeter groups, e.g., affine reflection groups. Every Coxeter group can be equipped with various natural partial orders, the most important of which is the Bruhat order. Any subset of a Coxeter group can then be viewed as an induced subposet. In Paper A, we study certain posets of this kind, namely, unions of conjugacy classes of involutions in the symmetric group. We obtain a complete classification of the posets that are pure (i.e., all maximal chains have the same length). In particular, we prove that the set of involutions with exactly one fixed point is pure, which settles a conjecture of Hultman in the affirmative. When the posets are pure, we give their rank functions. We also give a short, new proof of the EL-shellability of the set of fixed-point-free involutions, established by Can, Cherniavsky, and Twelbeck. Paper B also deals with involutions in Coxeter groups. Given an involutive automorphism ? of a Coxeter system (W, S), let ?(?) = {w ?? W | ?(w) = w?1} be the set of twisted involutions. In particular, ?(id) is the set of ordinary involutions in W. It is known that twisted involutions can be represented by words in the alphabet = { | s ?? S}, called -expressions. If ss? has finite order m(s, s?), let a braid move be the replacement of ? ? by ? ? ?, both consisting of m(s, s?) letters. We prove a word property for ?(?), for any Coxeter system (W, S) with any ?. More precisely, we provide a minimal set of moves, easily determined from the Coxeter graph of (W, S), that can be added to the braid moves in order to connect all reduced -expressions for any given w ?? ?(?). This improves upon a result of Hamaker, Marberg, and Pawlowski, and generalises similar statements valid in certain types due to Hu, Zhang, Wu, and Marberg. In Paper C, we investigate the topology of (the order complexes of) certain posets, called pircons. A special partial matching (SPM) on a poset is a matching of the Hasse diagram satisfying certain extra conditions. An SPM without fixed points is precisely a special matching as defined by Brenti. Let a pircon be a poset in which every non-trivial principal order ideal is finite and admits an SPM. Thus pircons generalise Marietti’s zircons. Our main result is that every open interval in a pircon is a PL ball or a PL sphere. An important subset of ?(?) is the set ??(?) = {?(w?1)w | w ?? W} of twisted identities. We prove that if ? does not flip any edges with odd labels in the Coxeter graph, then ??(?), with the order induced by the Bruhat order on W, is a pircon. Hence, its open intervals are PL balls or spheres, which confirms a conjecture of Hultman. It is also demonstrated that Bruhat orders on Rains and Vazirani’s quasiparabolic W-sets (under a boundedness assumption) form pircons. In particular, this applies to all parabolic quotients of Coxeter groups.
Author: Terence Tao
Publisher: American Mathematical Soc.
ISBN: 1470421968
Category : Mathematics
Languages : en
Pages : 319
Get Book Here
Book Description
Expander graphs are an important tool in theoretical computer science, geometric group theory, probability, and number theory. Furthermore, the techniques used to rigorously establish the expansion property of a graph draw from such diverse areas of mathematics as representation theory, algebraic geometry, and arithmetic combinatorics. This text focuses on the latter topic in the important case of Cayley graphs on finite groups of Lie type, developing tools such as Kazhdan's property (T), quasirandomness, product estimates, escape from subvarieties, and the Balog-Szemerédi-Gowers lemma. Applications to the affine sieve of Bourgain, Gamburd, and Sarnak are also given. The material is largely self-contained, with additional sections on the general theory of expanders, spectral theory, Lie theory, and the Lang-Weil bound, as well as numerous exercises and other optional material.
Author: Zhaobing Fan
Publisher: American Mathematical Soc.
ISBN: 1470441756
Category : Mathematics
Languages : en
Pages : 123
Get Book Here
Book Description
The quantum groups of finite and affine type $A$ admit geometric realizations in terms of partial flag varieties of finite and affine type $A$. Recently, the quantum group associated to partial flag varieties of finite type $B/C$ is shown to be a coideal subalgebra of the quantum group of finite type $A$.
Author: Michael Baake
Publisher: Cambridge University Press
ISBN: 1108514499
Category : Mathematics
Languages : en
Pages : 408
Get Book Here
Book Description
Quasicrystals are non-periodic solids that were discovered in 1982 by Dan Shechtman, Nobel Prize Laureate in Chemistry 2011. The mathematics that underlies this discovery or that proceeded from it, known as the theory of Aperiodic Order, is the subject of this comprehensive multi-volume series. This second volume begins to develop the theory in more depth. A collection of leading experts, among them Robert V. Moody, cover various aspects of crystallography, generalising appropriately from the classical case to the setting of aperiodically ordered structures. A strong focus is placed upon almost periodicity, a central concept of crystallography that captures the coherent repetition of local motifs or patterns, and its close links to Fourier analysis. The book opens with a foreword by Jeffrey C. Lagarias on the wider mathematical perspective and closes with an epilogue on the emergence of quasicrystals, written by Peter Kramer, one of the founders of the field.
Author: Joel Friedman
Publisher: American Mathematical Soc.
ISBN: 1470409887
Category : Mathematics
Languages : en
Pages : 124
Get Book Here
Book Description
In this paper the author establishes some foundations regarding sheaves of vector spaces on graphs and their invariants, such as homology groups and their limits. He then uses these ideas to prove the Hanna Neumann Conjecture of the 1950s; in fact, he proves a strengthened form of the conjecture.
Author: Michel Marie Deza
Publisher: Springer
ISBN: 3662443422
Category : Mathematics
Languages : en
Pages : 731
Get Book Here
Book Description
This updated and revised third edition of the leading reference volume on distance metrics includes new items from very active research areas in the use of distances and metrics such as geometry, graph theory, probability theory and analysis. Among the new topics included are, for example, polyhedral metric space, nearness matrix problems, distances between belief assignments, distance-related animal settings, diamond-cutting distances, natural units of length, Heidegger’s de-severance distance, and brain distances. The publication of this volume coincides with intensifying research efforts into metric spaces and especially distance design for applications. Accurate metrics have become a crucial goal in computational biology, image analysis, speech recognition and information retrieval. Leaving aside the practical questions that arise during the selection of a ‘good’ distance function, this work focuses on providing the research community with an invaluable comprehensive listing of the main available distances. As well as providing standalone introductions and definitions, the encyclopedia facilitates swift cross-referencing with easily navigable bold-faced textual links to core entries. In addition to distances themselves, the authors have collated numerous fascinating curiosities in their Who’s Who of metrics, including distance-related notions and paradigms that enable applied mathematicians in other sectors to deploy research tools that non-specialists justly view as arcane. In expanding access to these techniques, and in many cases enriching the context of distances themselves, this peerless volume is certain to stimulate fresh research.
Author: Ronald E Mickens
Publisher: World Scientific
ISBN: 981122255X
Category : Mathematics
Languages : en
Pages : 332
Get Book Here
Book Description
This second edition of Nonstandard Finite Difference Models of Differential Equations provides an update on the progress made in both the theory and application of the NSFD methodology during the past two and a half decades. In addition to discussing details related to the determination of the denominator functions and the nonlocal discrete representations of functions of dependent variables, we include many examples illustrating just how this should be done.Of real value to the reader is the inclusion of a chapter listing many exact difference schemes, and a chapter giving NSFD schemes from the research literature. The book emphasizes the critical roles played by the 'principle of dynamic consistency' and the use of sub-equations for the construction of valid NSFD discretizations of differential equations.
Author: Bruce van Brunt
Publisher: Springer Science & Business Media
ISBN: 0387216979
Category : Mathematics
Languages : en
Pages : 295
Get Book Here
Book Description
Suitable for advanced undergraduate and graduate students of mathematics, physics, or engineering, this introduction to the calculus of variations focuses on variational problems involving one independent variable. It also discusses more advanced topics such as the inverse problem, eigenvalue problems, and Noether’s theorem. The text includes numerous examples along with problems to help students consolidate the material.
Author: Sirakov Boyan
Publisher: World Scientific
ISBN: 9813272899
Category : Mathematics
Languages : en
Pages : 5396
Get Book Here
Book Description
The Proceedings of the ICM publishes the talks, by invited speakers, at the conference organized by the International Mathematical Union every 4 years. It covers several areas of Mathematics and it includes the Fields Medal and Nevanlinna, Gauss and Leelavati Prizes and the Chern Medal laudatios.
