|
Viennot's Geometric Construction
In mathematics, Viennot's geometric construction (named after Xavier Gérard Viennot) gives a diagrammatic interpretation of the Robinson–Schensted correspondence in terms of shadow lines. It has a generalization to the Robinson–Schensted–Knuth correspondence, which is known as the matrix-ball construction. The construction Starting with a permutation \sigma \in S_n , written in two-line notation, say: : \sigma = \begin 1 & 2 & \cdots & n \\ \sigma_1 & \sigma_2 & \cdots & \sigma_n \end, one can apply the Robinson–Schensted correspondence to this permutation, yielding two Young tableau, standard Young tableaux of the same shape, ''P'' and ''Q''. ''P'' is obtained by performing a sequence of insertions, and ''Q'' is the recording tableau, indicating in which order the boxes were filled. Viennot's construction starts by plotting the points (i, \sigma_i) in the plane, and imagining there is a light that shines from the origin, casting shadows straight up and to the ri ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Xavier Gérard Viennot
Xavier or Xabier may refer to: Place * Xavier, Spain People * Xavier (surname) * Xavier (given name) * Francis Xavier (1506–1552), Catholic saint ** St. Francis Xavier (other) * St. Xavier (other) * Xavier (footballer, born January 1980) (Anderson Conceição Xavier), Brazilian midfielder * Xavier (footballer, born March 1980) (José Xavier Costa), Brazilian left-back * Xavier (footballer, born 2000) (João Vitor Xavier de Almeida), Brazilian midfielder * Xavier (wrestler), American professional wrestler Arts and entertainment * ''Xavier: Renegade Angel'', an animated TV series * Xavier Institute, a fictional school in Marvel comics * Charles Xavier, Professor X, a fictional Marvel Comics character * "Xavier", a song by Casseurs Flowters from the 2015 soundtrack album ''Comment c'est loin (soundtrack), Comment c'est loin'' * "Xavier", a song by Dead Can Dance from the 1987 album ''Within the Realm of a Dying Sun'' Other uses * Xavier University, in Cincinnati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robinson–Schensted Correspondence
In mathematics, the Robinson–Schensted correspondence is a bijective correspondence between permutations and pairs of standard Young tableaux of the same shape. It has various descriptions, all of which are of algorithmic nature, it has many remarkable properties, and it has applications in combinatorics and other areas such as representation theory. The correspondence has been generalized in numerous ways, notably by Knuth to what is known as the Robinson–Schensted–Knuth correspondence, and a further generalization to pictures by Zelevinsky. The simplest description of the correspondence is using the Schensted algorithm , a procedure that constructs one tableau by successively inserting the values of the permutation according to a specific rule, while the other tableau records the evolution of the shape during construction. The correspondence had been described, in a rather different form, much earlier by Robinson , in an attempt to prove the Littlewood–Richardson rule. T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robinson–Schensted–Knuth Correspondence
In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijection between matrices with non-negative integer entries and pairs of semistandard Young tableaux of equal shape, whose size equals the sum of the entries of . More precisely the weight of is given by the column sums of , and the weight of by its row sums. It is a generalization of the Robinson–Schensted correspondence, in the sense that taking to be a permutation matrix, the pair will be the pair of standard tableaux associated to the permutation under the Robinson–Schensted correspondence. The Robinson–Schensted–Knuth correspondence extends many of the remarkable properties of the Robinson–Schensted correspondence, notably its symmetry: transposition of the matrix results in interchange of the tableaux . The Robinson–Schensted–Knuth correspondence Introduction The Robinson–Schensted correspondence is a bi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Permutation
In mathematics, a permutation of a set can mean one of two different things: * an arrangement of its members in a sequence or linear order, or * the act or process of changing the linear order of an ordered set. An example of the first meaning is the six permutations (orderings) of the set : written as tuples, they are (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). Anagrams of a word whose letters are all different are also permutations: the letters are already ordered in the original word, and the anagram reorders them. The study of permutations of finite sets is an important topic in combinatorics and group theory. Permutations are used in almost every branch of mathematics and in many other fields of science. In computer science, they are used for analyzing sorting algorithms; in quantum physics, for describing states of particles; and in biology, for describing RNA sequences. The number of permutations of distinct objects is factorial, us ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Two-line Notation
In mathematics, a permutation of a set can mean one of two different things: * an arrangement of its members in a sequence or linear order, or * the act or process of changing the linear order of an ordered set. An example of the first meaning is the six permutations (orderings) of the set : written as tuples, they are (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). Anagrams of a word whose letters are all different are also permutations: the letters are already ordered in the original word, and the anagram reorders them. The study of permutations of finite sets is an important topic in combinatorics and group theory. Permutations are used in almost every branch of mathematics and in many other fields of science. In computer science, they are used for analyzing sorting algorithms; in quantum physics, for describing states of particles; and in biology, for describing RNA sequences. The number of permutations of distinct objects is factorial, usuall ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Young Tableau
In mathematics, a Young tableau (; plural: tableaux) is a combinatorial object useful in representation theory and Schubert calculus. It provides a convenient way to describe the group representations of the symmetric and general linear groups and to study their properties. Young tableaux were introduced by Alfred Young, a mathematician at Cambridge University, in 1900. They were then applied to the study of the symmetric group by Georg Frobenius in 1903. Their theory was further developed by many mathematicians, including Percy MacMahon, W. V. D. Hodge, G. de B. Robinson, Gian-Carlo Rota, Alain Lascoux, Marcel-Paul Schützenberger and Richard P. Stanley. Definitions ''Note: this article uses the English convention for displaying Young diagrams and tableaux''. Diagrams A Young diagram (also called a Ferrers diagram, particularly when represented using dots) is a finite collection of boxes, or cells, arranged in left-justified rows, with the row lengths in non-incre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Plactic Monoid
In mathematics, the plactic monoid is the monoid of all words in the alphabet of positive integers modulo Knuth equivalence. Its elements can be identified with semistandard Young tableaux. It was discovered by (who called it the tableau algebra), using an operation given by in his study of the longest increasing subsequence of a permutation. It was named the "''monoïde plaxique''" by , who allowed any totally ordered alphabet in the definition. The etymology of the word "''plaxique''" is unclear; it may refer to plate tectonics ("tectonique des plaques" in French), as elementary relations that generate the equivalence allow conditional commutation of generator symbols: they can sometimes slide across each other (in apparent analogy to tectonic plates), but not freely. Definition The plactic monoid over some totally ordered alphabet (often the positive integers) is the monoid with the following presentation: *The generators are the letters of the alphabet *The relatio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jeu De Taquin
In the mathematical field of combinatorics, jeu de taquin is a construction due to which defines an equivalence relation on the set of skew standard Young tableaux. A jeu de taquin slide is a transformation where the numbers in a tableau are moved around in a way similar to how the pieces in the fifteen puzzle move. Two tableaux are jeu de taquin equivalent if one can be transformed into the other via a sequence of such slides. "Jeu de taquin" (literally "teasing game") is the French name for the fifteen puzzle. Definition of a jeu de taquin slide Given a skew standard Young tableau ''T'' of skew shape \lambda / \mu, pick an adjacent empty cell ''c'' that can be added to the skew diagram \lambda\setminus\mu; what this means is that ''c'' must share at least one edge with some cell in ''T'', and \ \cup \lambda\setminus\mu must also be a skew diagram. There are two kinds of slide, depending on whether ''c'' lies to the upper left of ''T'' or to the lower right. Suppose to be ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bruce Sagan
Bruce Eli Sagan (born March 29, 1954) is an American Professor of Mathematics at Michigan State University. He specializes in enumerative, algebraic, and topological combinatorics. He is also known as a musician, playing music from Scandinavia and the Balkans. Early life Sagan is the son of Eugene Benjamin Sagan and Arlene Kaufmann Sagan. He grew up in Berkeley, California. He started playing classical violin at a young age under the influence of his mother who was a music teacher and conductor. He received his B.S. in mathematics (1974) from California State University, East Bay (then called California State University, Hayward). He received his Ph.D. in mathematics (1979) from the Massachusetts Institute of Technology. His doctoral thesis "Partially Ordered Sets with Hooklengths – an Algorithmic Approach" was supervised by Richard P. Stanley. He was Stanley's third doctoral student. During his graduate school years he also joined and became music director of the Mandala F ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
