Some Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley
|
|
- Curtis Strickland
- 5 years ago
- Views:
Transcription
1 Some Catalan Musings p. 1 Some Catalan Musings Richard P. Stanley
2 Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,...
3 Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,... COMMENTS.... This is probably the longest entry in OEIS, and rightly so.
4 Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,... COMMENTS.... This is probably the longest entry in OEIS, and rightly so. C n = 1 n+1( 2n n), n 0 (Catalan number)
5 Some Catalan Musings p. 3 Catalan monograph R. Stanley, Catalan Numbers, Cambridge University Press, 2015, to appear.
6 Some Catalan Musings p. 3 Catalan monograph R. Stanley, Catalan Numbers, Cambridge University Press, 2015, to appear. Includes 214 combinatorial interpretations of C n and 68 additional problems.
7 An early version (1970 s) Some Catalan Musings p. 4
8 An early version (1970 s) Some Catalan Musings p. 4
9 Some Catalan Musings p. 5
10 Some Catalan Musings p. 6 How to sample? Compare D. E. Knuth, 3:16 Bible Texts Illuminated. Sample from Bible by choosing verse 3:16 from each chapter.
11 Some Catalan Musings p. 6 How to sample? Compare D. E. Knuth, 3:16 Bible Texts Illuminated. Sample from Bible by choosing verse 3:16 from each chapter. I will be less random.
12 Some Catalan Musings p. 7 History Sharabiin Myangat, also known as Minggatu, Ming antu ( ), and Jing An (c c. 1763): a Mongolian astronomer, mathematician, and topographic scientist who worked at the Qing court in China.
13 Some Catalan Musings p. 7 History Sharabiin Myangat, also known as Minggatu, Ming antu ( ), and Jing An (c c. 1763): a Mongolian astronomer, mathematician, and topographic scientist who worked at the Qing court in China. Typical result (1730 s): sin(2α) = 2sinα n=1 C n 1 4 n 1 sin2n+1 α
14 Some Catalan Musings p. 7 History Sharabiin Myangat, also known as Minggatu, Ming antu ( ), and Jing An (c c. 1763): a Mongolian astronomer, mathematician, and topographic scientist who worked at the Qing court in China. Typical result (1730 s): sin(2α) = 2sinα n=1 C n 1 4 n 1 sin2n+1 α No combinatorics, no further work in China.
15 Some Catalan Musings p. 8 More history, via Igor Pak Euler (1751): conjectured formula for number C n of triangulations of a convex (n+2)-gon
16 Some Catalan Musings p. 9 Completion of proof Goldbach and Segner ( ): helped Euler complete the proof, in pieces. Lamé (1838): first self-contained, complete proof.
17 Some Catalan Musings p. 10 Catalan Eugène Charles Catalan (1838): wrote C n in the form and showed they counted (2n)! n!(n+1)! (nonassociative) bracketings (or parenthesizations) of a string of n + 1 letters.
18 Some Catalan Musings p. 10 Catalan Eugène Charles Catalan (1838): wrote C n in the form and showed they counted (2n)! n!(n+1)! (nonassociative) bracketings (or parenthesizations) of a string of n + 1 letters. Born in 1814 in Bruges (now in Belgium, then under Dutch rule). Studied in France and worked in France and Liège, Belgium. Died in Liège in 1894.
19 Some Catalan Musings p. 11 Why Catalan numbers? Riordan (1948): introduced the term Catalan number in Math Reviews.
20 Some Catalan Musings p. 11 Why Catalan numbers? Riordan (1948): introduced the term Catalan number in Math Reviews. Riordan (1964): used the term again in Math. Reviews.
21 Some Catalan Musings p. 11 Why Catalan numbers? Riordan (1948): introduced the term Catalan number in Math Reviews. Riordan (1964): used the term again in Math. Reviews. Riordan (1968): used the term in his book Combinatorial Identities. Finally caught on.
22 Some Catalan Musings p. 11 Why Catalan numbers? Riordan (1948): introduced the term Catalan number in Math Reviews. Riordan (1964): used the term again in Math. Reviews. Riordan (1968): used the term in his book Combinatorial Identities. Finally caught on. Gardner (1976): used the term in his Mathematical Games column in Scientific American. Real popularity began.
23 Some Catalan Musings p. 12 The primary recurrence C n+1 = n k=0 C k C n k, C 0 = 1
24 Some Catalan Musings p. 12 The primary recurrence C n+1 = n k=0 C k C n k, C 0 = 1 e
25 Some Catalan Musings p. 13 Transparent interpretations 3. Binary parenthesizations or bracketings of a string of n+1 letters (xx x)x x(xx x) (x xx)x x(x xx) xx xx
26 Some Catalan Musings p. 13 Transparent interpretations 3. Binary parenthesizations or bracketings of a string of n+1 letters (xx x)x x(xx x) (x xx)x x(x xx) xx xx ((x(xx))x)(x(xx)(xx))
27 Some Catalan Musings p. 13 Transparent interpretations 3. Binary parenthesizations or bracketings of a string of n+1 letters (xx x)x x(xx x) (x xx)x x(x xx) xx xx ((x(xx))x)(x(xx)(xx))
28 Some Catalan Musings p. 14 Binary trees 4. Binary trees with n vertices
29 Some Catalan Musings p. 14 Binary trees 4. Binary trees with n vertices
30 Some Catalan Musings p. 14 Binary trees 4. Binary trees with n vertices
31 Some Catalan Musings p. 15 Plane trees Plane tree: subtrees of a vertex are linearly ordered 6. Plane trees with n + 1 vertices
32 Plane tree recurrence Some Catalan Musings p. 16
33 Plane tree recurrence Some Catalan Musings p. 16
34 Some Catalan Musings p. 17 The natural bijection a a b c a b c d b d e f g d e f g h e c h i j h i j i f j g
35 Some Catalan Musings p. 18 Dyck paths 25. Dyck paths of length 2n, i.e., lattice paths from (0, 0) to (2n, 0) with steps (1, 1) and (1, 1), never falling below the x-axis
36 Some Catalan Musings p. 18 Dyck paths 25. Dyck paths of length 2n, i.e., lattice paths from (0, 0) to (2n, 0) with steps (1, 1) and (1, 1), never falling below the x-axis
37 Some Catalan Musings p. 18 Dyck paths 25. Dyck paths of length 2n, i.e., lattice paths from (0, 0) to (2n, 0) with steps (1, 1) and (1, 1), never falling below the x-axis
38 Some Catalan Musings p avoiding permutations 116. Permutations a 1 a 2 a n of 1,2,...,n for which there does not exist i < j < k and a j < a k < a i (called 312-avoiding) permutations)
39 Some Catalan Musings p avoiding permutations 116. Permutations a 1 a 2 a n of 1,2,...,n for which there does not exist i < j < k and a j < a k < a i (called 312-avoiding) permutations)
40 Some Catalan Musings p avoiding permutations 116. Permutations a 1 a 2 a n of 1,2,...,n for which there does not exist i < j < k and a j < a k < a i (called 312-avoiding) permutations)
41 Some Catalan Musings p. 20 Less transparent interpretations 159. Noncrossing partitions of 1, 2,..., n, i.e., partitions π = {B 1,...,B k } Π n such that if a < b < c < d and a,c B i and b,d B j, then i = j
42 Bijection with plane trees Some Catalan Musings p. 21
43 Some Catalan Musings p. 21 Bijection with plane trees
44 Some Catalan Musings p. 21 Bijection with plane trees Children of nonleaf vertices: {1,5,6}, {2},{3,4},{7,9},{8},{10,11,12}
45 Some Catalan Musings p. 22 Noncrossing partition recurrence
46 Some Catalan Musings p. 22 Noncrossing partition recurrence
47 Some Catalan Musings p avoiding permutations 115. Permutations a 1 a 2 a n of 1,2,...,n with longest decreasing subsequence of length at most two (i.e., there does not exist i < j < k, a i > a j > a k ), called 321-avoiding permutations
48 Some Catalan Musings p. 24 Bijection with Dyck paths w =
49 Some Catalan Musings p. 24 Bijection with Dyck paths w =
50 Some Catalan Musings p. 24 Bijection with Dyck paths w =
51 Some Catalan Musings p. 25 Semiorders (finite) semiorder or unit interval order: a finite subset P of R with the partial order: x < P y x < R y 1 Equivalently, no induced (3 + 1) or (2 + 2)
52 Some Catalan Musings p. 26 Semiorders (cont.) 180. Nonisomorphic n-element posets with no induced subposet isomorphic to or 3 + 1
53 Some Catalan Musings p. 27 Semiorders and Dyck paths
54 Some Catalan Musings p. 27 Semiorders and Dyck paths x x x x x x x x x x
55 Some Catalan Musings p. 27 Semiorders and Dyck paths x x x x x x x x x x
56 Some Catalan Musings p. 28 Noncrossing matchings 61. Noncrossing (complete) matchings on 2n vertices, i.e., ways of connecting 2n points in the plane lying on a horizontal line by n nonintersecting arcs, each arc connecting two of the points and lying above the points
57 Bijection to ballot sequences Some Catalan Musings p. 29
58 Some Catalan Musings p. 29 Bijection to ballot sequences left endpoint: 1 right endpoint: 1
59 Some Catalan Musings p. 30 Inverse bijection
60 Some Catalan Musings p. 30 Inverse bijection Scan ballot sequence from right-to-left. Connect each 1 with leftmost available 1.
61 Some Catalan Musings p. 30 Inverse bijection Scan ballot sequence from right-to-left. Connect each 1 with leftmost available 1.
62 Some Catalan Musings p. 30 Inverse bijection Scan ballot sequence from right-to-left. Connect each 1 with leftmost available 1.
63 Some Catalan Musings p. 30 Inverse bijection Scan ballot sequence from right-to-left. Connect each 1 with leftmost available 1.
64 Some Catalan Musings p. 30 Inverse bijection Scan ballot sequence from right-to-left. Connect each 1 with leftmost available 1.
65 Some Catalan Musings p. 30 Inverse bijection Scan ballot sequence from right-to-left. Connect each 1 with leftmost available 1.
66 Some Catalan Musings p. 31 Nonnesting matchings 64. Nonnesting matchings on [2n], i.e., ways of connecting 2n points in the plane lying on a horizontal line by n arcs, each arc connecting two of the points and lying above the points, such that no arc is contained entirely below another
67 Bijection to ballot sequences Some Catalan Musings p. 32
68 Some Catalan Musings p. 32 Bijection to ballot sequences left endpoint: 1 right endpoint: 1
69 Some Catalan Musings p. 32 Bijection to ballot sequences left endpoint: 1 right endpoint: 1 Same rule as for noncrossing matchings!
70 Some Catalan Musings p. 33 Inverse bijection
71 Some Catalan Musings p. 33 Inverse bijection Scan ballot sequence from right-to-left. Connect each 1 with rightmost available 1.
72 Some Catalan Musings p. 33 Inverse bijection Scan ballot sequence from right-to-left. Connect each 1 with rightmost available 1.
73 Some Catalan Musings p. 33 Inverse bijection Scan ballot sequence from right-to-left. Connect each 1 with rightmost available 1.
74 Some Catalan Musings p. 33 Inverse bijection Scan ballot sequence from right-to-left. Connect each 1 with rightmost available 1.
75 Some Catalan Musings p. 33 Inverse bijection Scan ballot sequence from right-to-left. Connect each 1 with rightmost available 1.
76 Some Catalan Musings p. 33 Inverse bijection Scan ballot sequence from right-to-left. Connect each 1 with rightmost available 1.
77 Some Catalan Musings p. 34 Many interpretations By changing the connection rule from the 1 s to 1 s, we get infinitely many combinatorial interpretations of Catalan numbers in terms of complete matchings. All have the same bijection rule from the matchings to the ballot sequences!
78 Some Catalan Musings p. 34 Many interpretations By changing the connection rule from the 1 s to 1 s, we get infinitely many combinatorial interpretations of Catalan numbers in terms of complete matchings. All have the same bijection rule from the matchings to the ballot sequences!
79 Some Catalan Musings p. 35 Unexpected interpretations 92. n-tuples (a 1,a 2,...,a n ) of integers a i 2 such that in the sequence 1a 1 a 2 a n 1, each a i divides the sum of its two neighbors
80 Some Catalan Musings p. 35 Unexpected interpretations 92. n-tuples (a 1,a 2,...,a n ) of integers a i 2 such that in the sequence 1a 1 a 2 a n 1, each a i divides the sum of its two neighbors
81 Some Catalan Musings p. 35 Unexpected interpretations 92. n-tuples (a 1,a 2,...,a n ) of integers a i 2 such that in the sequence 1a 1 a 2 a n 1, each a i divides the sum of its two neighbors
82 Some Catalan Musings p. 35 Unexpected interpretations 92. n-tuples (a 1,a 2,...,a n ) of integers a i 2 such that in the sequence 1a 1 a 2 a n 1, each a i divides the sum of its two neighbors
83 Some Catalan Musings p. 35 Unexpected interpretations 92. n-tuples (a 1,a 2,...,a n ) of integers a i 2 such that in the sequence 1a 1 a 2 a n 1, each a i divides the sum of its two neighbors
84 Some Catalan Musings p. 35 Unexpected interpretations 92. n-tuples (a 1,a 2,...,a n ) of integers a i 2 such that in the sequence 1a 1 a 2 a n 1, each a i divides the sum of its two neighbors
85 Some Catalan Musings p. 35 Unexpected interpretations 92. n-tuples (a 1,a 2,...,a n ) of integers a i 2 such that in the sequence 1a 1 a 2 a n 1, each a i divides the sum of its two neighbors UDUUDDUD
86 Some Catalan Musings p. 36 Cores hook lengths of a partition λ p-core: a partition with no hook lengths equal to (equivalently, divisible by) p (p,q)-core: a partition that is simultaneously a p-core and q-core
87 Some Catalan Musings p. 37 (n,n + 1)-cores 112. Integer partitions that are both n-cores and (n+1)-cores
88 Some Catalan Musings p. 38 Constructing (5,6)-cores 6 5
89 Some Catalan Musings p. 38 Constructing (5,6)-cores
90 Some Catalan Musings p. 38 Constructing (5,6)-cores
91 Some Catalan Musings p. 38 Constructing (5,6)-cores
92 Some Catalan Musings p. 38 Constructing (5,6)-cores
93 Some Catalan Musings p. 39 (4,3,1,1,1,1) is a (5,6)-core
94 Some Catalan Musings p. 40 Inversions of permutations inversion of a 1 a 2 a n S n : (a i,a j ) such that i < j, a i > a j
95 Some Catalan Musings p. 40 Inversions of permutations inversion of a 1 a 2 a n S n : (a i,a j ) such that i < j, a i > a j 186. Sets S of n non-identity permutations in S n+1 such that every pair (i,j) with 1 i < j n is an inversion of exactly one permutation in S {1243, 2134, 3412},{1324, 2314, 4123},{2134, 3124, 4123} {1324, 1423, 2341},{1243, 1342, 2341}
96 Some Catalan Musings p. 40 Inversions of permutations inversion of a 1 a 2 a n S n : (a i,a j ) such that i < j, a i > a j 186. Sets S of n non-identity permutations in S n+1 such that every pair (i,j) with 1 i < j n is an inversion of exactly one permutation in S {1243, 2134, 3412},{1324, 2314, 4123},{2134, 3124, 4123} {1324, 1423, 2341},{1243, 1342, 2341} due to R. Dewji, I. Dimitrov, A. McCabe, M. Roth, D. Wehlau, J. Wilson
97 Some Catalan Musings p. 41 A8. Algebraic interpretations (a) Number of two-sided ideals of the algebra of all (n 1) (n 1) upper triangular matrices over a field
98 Some Catalan Musings p. 41 A8. Algebraic interpretations (a) Number of two-sided ideals of the algebra of all (n 1) (n 1) upper triangular matrices over a field 0 * * * * * * * * * * * * * * * * * * * * *
99 Some Catalan Musings p. 42 Quasisymmetric functions Quasisymmetric function: a polynomial f Q[x 1,...,x n ] such that if i 1 < < i n then [x a 1 i 1 x a n i n ]f = [x a 1 1 xa n n ]f.
100 Some Catalan Musings p. 42 Quasisymmetric functions Quasisymmetric function: a polynomial f Q[x 1,...,x n ] such that if i 1 < < i n then [x a 1 i 1 x a n i n ]f = [x a 1 1 xa n n ]f. (k) Dimension (as a Q-vector space) of the ring Q[x 1,...,x n ]/Q n, where Q n denotes the ideal of Q[x 1,...,x n ] generated by all quasisymmetric functions in the variables x 1,...,x n with 0 constant term
101 Some Catalan Musings p. 42 Quasisymmetric functions Quasisymmetric function: a polynomial f Q[x 1,...,x n ] such that if i 1 < < i n then [x a 1 i 1 x a n i n ]f = [x a 1 1 xa n n ]f. (k) Dimension (as a Q-vector space) of the ring Q[x 1,...,x n ]/Q n, where Q n denotes the ideal of Q[x 1,...,x n ] generated by all quasisymmetric functions in the variables x 1,...,x n with 0 constant term Difficult proof by J.-C. Aval, F. Bergeron and N. Bergeron, 2004.
102 Some Catalan Musings p. 43 Diagonal harmonics (i) Let the symmetric group S n act on the polynomial ring A = C[x 1,...,x n,y 1,...,y n ] by w f(x 1,...,x n,y 1,...,y n ) = f(x w(1),...,x w(n),y w(1),...,y w(n) ) for all w S n. Let I be the ideal generated by all invariants of positive degree, i.e., I = f A : w f = f for all w S n, and f(0) = 0.
103 Some Catalan Musings p. 44 Diagonal harmonics (cont.) Then C n is the dimension of the subspace of A/I affording the sign representation, i.e., C n = dim{f A/I : w f = (sgnw)f for all w S n }.
104 Some Catalan Musings p. 44 Diagonal harmonics (cont.) Then C n is the dimension of the subspace of A/I affording the sign representation, i.e., C n = dim{f A/I : w f = (sgnw)f for all w S n }. Very deep proof by M. Haiman, 1994.
105 Some Catalan Musings p. 45 Generalizations & refinements A12. k-triangulation of n-gon: maximal collections of diagonals such that no k +1 of them pairwise intersect in their interiors k = 1: an ordinary triangulation superfluous edge: an edge between vertices at most k steps apart (along the boundary of the n-gon). They appear in all k-triangulations and are irrelevant.
106 Some Catalan Musings p. 46 An example Example. 2-triangulations of a hexagon (superfluous edges omitted):
107 Some Catalan Musings p. 47 Some theorems Theorem (Nakamigawa, Dress-Koolen-Moulton). All k-triangulations of an n-gon have k(n 2k 1) nonsuperfluous edges.
108 Some Catalan Musings p. 47 Some theorems Theorem (Nakamigawa, Dress-Koolen-Moulton). All k-triangulations of an n-gon have k(n 2k 1) nonsuperfluous edges. Theorem (Jonsson, Serrano-Stump). The number T k (n) of k-triangulations of an n-gon is given by T k (n) = det[c n i j ] k i,j=1 2k +i+j 1 =. i+j 1 1 i<j n 2k
109 Some Catalan Musings p. 48 Representation theory? Note. The number T k (n) is the dimension of an irreducible representation of the symplectic group Sp(2n 4).
110 Some Catalan Musings p. 48 Representation theory? Note. The number T k (n) is the dimension of an irreducible representation of the symplectic group Sp(2n 4). Is there a direct connection?
111 Some Catalan Musings p. 49 Number theory A61. Let b(n) denote the number of 1 s in the binary expansion of n. Using Kummer s theorem on binomial coefficients modulo a prime power, show that the exponent of the largest power of 2 dividing C n is equal to b(n+1) 1.
112 Some Catalan Musings p. 50 Sums of three squares Let f(n) denote the number of integers 1 k n such that k is the sum of three squares (of nonnegative integers). Well-known: lim n f(n) n = 5 6.
113 Sums of three squares Let f(n) denote the number of integers 1 k n such that k is the sum of three squares (of nonnegative integers). Well-known: lim n f(n) n = 5 6. Let g(n) denote the number of integers 1 k n such that C k is the sum of three squares. Then lim n g(n) n =??. Some Catalan Musings p. 50
114 Sums of three squares Let f(n) denote the number of integers 1 k n such that k is the sum of three squares (of nonnegative integers). Well-known: lim n f(n) n = 5 6. A63. Let g(n) denote the number of integers 1 k n such that C k is the sum of three squares. Then lim n g(n) n = 7 8. Some Catalan Musings p. 50
115 Some Catalan Musings p. 51 Analysis A65.(b) n 0 1 C n =??
116 Some Catalan Musings p. 51 Analysis A65.(b) n 0 1 = π C n 27.
117 Some Catalan Musings p. 52 Why? A65.(a) n 0 x n = 2(x+8) C n (4 x) + 24 ( xsin 1 1 ) 2 x. 2 (4 x) 5/2
118 Some Catalan Musings p. 52 Why? A65.(a) n 0 x n = 2(x+8) C n (4 x) + 24 ( xsin 1 1 ) 2 x. 2 (4 x) 5/2 Consequence of 2 ( sin 1 x ) 2 = 2 n 1 x 2n n 2( 2n n ).
119 Some Catalan Musings p. 52 Why? A65.(a) n 0 x n = 2(x+8) C n (4 x) + 24 ( xsin 1 1 ) 2 x. 2 (4 x) 5/2 Consequence of 2 ( sin 1 x ) 2 = 2 n 1 n 0 4 3n C n = 2. x 2n n 2( 2n n ).
120 An outlier Euler (1737): e = Convergents: 1,3, 19 7, ,... Some Catalan Musings p. 53
121 Some Catalan Musings p. 54 A curious generating function a n : numerator of the nth convergent a 1 = 1, a 2 = 3, a 3 = 19, a 4 = 193
122 Some Catalan Musings p. 54 A curious generating function a n : numerator of the nth convergent a 1 = 1, a 2 = 3, a 3 = 19, a 4 = n 1 a n x n n! = exp m 0 C m x m+1
123 The last slide Some Catalan Musings p. 55
124 The last slide Some Catalan Musings p. 55
125 The last slide Some Catalan Musings p. 55
126 The last slide Some Catalan Musings p. 55
Some Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley
Some Catalan Musings p. 1 Some Catalan Musings Richard P. Stanley Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,... Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,...
More informationCatalan Numbers. Richard P. Stanley. June 9, 2017
Catalan Numbers Richard P. Stanley June 9, 2017 An OEIS entry OEIS: Online Encylopedia of Integer Sequences (Neil Sloane). See http://oeis.org. A database of over 270,000 sequences of integers. An OEIS
More informationCatalan numbers Wonders of Science CESCI, Madurai, August
Catalan numbers Wonders of Science CESCI, Madurai, August 25 2009 V.S. Sunder Institute of Mathematical Sciences Chennai, India sunder@imsc.res.in August 25, 2009 Enumerative combinatorics Enumerative
More informationRational Catalan Combinatorics
Rational Catalan Combinatorics Eugene Gorsky UC Davis Bay Area Discrete Math Day October 17, 2015 Counting Dyck paths Catalan numbers The Catalan number is the number of Dyck paths, that is, lattice paths
More informationOn Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers
A tal given at the Institute of Mathematics, Academia Sinica (Taiwan (Taipei; July 6, 2011 On Arithmetic Properties of Bell Numbers, Delannoy Numbers and Schröder Numbers Zhi-Wei Sun Nanjing University
More informationarithmetic properties of weighted catalan numbers
arithmetic properties of weighted catalan numbers Jason Chen Mentor: Dmitry Kubrak May 20, 2017 MIT PRIMES Conference background: catalan numbers Definition The Catalan numbers are the sequence of integers
More informationSequences that satisfy a(n a(n)) = 0
Sequences that satisfy a(n a(n)) = 0 Nate Kube Frank Ruskey October 13, 2005 Abstract We explore the properties of some sequences for which a(n a(n)) = 0. Under the natural restriction that a(n) < n the
More informationLARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS
Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1229 1240 http://dx.doi.org/10.4134/bkms.2014.51.4.1229 LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS Su Hyung An, Sen-Peng Eu, and Sangwook Kim Abstract.
More informationRational Catalan Combinatorics: Intro
Rational Catalan Combinatorics: Intro Vic Reiner Univ. of Minnesota reiner@math.umn.edu AIM workshop Dec. 17-21, 2012 Goals of the workshop 1 Reinforce existing connections and forge new connections between
More informationEnumerative Combinatorics with Fillings of Polyominoes
Enumerative Combinatorics with Fillings of Polyominoes Catherine Yan Texas A&M Univesrity GSU, October, 204 2 Outline. Symmetry of the longest chains Subsequences in permutations and words Crossings and
More informationCombinatorics of non-associative binary operations
Combinatorics of non-associative binary operations Jia Huang University of Nebraska at Kearney E-mail address: huangj2@unk.edu December 26, 2017 This is joint work with Nickolas Hein (Benedictine College),
More informationEnumerative Combinatorics with Fillings of Polyominoes
Enumerative Combinatorics with Fillings of Polyominoes Catherine Yan Texas A&M University Tulane, March 205 Tulane, March 205 2 Outline. Symmetry of the longest chains Subsequences in permutations and
More informationA Survey of Parking Functions
A Survey of Parking Functions Richard P. Stanley M.I.T. Parking functions... n 2 1... a a a 1 2 n Car C i prefers space a i. If a i is occupied, then C i takes the next available space. We call (a 1,...,a
More informationarxiv:math/ v1 [math.co] 6 Oct 2006
A BIJECTION BETWEEN -TRIANGULATIONS AND PAIRS OF NON-CROSSING DYCK PATHS arxiv:math/00v math.co Oct 00 SERGI ELIZALDE Abstract A k-triangulation of a convex polygon is a maximal set of diagonals so that
More informationENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP. Igor Pak Harvard University
ENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP Igor Pak Harvard University E-mail: pak@math.harvard.edu Alexander Postnikov Massachusetts Institute of Technology E-mail: apost@math.mit.edu
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationare the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).
Lecture A jacques@ucsd.edu Notation: N, R, Z, F, C naturals, reals, integers, a field, complex numbers. p(n), S n,, b(n), s n, partition numbers, Stirling of the second ind, Bell numbers, Stirling of the
More informationCATALAN ADDENDUM. Richard P. Stanley. version of 30 December 2009
CATALAN ADDENDUM Richard P. Stanley version of 30 December 009 The problems below are a continuation of those appearing in Chapter 6 of Enumerative Combinatorics, volume. Combinatorial interpretations
More informationMa/CS 6a Class 24: More Generating Functions
Ma/CS 6a Class 24: More Generating Functions Road signs from http://www.math.ucla.edu/~pak/ By Adam Sheffer Reminder: Generating Functions Given an infinite sequence of numbers a 0, a 1, a 2, the generating
More informationMULTI-ORDERED POSETS. Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A06 MULTI-ORDERED POSETS Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States lbishop@oxy.edu
More informationFinding parking when not commuting. Jon McCammond U.C. Santa Barbara
Finding parking when not commuting 7 6 8 1 2 3 5 4 {{1,4,5}, {2,3}, {6,8}, {7}} Jon McCammond U.C. Santa Barbara 1 A common structure The main goal of this talk will be to introduce you to a mathematical
More informationFinding parking when not commuting. Jon McCammond U.C. Santa Barbara
Finding parking when not commuting PSfrag replacements 7 8 1 2 6 3 5 {{1, 4, 5}, {2, 3}, {6, 8}, {7}} 4 Jon McCammond U.C. Santa Barbara 1 A common structure The goal of this talk will be to introduce
More informationNOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET. 1. Basic Definitions
NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET JENNIFER WOODCOCK 1. Basic Definitions Dyck paths are one of the many combinatorial objects enumerated by the Catalan numbers, sequence A000108 in [2]:
More informationq xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.
Math 880 Alternative Challenge Problems Fall 2016 A1. Given, n 1, show that: m1 m 2 m = ( ) n+ 1 2 1, where the sum ranges over all positive integer solutions (m 1,..., m ) of m 1 + + m = n. Give both
More informationCombinatorial proofs of addition formulas
Combinatorial proofs of addition formulas Xiang-Ke Chang Xing-Biao Hu LSEC, ICMSEC, Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing, China Hongchuan Lei College of Science
More informationRational Catalan combinatorics
Rational Catalan combinatorics organized by Drew Armstrong, Stephen Griffeth, Victor Reiner, and Monica Vazirani Workshop Summary 1. Topics of the Workshop 1 The mathematics associated with the classical
More informationPARKING FUNCTIONS. Richard P. Stanley Department of Mathematics M.I.T Cambridge, MA
PARKING FUNCTIONS Richard P. Stanley Department of Mathematics M.I.T. -75 Cambridge, MA 09 rstan@math.mit.edu http://www-math.mit.edu/~rstan Transparencies available at: http://www-math.mit.edu/~rstan/trans.html
More informationCatalan numbers, parking functions, and invariant theory
Catalan numbers, parking functions, and invariant theory Vic Reiner Univ. of Minnesota CanaDAM Memorial University, Newfoundland June 10, 2013 Outline 1 Catalan numbers and objects 2 Parking functions
More informationTorus Knots and q, t-catalan Numbers
Torus Knots and q, t-catalan Numbers Eugene Gorsky Stony Brook University Simons Center For Geometry and Physics April 11, 2012 Outline q, t-catalan numbers Compactified Jacobians Arc spaces on singular
More informationEnumerative and Algebraic Combinatorics of OEIS A071356
Enumerative and Algebraic Combinatorics of OEIS A071356 Chetak Hossain Department of Matematics North Carolina State University July 9, 2018 Chetak Hossain (NCSU) Combinatorics of OEIS A071356 July 9,
More informationThe Phagocyte Lattice of Dyck Words
DOI 10.1007/s11083-006-9034-0 The Phagocyte Lattice of Dyck Words J. L. Baril J. M. Pallo Received: 26 September 2005 / Accepted: 25 May 2006 Springer Science + Business Media B.V. 2006 Abstract We introduce
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationSmith Normal Form and Combinatorics
Smith Normal Form and Combinatorics Richard P. Stanley June 8, 2017 Smith normal form A: n n matrix over commutative ring R (with 1) Suppose there exist P,Q GL(n,R) such that PAQ := B = diag(d 1,d 1 d
More informationThe (q, t)-catalan Numbers and the Space of Diagonal Harmonics. James Haglund. University of Pennsylvania
The (q, t)-catalan Numbers and the Space of Diagonal Harmonics James Haglund University of Pennsylvania Outline Intro to q-analogues inv and maj q-catalan Numbers MacMahon s q-analogue The Carlitz-Riordan
More informationPartitions, rooks, and symmetric functions in noncommuting variables
Partitions, rooks, and symmetric functions in noncommuting variables Mahir Bilen Can Department of Mathematics, Tulane University New Orleans, LA 70118, USA, mcan@tulane.edu and Bruce E. Sagan Department
More informationOutline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials
Outline MSRI-UP 2009 Coding Theory Seminar, Week 2 John B. Little Department of Mathematics and Computer Science College of the Holy Cross Cyclic Codes Polynomial Algebra More on cyclic codes Finite fields
More informationOlympiad Combinatorics. Pranav A. Sriram
Olympiad Combinatorics Pranav A. Sriram August 2014 Chapter 4: Existence 1 Copyright notices All USAMO and USA Team Selection Test problems in this chapter are copyrighted by the Mathematical Association
More informationDIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO
DIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO Abstract. In this paper, we give a sampling of the theory of differential posets, including various topics that excited me. Most of the material is taken from
More informationPattern avoidance in ascent sequences
Pattern avoidance in ascent sequences Paul Duncan 25 Vega Court Irvine, CA 92617, USA pauldncn@gmail.com Einar Steingrímsson Department of Computer and Information Sciences University of Strathclyde, Glasgow
More information2 Generating Functions
2 Generating Functions In this part of the course, we re going to introduce algebraic methods for counting and proving combinatorial identities. This is often greatly advantageous over the method of finding
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationOn divisibility of Narayana numbers by primes
On divisibility of Narayana numbers by primes Miklós Bóna Department of Mathematics, University of Florida Gainesville, FL 32611, USA, bona@math.ufl.edu and Bruce E. Sagan Department of Mathematics, Michigan
More informationThe Catalan matroid.
The Catalan matroid. arxiv:math.co/0209354v1 25 Sep 2002 Federico Ardila fardila@math.mit.edu September 4, 2002 Abstract We show how the set of Dyck paths of length 2n naturally gives rise to a matroid,
More informationGenerating functions in enumerative geometry
Generating functions in enumerative geometry Ragni Piene ICREM 5 Bandung, Indonesia October 22, 2011 Counting 1 Counting 2 Counting 3 Partitions Let n be a positive integer. In how many ways p(n) can we
More informationpatterns Lara Pudwell faculty.valpo.edu/lpudwell
faculty.valpo.edu/lpudwell joint work with Andrew Baxter Permutation 2014 East Tennessee State University July 7, 2014 Ascents Definition An ascent in the string x 1 x n is a position i such that x i
More informationUnlabeled Motzkin numbers
Dept. Computer Science and Engineering 013 Catalan numbers Catalan numbers can be defined by the explicit formula: C n = 1 n = n! n + 1 n n!n + 1! and the ordinary generating function: Cx = n=0 C n x n
More informationSome new representation problems involving primes
A talk given at Hong Kong Univ. (May 3, 2013) and 2013 ECNU q-series Workshop (Shanghai, July 30) Some new representation problems involving primes Zhi-Wei Sun Nanjing University Nanjing 210093, P. R.
More informationActions and Identities on Set Partitions
Actions and Identities on Set Partitions The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Marberg,
More informationReconstructibility of trees from subtree size frequencies
Stud. Univ. Babeş-Bolyai Math. 59(2014), No. 4, 435 442 Reconstructibility of trees from subtree size frequencies Dénes Bartha and Péter Burcsi Abstract. Let T be a tree on n vertices. The subtree frequency
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationThis class will demonstrate the use of bijections to solve certain combinatorial problems simply and effectively.
. Induction This class will demonstrate the fundamental problem solving technique of mathematical induction. Example Problem: Prove that for every positive integer n there exists an n-digit number divisible
More informationZEROS OF SPARSE POLYNOMIALS OVER LOCAL FIELDS OF CHARACTERISTIC p
ZEROS OF SPARSE POLYNOMIALS OVER LOCAL FIELDS OF CHARACTERISTIC p BJORN POONEN 1. Statement of results Let K be a field of characteristic p > 0 equipped with a valuation v : K G taking values in an ordered
More informationd-regular SET PARTITIONS AND ROOK PLACEMENTS
Séminaire Lotharingien de Combinatoire 62 (2009), Article B62a d-egula SET PATITIONS AND OOK PLACEMENTS ANISSE KASAOUI Université de Lyon; Université Claude Bernard Lyon 1 Institut Camille Jordan CNS UM
More informationAdvanced Counting Techniques. Chapter 8
Advanced Counting Techniques Chapter 8 Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence Relations Nonhomogeneous Recurrence Relations Divide-and-Conquer
More informationMATH 402 : 2017 page 1 of 6
ADMINISTRATION What? Math 40: Enumerative Combinatorics Who? Me: Professor Greg Smith You: students interested in combinatorics When and Where? lectures: slot 00 office hours: Tuesdays at :30 6:30 and
More informationDiscrete Structures, Final Exam
Discrete Structures, Final Exam Monday, May 11, 2009 SOLUTIONS 1. (40 pts) Short answer. Put your answer in the box. No partial credit. [ ] 0 1 (a) If A = and B = 1 0 [ ] 0 0 1. 0 1 1 [ 0 1 1 0 0 1 ],
More informationStandard Young Tableaux Old and New
Standard Young Tableaux Old and New Ron Adin and Yuval Roichman Department of Mathematics Bar-Ilan University Workshop on Group Theory in Memory of David Chillag Technion, Haifa, Oct. 14 1 2 4 3 5 7 6
More informationRCC. Drew Armstrong. FPSAC 2017, Queen Mary, London. University of Miami armstrong
RCC Drew Armstrong University of Miami www.math.miami.edu/ armstrong FPSAC 2017, Queen Mary, London Outline of the Talk 1. The Frobenius Coin Problem 2. Rational Dyck Paths 3. Core Partitions 4. The Double
More informationSupplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
More informationNamed numbres. Ngày 25 tháng 11 năm () Named numbres Ngày 25 tháng 11 năm / 7
Named numbres Ngày 25 tháng 11 năm 2011 () Named numbres Ngày 25 tháng 11 năm 2011 1 / 7 Fibonacci, Catalan, Stirling, Euler, Bernoulli Many sequences are famous. 1 1, 2, 3, 4,... the integers. () Named
More informationWeek 9-10: Recurrence Relations and Generating Functions
Week 9-10: Recurrence Relations and Generating Functions April 3, 2017 1 Some number sequences An infinite sequence (or just a sequence for short is an ordered array a 0, a 1, a 2,..., a n,... of countably
More informationALL TEXTS BELONG TO OWNERS. Candidate code: glt090 TAKEN FROM
How are Generating Functions used in finding the closed form of sequences involving recurrence relations and in the analysis of probability distributions? Mathematics Extended Essay Word count: 3865 Abstract
More informationPolynomial analogues of Ramanujan congruences for Han s hooklength formula
Polynomial analogues of Ramanujan congruences for Han s hooklength formula William J. Keith CELC, University of Lisbon Email: william.keith@gmail.com Detailed arxiv preprint: 1109.1236 Context Partition
More informationLinked Partitions and Linked Cycles
Linked Partitions and Linked Cycles William Y. C. Chen 1,4, Susan Y. J. Wu 2 and Catherine H. Yan 3,5 1,2,3 Center for Combinatorics, LPMC Nankai University, Tianjin 300071, P. R. China 3 Department of
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationParking cars after a trailer
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 70(3) (2018), Pages 402 406 Parking cars after a trailer Richard Ehrenborg Alex Happ Department of Mathematics University of Kentucky Lexington, KY 40506 U.S.A.
More informationDiscrete Math, Second Problem Set (June 24)
Discrete Math, Second Problem Set (June 24) REU 2003 Instructor: Laszlo Babai Scribe: D Jeremy Copeland 1 Number Theory Remark 11 For an arithmetic progression, a 0, a 1 = a 0 +d, a 2 = a 0 +2d, to have
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More information2016 EF Exam Texas A&M High School Students Contest Solutions October 22, 2016
6 EF Exam Texas A&M High School Students Contest Solutions October, 6. Assume that p and q are real numbers such that the polynomial x + is divisible by x + px + q. Find q. p Answer Solution (without knowledge
More informationSydney University Mathematical Society Problems Competition Solutions.
Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed
More informationarxiv:math/ v1 [math.co] 10 Nov 1998
A self-dual poset on objects counted by the Catalan numbers arxiv:math/9811067v1 [math.co] 10 Nov 1998 Miklós Bóna School of Mathematics Institute for Advanced Study Princeton, NJ 08540 April 11, 2017
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
More informationProblems in Linear Algebra and Representation Theory
Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific
More informationAlgebraic aspects of some Riordan arrays related to binary words avoiding a pattern
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern D. Merlini and R. Sprugnoli Dipartimento di Sistemi e Informatica viale Morgagni 65, 5034, Firenze, Italia merlini@dsi.unifi.it,
More informationA Combinatorial Interpretation of the Numbers 6 (2n)! /n! (n + 2)!
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.2.3 A Combinatorial Interpretation of the Numbers 6 (2n)! /n! (n + 2)! Ira M. Gessel 1 and Guoce Xin Department of Mathematics Brandeis
More informationCSC Discrete Math I, Spring Relations
CSC 125 - Discrete Math I, Spring 2017 Relations Binary Relations Definition: A binary relation R from a set A to a set B is a subset of A B Note that a relation is more general than a function Example:
More informationA REFINED ENUMERATION OF p-ary LABELED TREES
Korean J. Math. 21 (2013), No. 4, pp. 495 502 http://dx.doi.org/10.11568/kjm.2013.21.4.495 A REFINED ENUMERATION OF p-ary LABELED TREES Seunghyun Seo and Heesung Shin Abstract. Let T n (p) be the set of
More informationDISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS
DISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS AARON ABRAMS, DAVID GAY, AND VALERIE HOWER Abstract. We show that the discretized configuration space of k points in the n-simplex is homotopy equivalent
More informationMath 113 Homework 5. Bowei Liu, Chao Li. Fall 2013
Math 113 Homework 5 Bowei Liu, Chao Li Fall 2013 This homework is due Thursday November 7th at the start of class. Remember to write clearly, and justify your solutions. Please make sure to put your name
More informationPROPERTIES OF THE POSET OF DYCK PATHS ORDERED BY INCLUSION. by: Jennifer Woodcock for: Dr. Mike Zabrocki Math 6002 York University
PROPERTIES OF THE POSET OF DYCK PATHS ORDERED BY INCLUSION by: Jennifer Woodcock for: Dr. Mike Zabrocki Math 6002 York University August 2008 Acknowledgments As this is perhaps the closest I will come
More informationPRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM
PRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM ALEX FINK 1. Introduction and background Consider the discrete conditional independence model M given by {X 1 X 2 X 3, X 1 X 3 X 2 }. The intersection axiom
More informationThe problematic art of counting
The problematic art of counting Ragni Piene SMC Stockholm November 16, 2011 Mikael Passare A (very) short history of counting: tokens and so on... Partitions Let n be a positive integer. In how many ways
More informationRings. EE 387, Notes 7, Handout #10
Rings EE 387, Notes 7, Handout #10 Definition: A ring is a set R with binary operations, + and, that satisfy the following axioms: 1. (R, +) is a commutative group (five axioms) 2. Associative law for
More informationWeak Separation, Pure Domains and Cluster Distance
Discrete Mathematics and Theoretical Computer Science DMTCS vol (subm, by the authors, 1 1 Weak Separation, Pure Domains and Cluster Distance Miriam Farber 1 and Pavel Galashin 1 1 Department of Mathematics,
More informationPartitions, permutations and posets Péter Csikvári
Partitions, permutations and posets Péter Csivári In this note I only collect those things which are not discussed in R Stanley s Algebraic Combinatorics boo Partitions For the definition of (number) partition,
More informationA weighted interpretation for the super Catalan numbers
A weighted interpretation for the super Catalan numbers ariv:1403.5246v2 [math.co] 26 Aug 24 Emily Allen Irina Gheorghiciuc Abstract The super Catalan numbers T (m, n) = (2m)!(2n)!/2m!n!(m+n)! are integers
More informationPUTNAM TRAINING PROBLEMS
PUTNAM TRAINING PROBLEMS (Last updated: December 3, 2003) Remark This is a list of Math problems for the NU Putnam team to be discussed during the training sessions Miguel A Lerma 1 Bag of candies In a
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 016-017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations, 1.7.
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationRow-strict quasisymmetric Schur functions
Row-strict quasisymmetric Schur functions Sarah Mason and Jeffrey Remmel Mathematics Subject Classification (010). 05E05. Keywords. quasisymmetric functions, Schur functions, omega transform. Abstract.
More informationBounds on parameters of minimally non-linear patterns
Bounds on parameters of minimally non-linear patterns P.A. CrowdMath Department of Mathematics Massachusetts Institute of Technology Massachusetts, U.S.A. crowdmath@artofproblemsolving.com Submitted: Jan
More informationB Sc MATHEMATICS ABSTRACT ALGEBRA
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc MATHEMATICS (0 Admission Onwards) V Semester Core Course ABSTRACT ALGEBRA QUESTION BANK () Which of the following defines a binary operation on Z
More informationHMMT February 2018 February 10, 2018
HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18
More informationAN INVESTIGATION OF THE CHUNG-FELLER THEOREM AND SIMILAR COMBINATORIAL IDENTITIES
AN INVESTIGATION OF THE CHUNG-FELLER THEOREM AND SIMILAR COMBINATORIAL IDENTITIES ELI A. WOLFHAGEN Abstract. In this paper, we shall prove the Chung-Feller Theorem in multiple ways as well as extend its
More informationLinked partitions and linked cycles
European Journal of Combinatorics 29 (2008) 1408 1426 www.elsevier.com/locate/ejc Linked partitions and linked cycles William Y.C. Chen a, Susan Y.J. Wu a, Catherine H. Yan a,b a Center for Combinatorics,
More informationHyperplane Arrangements, Interval Orders and Trees
Hyperplane Arrangements, Interval Orders and Trees Richard P. Stanley 1 Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 Version of 1 December 1995 1 Hyperplane arrangements
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationMatrix compositions. Emanuele Munarini. Dipartimento di Matematica Politecnico di Milano
Matrix compositions Emanuele Munarini Dipartimento di Matematica Politecnico di Milano emanuelemunarini@polimiit Joint work with Maddalena Poneti and Simone Rinaldi FPSAC 26 San Diego Motivation: L-convex
More informationSeries Editor KENNETH H. ROSEN INDUCTION THEORY AND APPLICATIONS. of Manitoba. University. Winnipeg, Canada. CRC Press. Taylor StFrancis Group
DISCIIETE MATHEMATICS AND ITS APPLICATIONS Series Editor KENNETH H. ROSEN HANDBOOK OF MATHEMATICAL INDUCTION THEORY AND APPLICATIONS David S. Gunderson University of Manitoba Winnipeg, Canada CRC Press
More information