Euler s partition theorem and the combinatorics of l-sequences
|
|
- Dustin Underwood
- 5 years ago
- Views:
Transcription
1 Euler s partition theorem and the combinatorics of l-sequences Carla D. Savage North Carolina State University June 26, 2008
2 Inspiration BME1 Mireille Bousquet-Mélou, and Kimmo Eriksson, Lecture hall partitions, Ramanujan. J., 1:1, 1997, BME2 Mireille Bousquet-Mélou, and Kimmo Eriksson, Lecture hall partitions II, Ramanujan. J., 1:2, 1997, Reference SY07 C. D. S. and Ae Ja Yee, Euler s partition theorem and the combinatorics of l-sequences, JCTA, 2007, to appear, available online. LS08 Nicholas Loehr, and C. D. S. Notes on l-nomials, in preparation.
3 Overview Euler s partition theorem
4 Overview 1, 2, 3,... l-sequences Euler s partition theorem
5 Overview 1, 2, 3,... l-sequences Euler s partition theorem The l-euler theorem
6 Overview 1, 2, 3,... l-sequences Euler s partition theorem The l-euler theorem Lecture hall partitions l-lecture hall partitions
7 Overview 1, 2, 3,... l-sequences Euler s partition theorem The l-euler theorem Lecture hall partitions l-lecture hall partitions Binomial coefficients l-nomial coefficients
8 Euler s Partition Theorem: The number of partitions of an integer N into odd parts is equal to the number of partitions of N into distinct parts. Example: N = 8 Odd parts: (7,1) (5,3) (5,1,1,1) (3,3,1,1) (3,1,1,1,1,1) (1,1,1,1,1,1,1,1) Distinct Parts: (8) (7,1) (6,2) (5,3) (5,2,1) (4,3,1)
9 Sylvester s Bijection
10 Sylvester s Bijection
11 l-sequences For integer l 2, define the sequence {a n (l) } n 1 by a (l) n = la (l) n 1 a(l) n 2, with initial conditions a (l) 1 = 1, a (l) 2 = l.
12 l-sequences For integer l 2, define the sequence {a n (l) } n 1 by a (l) n = la (l) n 1 a(l) n 2, with initial conditions a (l) 1 = 1, a (l) 2 = l. {a (3) n } = 1, 3, 8, 21, 55, 144, 377,... {a (2) n } = 1, 2, 3, 4, 5, 6, 7,...
13 l-sequences For integer l 2, define the sequence {a n (l) } n 1 by a (l) n = la (l) n 1 a(l) n 2, with initial conditions a (l) 1 = 1, a (l) 2 = l. {a (3) n } = 1, 3, 8, 21, 55, 144, 377,... {a (2) n } = 1, 2, 3, 4, 5, 6, 7,... (These are the (k, l) sequences in [BME2] with k = l = l.)
14 l 2 The l-euler theorem [BME2]: The number of partitions of an integer N into parts from the set {a (l) 0 + a (l) 1, a(l) 1 + a (l) 2, a(l) 2 + a (l) 3,...} is the same as the number of partitions of N in which the ratio of consecutive parts is greater than Proof: via lecture hall partitions. c l = l + l 2 4 2
15 l = 2 The l-euler theorem [BME2]: The number of partitions of an integer N into parts from the set {0 + 1, 1 + 2, 2 + 3,...} = {1, 3, 5,...} is the same as the number of partitions of N in which the ratio of consecutive parts is greater than c 2 = = 1
16 l = 3 The l-euler theorem [BME2]: The number of partitions of an integer N into parts from the set {0 + 1, 1 + 3, 3 + 8,...} = {1, 4, 11, 29,...} is the same as the number of partitions of N in which the ratio of consecutive parts is greater than c 3 = = (3 + 5)/2
17 l = 3 The l-euler theorem [BME2]: The number of partitions of an integer N into parts from the set {0 + 1, 1 + 3, 3 + 8,...} = {1, 4, 11, 29,...} is the same as the number of partitions of N in which the ratio of consecutive parts is greater than c 3 = = (3 + 5)/2 Stanley: bijection?
18 Θ (l) : Bijection for the l-euler Theorem [SY07] Given a partition µ into parts in {a 0 + a 1, a 1 + a 2, a 2 + a 3,...} construct λ = (λ 1, λ 2,...) by inserting the parts of µ in nonincreasing order as follows: To insert a k 1 + a k into (λ 1, λ 2,...): If k = 1, then add a 1 to λ 1 ; otherwise, if (λ 1 + a k a k 1 ) > c l (λ 2 + a k 1 a k 2 ), add a k a k 1 to λ 1, add a k 1 a k 2 to λ 2 ; recursively insert a k 2 + a k 1 into (λ 3, λ 4,...) otherwise, add a k to λ 1, and add a k 1 to λ 2.
19 The insertion step To insert a k + a k 1 into (λ 1, λ 2, λ 3, λ 4,...) either do (i) (λ 1 + a k, λ 2 + a k 1, λ 3, λ 4,...) or (ii) (λ 1 + (a k a k 1 ), λ 2 + (a k 1 a k 2 ), insert (a k 1 + a k 2 )into(λ 3, λ 4,...)) How to decide? Do (ii) if the ratio of first two parts is okay, otherwise do (i).
20
21 Interpretation of a (l) n Define T n (l) : set of l-ary strings of length n that do not contain (l 1)(l 2) (l 1) T (3) 1 = {0, 1, 2} T (3) 1 = 3 T (3) 2 = {00, 01, 02, 11, 10, 12, 20, 21} T (3) 2 = 8 T (3) 3 : all 27 except 220, 221, 222, 022, 122, and 212. Theorem T (l) n = a(l) n+1. T (3) 3 = 27 6 = 21
22 Binary numeration system = 22 Ternary numeration system (unique representation) = 138 (unique representation)
23 Binary numeration system = 22 Ternary numeration system (unique representation) = 138 A Fraenkel numeration system: ternary, but... (unique representation) = 75
24 Binary numeration system = 22 Ternary numeration system (unique representation) = 138 A Fraenkel numeration system: ternary, but... (unique representation) = = = 21
25 Binary numeration system = 22 Ternary numeration system (unique representation) = 138 A Fraenkel numeration system: ternary, but... (unique representation) = = = 21 but unique representation by ternary strings with no 21*2
26 Theorem [Fraenkel 1985] Every nonnegative integer has a unique (up to leading zeroes) representation as an l-ary string which does not contain the pattern (l 1) (l 2) (l 1). Proof Show that is a bijection f : b n b n 1... b 1 n b i a i i=1 f : T (l) n {0, 1, 2,... a (l) n+1 1}. The l-representation of an integer x is [x] = f 1 (x).
27
28
29
30 Can revise bijection To insert a k + a k+1 into (λ 1, λ 2, λ 3, λ 4,...) either do (i) (λ 1 + a k, λ 2 + a k 1, λ 3, λ 4,...) or (ii) (λ 1 + (a k a k 1 ), λ 2 + (a k 1 a k 2 ), How to decide? insert (a k 1 + a k 2 )into(λ 3, λ 4,...)) Do (i) if it does not create a carry in Fraenkel arithmetic; otherwise do (ii). So, insertion becomes a 2-d form of Fraenkel arithmetic.
31 Lecture Hall Partitions
32 The Lecture Hall Theorem [BME1] The generating function for integer sequences λ 1, λ 2,..., λ n satisfying: is L n : λ 1 n λ 2 n 1... λ n 1 0 L n (q) = n i=1 1 1 q 2i 1
33 The Lecture Hall Theorem [BME1] The generating function for integer sequences λ 1, λ 2,..., λ n satisfying: is L n : λ 1 n λ 2 n 1... λ n 1 0 L n (q) = n i=1 1 1 q 2i 1 lim n (Lecture Hall Theorem) = Euler s Theorem since λ 1 n λ 2 n 1... λ n 1 n i=1 0 partitions into distinct parts 1 partitions into odd parts 1 q2i 1
34 Let {a n } = {a (l) n }. The l-lecture Hall Theorem [BME2]: The generating function for integer sequences λ 1, λ 2,..., λ n satisfying: L (l) n : λ 1 a n λ 2 a n 1... λ n 1 a 2 λ n a 1 0 is L (l) n (q) = n i=1 1 (1 q a i 1 +a i ) lim n (l-lecture Hall Theorem) = l-euler Theorem since as n, a n /a n 1 c l
35 Θ (l) n : Bijection for the l-lecture Hall Theorem Given a partition µ into parts in {a 0 + a 1, a 1 + a 2, a 2 + a 3,..., a n 1 + a n } construct λ = (λ 1, λ 2,..., λ n ) by inserting the parts of µ in nonincreasing order as follows: To insert a k 1 + a k into (λ 1, λ 2,..., λ n ): If k = 1, then add a 1 to λ 1 ; otherwise, if (λ 1 + a k a k 1 ) (a n /a n 1 )(λ 2 + a k 1 a k 2 ), add a k a k 1 to λ 1, add a k 1 a k 2 to λ 2 ; recursively insert a k 2 + a k 1 into (λ 3, λ 4,..., λ n ) otherwise, add a k to λ 1, and add a k 1 to λ 2.
36 Relationship between bijections
37
38
39
40
41
42
43
44 Truncated lecture hall partitions L (l) n,k : λ 1 n λ 2 n 1 λ k 1 n k + 2 λ k n k + 1 > 0 Theorem: [Corteel,S 2004] [ L (l) n,k (q) = q(k+1 2 ) n k ] q ( q n k+1 ; q) k (q 2n k+1 ; q) k, where (a; q) n = (1 a)(1 aq) (1 aq n 1 ) Analog for l-lecture hall partitions?
45 Truncated lecture hall partitions L (l) n,k,j : j λ 1 n λ 2 n 1 λ k 1 n k + 2 λ k n k + 1 > 0 Theorem: [Corteel,S 2004] [ L (l) n,k (q) = q(k+1 2 ) n k Theorem [Corteel,Lee,S 2005] ( ) L (l) n n,k,j (1) = jk k ] q ( q n k+1 ; q) k (q 2n k+1 ; q) k, where (a; q) n = (1 a)(1 aq) (1 aq n 1 ) Analog for l-lecture hall partitions?
46 Theorem [Corteel,S 2004] Given positive integers s 1,..., s n, the generating function for the sequences λ 1,..., λ n satisfying is λ 1 s 1 λ 2 s 2 λ n 1 s n 1 λ n s n 0 s2 1 s3 1 z 2 =0 z 3 =0 s n 1 z n=0 s1z2 + P n s q 2 i=2 z i n 1 n i=1 (1 qb i ) i=2 qb i zi+1 z i s i+1 s i where b 1 = 1 and for 2 i n, b i = s 1 + s s i. Corollary As q 1, (1 q) n this gf s 2 s 3 s n n i=1 b. i
47 Truncated l-lecture hall partitions l-nomials Corollary For l-sequence {a i }: L (l) n+k,k : λ 1 a n+k λ 2 a n+k 1 λ k a n+1 > 0 but L (l) n+k,k (q) =? ( n ) (l) lim ((1 q 1 q)k L (l) n+k,k (q)) = k (p 1 p 2 p k )(p n+k p n+k 1 p n+1 ) where p i = a i + a i 1 and ( ) n (l) is the l-nomial... k
48 The l-nomial coefficient Example ( n k ) (l) = a(l) n a (l) n 1 a(l) n k+1 a (l) k a(l) k 1 a(l) 1. ( ) 9 (3) = = 174, 715, 376. Theorem [Lucas 1878] ( n ) (l) k is an integer. like Fibonomials, e.g. Ron Knott s web page:
49 Pascal-like triangle for the l-nomial coefficient: Theorem ( ) n (l) ( = (a (l) n 1 k k+1 a(l) k ) k ) (l) + (a (l) n k a(l) n k 1 ) ( n 1 k 1 ) (l)
50 Let u l and v l be the roots of the polynomial x 2 lx + 1: Then u l = l + l 2 4 ; v l = l l u l + v l = l; u l v l = 1. a (l) n = un l v n l u l v l.
51 Let u l and v l be the roots of the polynomial x 2 lx + 1: Then u l = l + l 2 4 ; v l = l l u l + v l = l; u l v l = 1. a (l) n = un l v n l u l v l. For real r, define (l) r = ul r + v l r. Then for integer n (l) n = a (l) n+1 a(l) n 1. ( is the l analog of 2.)
52 Let u l and v l be the roots of the polynomial x 2 lx + 1: Then u l = l + l 2 4 ; v l = l l u l + v l = l; u l v l = 1. a (l) n = un l v n l u l v l. For real r, define (l) r = ul r + v l r. Then for integer n (l) n = a (l) n+1 a(l) n 1. ( is the l analog of 2.) ( (l) n/2 )2 = u n l + 2(u lv l ) n/2 + v n l = (l) n + 2. (l) r = u r l + v r l = vl r + ur l = (l) r
53 A 3-term recurrence for the l-nomial [LS] ( ) n (l) = k ( n 2 k ) (l) + (l) n 1 ( ) n 2 (l) + k 1 ( ) n 2 (l) k 2 Proof: Use identities: a (l) n+k a(l) n k = (l) n a (l) k. a n (l) a (l) n 1 a(l) k a(l) k 1 = a(l) n k a(l) n+k 1.
54 An l-nomial theorem [LS]: An analog of is n k=0 ( ) n z k = (1 + z) n k n k=0 ( ) n (l) z k = k n 1 i=0 (u i (n 1)/2 l + v i (n 1)/2 l z) = (1 + (l) 1 z + z2 )(1 + (l) 3 z + z2 ) (1 + (l) n 1 z + z2 ) (1 + z)(1 + (l) 2 z + z2 )(1 + (l) 4 z + z2 ) (1 + (l) n 1 z + z2 ) n even n odd
55 A coin-flipping interpretation of the l-nomial For real r, let C r (l) be a weighted coin for which the probability of tails is ul r / (l) r and the probability of heads is vl r / (l) r. The probability of getting exactly k heads when tossing the n coins C (l) (n 1)/2, C (l) 1 (n 1)/2, C (l) 2 (n 1)/2,..., C (l) (n 1)/2 :
56 A coin-flipping interpretation of the l-nomial For real r, let C r (l) be a weighted coin for which the probability of tails is ul r / (l) r and the probability of heads is vl r / (l) r. The probability of getting exactly k heads when tossing the n coins C (l) (n 1)/2, C (l) 1 (n 1)/2, C (l) 2 (n 1)/2,..., C (l) (n 1)/2 : ( ) (l) n k (l) (n 1)/2 (l) 1 (n 1)/2 (l) (n 1)/2 1 (l) (n 1)/2 (l) j/2 may not be an integer, but (l) j/2 (l) j/2 = (l) j + 2 is.
57 Figure: The 8 possible results of tossing the weighted coins C (l) 1, C (l) 0, C (l) 1. Heads (pink) are indicated with their v weight and tails (blue) with their u weight. The weight of each toss is shown.
58 Define a q-analog of the l-nomial: a n (l) (q) = un l v l nqn u l v l q ; (l) n (q) = ul n + v l n qn Then [ n k ] (l) q = a(l) n (q) a (l) n 1 (q) a(l) n k+1 (q) a (l) (q) a(l) (q) a(l) 1 (q). k k 1 [ n k ] (l) q = q k [ n 2 k ] (l) q [ ] + (l) n 2 (l) n 1 (q) k 1 q [ ] n 2 ( + q n k k 2 q and n k=0 [ n k ] (l) q q k(k+1)/2 z k = α n (q, z) n/2 i=1 (1 + zq i (l) n 2i+1 (q) + z2 q n+1 ). where α n (q, z) = 1 if n is even; (1 + zq (n+1)/2 ) if n is odd.
59 Proofs can be derived from this partition-theoretic interpretation:
60 Another q-analog of the l-nomial Let a n (q) = (1 q an )/(1 q). Then [ n k ] (l) q = (µ,f ) q shapeweight(µ) q fillweight(µ,f ) where the sum is over all pairs (µ, f ) such µ is a partition in [k (n k)] and f is a filling f (i, j) of the cells of [k (n k)] with elements of {0, 1,... l 1} so that (i) no row of µ or column of µ c contains (l 1)(l 2) (l 1) and... (a bit more) Indexing cells of k (n k) bottom to top, left to right: cell (i, j) has a shape weight (a i a i 1 )(a j a j 1 ) shapeweight(µ) is sum of shape weights of cells in µ cell (i, j) has a fill weight a i a j fillweight(µ, f ) is i,j f (i, j)a ia j. (Now starting to get something related to lecture hall partitions.)
61 Question: Is there an analytic proof of the l-euler theorem? When l = 2, the standard approach is to show the equivalence of the generating functions for the set of partitions into odd parts and the set of partitions into distinct parts: 1 1 q 2k 1 = (1 + q k ). k=1 k=1 The sum/product form of Euler s theorem is k=1 1 1 q 2k 1 = k=0 q k(k+1) (q; q) k Is there an analog for the l-euler theorem? What is the sum-side generating function for partitions in which the ratio of consecutive parts is greater than c l?
62 Question: When l = 2, several refinements of Euler s theorem follow from Sylvester s bijection. What refinements of the l-euler theorem can be obtained from the bijection? We have some partial answers, but here s one we can t answer: Sylvester showed that if, in his bijection, the partition µ into odd parts maps to λ (distinct parts), then the number of distinct part sizes occurring in µ is the same as the number of maximal chains in λ. (A chain is a sequence of consecutive integers.) Is there an analog for l > 2?
63 Question: Can we enumerate either of these finite sets: The integer sequences λ 1,..., λ n in which the ratio of consecutive parts is greater than c l and λ 1 < a (l) n+1? We have a combinatorial characterization: these can be viewed as fillings of a staircase of shape (n, n 1,..., 1) such that (i) the filling of each row is an l-ary string with no (l 1)(l 2) (l 1) and (ii) the rows are weakly decreasing, lexicographically. For l = 2 the answer is 2 n. The integer sequences λ 1,..., λ n satisfying 1 λ 1 a n λ 2 a n 1... λ n 1 a 2 λ n a 1 0 For l = 2 this is the same set as above and the answer is 2 n.
64 Question: What is the generating function for truncated l-lecture hall partitions? Question: What is the right q-analog of the l-nomial (and the right interpretation) to explain and generalize lecture hall partitions? (We know what lecture hall partitions look like in the l-world. What about ordinary partitions? partitions into distinct parts?) Question: There are several q-series identities related to Euler s theorem, such as Lebesgue s identity the Roger s-fine identity Cauchy s identity Are there l-analogs?
65 Sincere thanks to... You, the audience The FPSAC08 Organizing Committee The FPSAC08 Program Committee Luc Lapointe
66 CanaDAM nd Canadian Discrete and Algorithmic Mathematics Conference May 25-28, 2009 CRM, Montreal, Quebec, Canada
67 AMS 2009 Spring Southeastern Section Meeting North Carolina State University Raleigh, NC April 4-5, 2009 (Saturday - Sunday) Some of the special sessions: Applications of Algebraic and Geometric Combinatorics (Sullivant, Savage) Rings, Algebras, and Varieties in Combinatorics (Hersh, Lenart, Reading) Recent Advances in Symbolic Algebra and Analysis (Singer, Szanto) Kac-Moody Algebras, Vertex Algebras, Quantum Groups, and Applications (Bakalov, Misra, Jing) Enumerative Geometry and Related Topics (Rimayi, Mihalcea) Homotopical Algebra with Applications to Mathematical Physics (Lada, Stasheff) Low Dimensional Topology and Geometry (Dunfield, Etnyre, Ng)
A note on partitions into distinct parts and odd parts
c,, 5 () Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. A note on partitions into distinct parts and odd parts DONGSU KIM * AND AE JA YEE Department of Mathematics Korea Advanced
More informationOn q-series Identities Arising from Lecture Hall Partitions
On q-series Identities Arising from Lecture Hall Partitions George E. Andrews 1 Mathematics Department, The Pennsylvania State University, University Par, PA 16802, USA andrews@math.psu.edu Sylvie Corteel
More informationPartition Identities
Partition Identities Alexander D. Healy ahealy@fas.harvard.edu May 00 Introduction A partition of a positive integer n (or a partition of weight n) is a non-decreasing sequence λ = (λ, λ,..., λ k ) of
More informationCombinatorial Analysis of the Geometric Series
Combinatorial Analysis of the Geometric Series David P. Little April 7, 205 www.math.psu.edu/dlittle Analytic Convergence of a Series The series converges analytically if and only if the sequence of partial
More informationOn an identity of Gessel and Stanton and the new little Göllnitz identities
On an identity of Gessel and Stanton and the new little Göllnitz identities Carla D. Savage Dept. of Computer Science N. C. State University, Box 8206 Raleigh, NC 27695, USA savage@csc.ncsu.edu Andrew
More informationStandard paths in another composition poset
Standard paths in another composition poset Jan Snellman Department of Mathematics, Stockholm University SE-10691 Stockholm, Sweden Jan.Snellmanmath.su.se Submitted: Oct 8, 2003; Accepted: Oct 17, 2004;
More informationOVERPARTITIONS AND GENERATING FUNCTIONS FOR GENERALIZED FROBENIUS PARTITIONS
OVERPARTITIONS AND GENERATING FUNCTIONS FOR GENERALIZED FROBENIUS PARTITIONS SYLVIE CORTEEL JEREMY LOVEJOY AND AE JA YEE Abstract. Generalized Frobenius partitions or F -partitions have recently played
More informationON PARTITION FUNCTIONS OF ANDREWS AND STANLEY
ON PARTITION FUNCTIONS OF ANDREWS AND STANLEY AE JA YEE Abstract. G. E. Andrews has established a refinement of the generating function for partitions π according to the numbers O(π) and O(π ) of odd parts
More informationAlgorithmic Approach to Counting of Certain Types m-ary Partitions
Algorithmic Approach to Counting of Certain Types m-ary Partitions Valentin P. Bakoev Abstract Partitions of integers of the type m n as a sum of powers of m (the so called m-ary partitions) and their
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 informationTHE LECTURE HALL PARALLELEPIPED
THE LECTURE HALL PARALLELEPIPED FU LIU AND RICHARD P. STANLEY Abstract. The s-lecture hall polytopes P s are a class of integer polytopes defined by Savage and Schuster which are closely related to the
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 informationq-counting hypercubes in Lucas cubes
Turkish Journal of Mathematics http:// journals. tubitak. gov. tr/ math/ Research Article Turk J Math (2018) 42: 190 203 c TÜBİTAK doi:10.3906/mat-1605-2 q-counting hypercubes in Lucas cubes Elif SAYGI
More informationA Proof of the q, t-square Conjecture
Formal Power Series and Algebraic Combinatorics Séries Formelles et Combinatoire Algébrique San Diego, California 2006 A Proof of the q, t-square Conjecture Mahir Can and Nicholas Loehr Abstract. We prove
More informationRAMANUJAN S LOST NOTEBOOK: COMBINATORIAL PROOFS OF IDENTITIES ASSOCIATED WITH HEINE S TRANSFORMATION OR PARTIAL THETA FUNCTIONS
RAMANUJAN S LOST NOTEBOOK: COMBINATORIAL PROOFS OF IDENTITIES ASSOCIATED WITH HEINE S TRANSFORMATION OR PARTIAL THETA FUNCTIONS BRUCE C. BERNDT, BYUNGCHAN KIM, AND AE JA YEE 2 Abstract. Combinatorial proofs
More informationDept. of Computer Science. Raleigh, NC 27695, USA. May 14, Abstract. 1, u 2 q i+1 :
Anti-Leture Hall Compositions Sylvie Corteel CNRS PRiSM, UVSQ 45 Avenue des Etats-Unis 78035 Versailles, Frane syl@prism.uvsq.fr Carla D. Savage Dept. of Computer Siene N. C. State University, Box 8206
More informationRAMANUJAN S LOST NOTEBOOK: COMBINATORIAL PROOFS OF IDENTITIES ASSOCIATED WITH HEINE S TRANSFORMATION OR PARTIAL THETA FUNCTIONS
RAMANUJAN S LOST NOTEBOOK: COMBINATORIAL PROOFS OF IDENTITIES ASSOCIATED WITH HEINE S TRANSFORMATION OR PARTIAL THETA FUNCTIONS BRUCE C. BERNDT, BYUNGCHAN KIM, AND AE JA YEE Abstract. Combinatorial proofs
More informationMathematical Foundations of Computer Science
Mathematical Foundations of Computer Science CS 499, Shanghai Jiaotong University, Dominik Scheder Monday, 208-03-9, homework handed out Sunday, 208-03-25, 2:00: submit questions and first submissions.
More informationCOMBINATORIAL PROOFS OF GENERATING FUNCTION IDENTITIES FOR F-PARTITIONS
COMBINATORIAL PROOFS OF GENERATING FUNCTION IDENTITIES FOR F-PARTITIONS AE JA YEE 1 Abstract In his memoir in 1984 George E Andrews introduces many general classes of Frobenius partitions (simply F-partitions)
More informationMonotone Gray Codes and the Middle Levels Problem
Monotone Gray Codes and the Middle Levels Problem Carla D. Savage Department of Computer Science North Carolina State University Raleigh, North Carolina 27695-8206 cds@adm.csc.ncsu.edu Peter Winkler Bellcore
More informationBijective Proofs with Spotted Tilings
Brian Hopkins, Saint Peter s University, New Jersey, USA Visiting Scholar, Mahidol University International College Editor, The College Mathematics Journal MUIC Mathematics Seminar 2 November 2016 outline
More information#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES
#A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,
More informationCOMBINATORIAL PROOFS OF RAMANUJAN S 1 ψ 1 SUMMATION AND THE q-gauss SUMMATION
COMBINATORIAL PROOFS OF RAMANUJAN S 1 ψ 1 SUMMATION AND THE q-gauss SUMMATION AE JA YEE 1 Abstract. Theorems in the theory of partitions are closely related to basic hypergeometric series. Some identities
More informationRECURRENCE RELATION FOR COMPUTING A BIPARTITION FUNCTION
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 48, Number, 08 RECURRENCE RELATION FOR COMPUTING A BIPARTITION FUNCTION D.S. GIREESH AND M.S. MAHADEVA NAIKA ABSTRACT. Recently, Merca [4] found the recurrence
More informationUNIMODALITY OF PARTITIONS WITH DISTINCT PARTS INSIDE FERRERS SHAPES
UNIMODALITY OF PARTITIONS WITH DISTINCT PARTS INSIDE FERRERS SHAPES RICHARD P. STANLEY AND FABRIZIO ZANELLO Abstract. We investigate the rank-generating function F λ of the poset of partitions contained
More informationSingular Overpartitions
Singular Overpartitions George E. Andrews Dedicated to the memory of Paul Bateman and Heini Halberstam. Abstract The object in this paper is to present a general theorem for overpartitions analogous to
More informationGenerating Functions
8.30 lecture notes March, 0 Generating Functions Lecturer: Michel Goemans We are going to discuss enumeration problems, and how to solve them using a powerful tool: generating functions. What is an enumeration
More informationCOMBINATORICS OF GENERALIZED q-euler NUMBERS. 1. Introduction The Euler numbers E n are the integers defined by E n x n = sec x + tan x. (1.1) n!
COMBINATORICS OF GENERALIZED q-euler NUMBERS TIM HUBER AND AE JA YEE Abstract New enumerating functions for the Euler numbers are considered Several of the relevant generating functions appear in connection
More informationThe Eulerian polynomials of type D have only real roots
FPSAC 2013, Paris, France DMTCS proc. (subm.), by the authors, 1 12 The Eulerian polynomials of type D have only real roots Carla D. Savage 1 and Mirkó Visontai 2 1 Department of Computer Science, North
More informationCounting Palindromic Binary Strings Without r-runs of Ones
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 16 (013), Article 13.8.7 Counting Palindromic Binary Strings Without r-runs of Ones M. A. Nyblom School of Mathematics and Geospatial Science RMIT University
More informationBinomial coefficients and k-regular sequences
Binomial coefficients and k-regular sequences Eric Rowland Hofstra University New York Combinatorics Seminar CUNY Graduate Center, 2017 12 22 Eric Rowland Binomial coefficients and k-regular sequences
More informationA lattice path approach to countingpartitions with minimum rank t
Discrete Mathematics 249 (2002) 31 39 www.elsevier.com/locate/disc A lattice path approach to countingpartitions with minimum rank t Alexander Burstein a, Sylvie Corteel b, Alexander Postnikov c, d; ;1
More informationMaximizing the descent statistic
Maximizing the descent statistic Richard EHRENBORG and Swapneel MAHAJAN Abstract For a subset S, let the descent statistic β(s) be the number of permutations that have descent set S. We study inequalities
More informationMarkov Chains. As part of Interdisciplinary Mathematical Modeling, By Warren Weckesser Copyright c 2006.
Markov Chains As part of Interdisciplinary Mathematical Modeling, By Warren Weckesser Copyright c 2006 1 Introduction A (finite) Markov chain is a process with a finite number of states (or outcomes, or
More informationCAYLEY COMPOSITIONS, PARTITIONS, POLYTOPES, AND GEOMETRIC BIJECTIONS
CAYLEY COMPOSITIONS, PARTITIONS, POLYTOPES, AND GEOMETRIC BIJECTIONS MATJAŽ KONVALINKA AND IGOR PAK Abstract. In 1857, Cayley showed that certain sequences, now called Cayley compositions, are equinumerous
More informationq-pell Sequences and Two Identities of V. A. Lebesgue
-Pell Seuences and Two Identities of V. A. Lebesgue José Plínio O. Santos IMECC, UNICAMP C.P. 6065, 13081-970, Campinas, Sao Paulo, Brazil Andrew V. Sills Department of Mathematics, Pennsylvania State
More informationBilateral truncated Jacobi s identity
Bilateral truncated Jacobi s identity Thomas Y He, Kathy Q Ji and Wenston JT Zang 3,3 Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 30007, PR China Center for Applied Mathematics Tianjin
More informationA Generalization of the Euler-Glaisher Bijection
A Generalization of the Euler-Glaisher Bijection p.1/48 A Generalization of the Euler-Glaisher Bijection Andrew Sills Georgia Southern University A Generalization of the Euler-Glaisher Bijection p.2/48
More informationarxiv: v1 [math.ag] 7 Mar 2016
HILBERT SCHEME OF POINTS ON CYCLIC QUOTIENT SINGULARITIES OF TYPE (p,1) arxiv:163.2114v1 [math.ag] 7 Mar 216 Abstract. In this note we investigate the generating series of the Euler characteristics of
More informationPARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS
PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS GEORGE E. ANDREWS, MATTHIAS BECK, AND NEVILLE ROBBINS Abstract. We study the number p(n, t) of partitions of n with difference t between
More informationCourse : Algebraic Combinatorics
Course 18.31: Algebraic Combinatorics Lecture Notes # 10 Addendum by Gregg Musiker (Based on Lauren Williams Notes for Math 19 at Harvard) February 5th - 7th, 009 1 Introduction to Partitions A partition
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 informationEntropy. Probability and Computing. Presentation 22. Probability and Computing Presentation 22 Entropy 1/39
Entropy Probability and Computing Presentation 22 Probability and Computing Presentation 22 Entropy 1/39 Introduction Why randomness and information are related? An event that is almost certain to occur
More informationAn Involution for the Gauss Identity
An Involution for the Gauss Identity William Y. C. Chen Center for Combinatorics Nankai University, Tianjin 300071, P. R. China Email: chenstation@yahoo.com Qing-Hu Hou Center for Combinatorics Nankai
More informationKnots-quivers correspondence, lattice paths, and rational knots
Knots-quivers correspondence, lattice paths, and rational knots 1 CAMGSD, Departamento de Matemática, Instituto Superior Técnico, Portugal 2 Mathematical Institute SANU, Belgrade, Serbia Warszawa, September
More informationA RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES
#A63 INTEGERS 1 (01) A RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES Brandt Kronholm Department of Mathematics, Whittier College, Whittier,
More informationNotes. Combinatorics. Combinatorics II. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006
Combinatorics Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 4.1-4.6 & 6.5-6.6 of Rosen cse235@cse.unl.edu
More information1 Examples of Weak Induction
More About Mathematical Induction Mathematical induction is designed for proving that a statement holds for all nonnegative integers (or integers beyond an initial one). Here are some extra examples of
More informationInteger Partitions: An Overview
Integer Partitions: An Overview D Singh, PhD, A M Ibrahim, PhD, J N Singh, Ph D, S M Ladan,PhD, Abstract This paper describes fundamentals of integer partitions and basic tools for their construction and
More informationarxiv: v1 [math.co] 24 Jan 2017
CHARACTERIZING THE NUMBER OF COLOURED m ARY PARTITIONS MODULO m, WITH AND WITHOUT GAPS I. P. GOULDEN AND PAVEL SHULDINER arxiv:1701.07077v1 [math.co] 24 Jan 2017 Abstract. In a pair of recent papers, Andrews,
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 informationA PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES
A PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES MATTHEW S. MIZUHARA, JAMES A. SELLERS, AND HOLLY SWISHER Abstract. Ramanujan s celebrated congruences of the partition function p(n have inspired a vast
More informationInteger Partitions. Student ID: Tutor: Roman Kotecky\Neil O Connell April 22, 2015
Integer Partitions Student ID: 35929 Tutor: Roman Kotecky\Neil O Connell April 22, 205 My study of Integer partitions came from a particular algebra assignment in which we were asked to find all the isomorphism
More informationTHE THEORY OF HEAPS AND THE CARTIER FOATA MONOID. C. Krattenthaler
THE THEORY OF HEAPS AND THE CARTIER FOATA MONOID C Krattenthaler Fakultät für Mathematik, Universität Wien, Nordbergstraße 15, A-1090 Vienna, Austria WWW: http://wwwmatunivieacat/~kratt Abstract We present
More informationSpherical Venn Diagrams with Involutory Isometries
Spherical Venn Diagrams with Involutory Isometries Frank Ruskey Mark Weston Department of Computer Science University of Victoria PO BOX 3055, Victoria, BC Canada V8W 3P6 {ruskey,mweston}@cs.uvic.ca Submitted:
More informationNotation Index. gcd(a, b) (greatest common divisor) NT-16
Notation Index (for all) B A (all functions) B A = B A (all functions) SF-18 (n) k (falling factorial) SF-9 a R b (binary relation) C(n,k) = n! k! (n k)! (binomial coefficient) SF-9 n! (n factorial) SF-9
More informationSelf-dual interval orders and row-fishburn matrices
Self-dual interval orders and row-fishburn matrices Sherry H. F. Yan Department of Mathematics Zhejiang Normal University Jinhua 321004, P.R. China huifangyan@hotmail.com Yuexiao Xu Department of Mathematics
More informationResearch Statement. Janine E. Janoski
Research Statement Janine E. Janoski 1 Introduction My research is in discrete mathematics and combinatorics. I have worked on a wide variety of research topics including, enumeration problems, eigenvalue
More informationCOMBINATORIAL CURVE NEIGHBORHOODS FOR THE AFFINE FLAG MANIFOLD OF TYPE A 1 1
COMBINATORIAL CURVE NEIGHBORHOODS FOR THE AFFINE FLAG MANIFOLD OF TYPE A 1 1 LEONARDO C. MIHALCEA AND TREVOR NORTON Abstract. Let X be the affine flag manifold of Lie type A 1 1. Its moment graph encodes
More informationand the compositional inverse when it exists is A.
Lecture B jacques@ucsd.edu Notation: R denotes a ring, N denotes the set of sequences of natural numbers with finite support, is a generic element of N, is the infinite zero sequence, n 0 R[[ X]] denotes
More informationA PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY
A PASCAL-LIKE BOUND FOR THE NUMBER OF NECKLACES WITH FIXED DENSITY I. HECKENBERGER AND J. SAWADA Abstract. A bound resembling Pascal s identity is presented for binary necklaces with fixed density using
More informationq GAUSS SUMMATION VIA RAMANUJAN AND COMBINATORICS
q GAUSS SUMMATION VIA RAMANUJAN AND COMBINATORICS BRUCE C. BERNDT 1 and AE JA YEE 1. Introduction Recall that the q-gauss summation theorem is given by (a; q) n (b; q) ( n c ) n (c/a; q) (c/b; q) =, (1.1)
More informationPrimary classes of compositions of numbers
Annales Mathematicae et Informaticae 41 (2013) pp. 193 204 Proceedings of the 15 th International Conference on Fibonacci Numbers and Their Applications Institute of Mathematics and Informatics, Eszterházy
More informationPartition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example
Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x
More informationSome 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 informationSome Restricted Plane partitions and Associated Lattice Paths S. Bedi Department of Mathematics, D.A.V College, Sector 10 Chandigarh , India
Some Restricted Plane partitions and Associated Lattice Paths S. Bedi Department of Mathematics, D.A.V College, Sector 10 Chandigarh - 160010, India Abstract. Anand and Agarwal, (Proc. Indian Acad. Sci.
More informationPattern avoidance in compositions and multiset permutations
Pattern avoidance in compositions and multiset permutations Carla D. Savage North Carolina State University Raleigh, NC 27695-8206 Herbert S. Wilf University of Pennsylvania Philadelphia, PA 19104-6395
More informationCOMPSCI 240: Reasoning Under Uncertainty
COMPSCI 240: Reasoning Under Uncertainty Nic Herndon and Andrew Lan University of Massachusetts at Amherst Spring 2019 Lecture 7: Counting (cont.) Summary of Counting Problems Structure Permutation k-permutation
More informationRandomized Sorting Algorithms Quick sort can be converted to a randomized algorithm by picking the pivot element randomly. In this case we can show th
CSE 3500 Algorithms and Complexity Fall 2016 Lecture 10: September 29, 2016 Quick sort: Average Run Time In the last lecture we started analyzing the expected run time of quick sort. Let X = k 1, k 2,...,
More informationSequences. 1. Number sequences. 2. Arithmetic sequences. Consider the illustrated pattern of circles:
Sequences 1. Number sequences Consider the illustrated pattern of circles: The first layer has just one blue ball. The second layer has three pink balls. The third layer has five black balls. The fourth
More informationCANADIAN MATHEMATICAL OLYMPIAD 2010 PROBLEMS AND SOLUTIONS
CANADIAN MATHEMATICAL OLYMPIAD 2010 PROBLEMS AND SOLUTIONS (1) For a positive integer n, an n-staircase is a figure consisting of unit squares, with one square in the first row, two squares in the second
More informationThe part-frequency matrices of a partition
The part-frequency matrices of a partition William J. Keith, Michigan Tech Michigan Technological University Kliakhandler Conference 2015 August 28, 2015 A partition of an integer n is a sequence λ = (λ
More informationExploring the infinite : an introduction to proof and analysis / Jennifer Brooks. Boca Raton [etc.], cop Spis treści
Exploring the infinite : an introduction to proof and analysis / Jennifer Brooks. Boca Raton [etc.], cop. 2017 Spis treści Preface xiii I Fundamentals of Abstract Mathematics 1 1 Basic Notions 3 1.1 A
More informationUnit 5: Sequences, Series, and Patterns
Unit 5: Sequences, Series, and Patterns Section 1: Sequences and Series 1. Sequence: an ordered list of numerical terms 2. Finite Sequence: has a first term (a beginning) and a last term (an end) 3. Infinite
More informationSymmetric chain decompositions of partially ordered sets
Symmetric chain decompositions of partially ordered sets A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Ondrej Zjevik IN PARTIAL FULFILLMENT OF THE REQUIREMENTS
More informationPATH BUNDLES ON n-cubes
PATH BUNDLES ON n-cubes MATTHEW ELDER Abstract. A path bundle is a set of 2 a paths in an n-cube, denoted Q n, such that every path has the same length, the paths partition the vertices of Q n, the endpoints
More informationFibonacci Number of the Tadpole Graph
Kennesaw State University DigitalCommons@Kennesaw State University Faculty Publications 9-1-2014 Fibonacci Number of the Tadpole Graph Joe DeMaio Kennesaw State University, jdemaio@kennesaw.edu John Jacobson
More informationGenerating Functions of Partitions
CHAPTER B Generating Functions of Partitions For a complex sequence {α n n 0,, 2, }, its generating function with a complex variable q is defined by A(q) : α n q n α n [q n ] A(q). When the sequence has
More informationON THE SLACK EULER PAIR FOR VECTOR PARTITION
#A7 INTEGERS 18 (2018 ON THE SLACK EULER PAIR FOR VECTOR PARTITION Shishuo Fu College of Mathematics and Statistics, Chongqing University, Huxi Campus, Chongqing, P.R. China. fsshuo@cqu.edu.cn Ting Hua
More informationIDENTITIES FOR OVERPARTITIONS WITH EVEN SMALLEST PARTS
IDENTITIES FOR OVERPARTITIONS WITH EVEN SMALLEST PARTS MIN-JOO JANG AND JEREMY LOVEJOY Abstract. We prove several combinatorial identities involving overpartitions whose smallest parts are even. These
More informationSB-LABELINGS AND POSETS WITH EACH INTERVAL HOMOTOPY EQUIVALENT TO A SPHERE OR A BALL
SB-LABELINGS AND POSETS WITH EACH INTERVAL HOMOTOPY EQUIVALENT TO A SPHERE OR A BALL PATRICIA HERSH AND KAROLA MÉSZÁROS Abstract. We introduce a new class of edge labelings for locally finite lattices
More informationFIBONACCI EXPRESSIONS ARISING FROM A COIN-TOSSING SCENARIO INVOLVING PAIRS OF CONSECUTIVE HEADS
FIBONACCI EXPRESSIONS ARISING FROM A COIN-TOSSING SCENARIO INVOLVING PAIRS OF CONSECUTIVE HEADS MARTIN GRIFFITHS Abstract. In this article we study a combinatorial scenario which generalizes the wellknown
More informationRegular Sequences. Eric Rowland. School of Computer Science University of Waterloo, Ontario, Canada. September 5 & 8, 2011
Regular Sequences Eric Rowland School of Computer Science University of Waterloo, Ontario, Canada September 5 & 8, 2011 Eric Rowland (University of Waterloo) Regular Sequences September 5 & 8, 2011 1 /
More informationUnlabelled Structures: Restricted Constructions
Gao & Šana, Combinatorial Enumeration Notes 5 Unlabelled Structures: Restricted Constructions Let SEQ k (B denote the set of sequences of exactly k elements from B, and SEQ k (B denote the set of sequences
More information@&%% Discrete Mathematics There are two problems in the discrete mathematics
@&%% Discrete Mathematics There are two problems in the discrete mathematics part. The first problem consists of 6 independent questions, as 1.1, 1.2, 1.3, 1.4, 1.5 and 1.6. The second problem consists
More informationLEVEL GENERATING TREES AND PROPER RIORDAN ARRAYS
Applicable Analysis and Discrete Mathematics, (008), 69 9 Available electronically at http://pefmathetfbgacyu LEVEL GENERATING TREES AND PROPER RIORDAN ARRAYS D Baccherini, D Merlini, R Sprugnoli We introduce
More informationArticle 12 INTEGERS 11A (2011) Proceedings of Integers Conference 2009 RECURSIVELY SELF-CONJUGATE PARTITIONS
Article 12 INTEGERS 11A (2011) Proceedings of Integers Conference 2009 RECURSIVELY SELF-CONJUGATE PARTITIONS William J. Keith Department of Mathematics, Drexel University, Philadelphia, PA 19104, USA wjk26@math.drexel.edu
More informationCountable and uncountable sets. Matrices.
CS 441 Discrete Mathematics for CS Lecture 11 Countable and uncountable sets. Matrices. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Arithmetic series Definition: The sum of the terms of the
More informationCOM S 330 Lecture Notes Week of Feb 9 13
Monday, February 9. Rosen.4 Sequences Reading: Rosen.4. LLM 4.. Ducks 8., 8., Def: A sequence is a function from a (usually infinite) subset of the integers (usually N = {0,,, 3,... } or Z + = {,, 3, 4,...
More informationA multiplicative deformation of the Möbius function for the poset of partitions of a multiset
Contemporary Mathematics A multiplicative deformation of the Möbius function for the poset of partitions of a multiset Patricia Hersh and Robert Kleinberg Abstract. The Möbius function of a partially ordered
More informationBinomial Coefficient Identities/Complements
Binomial Coefficient Identities/Complements CSE21 Fall 2017, Day 4 Oct 6, 2017 https://sites.google.com/a/eng.ucsd.edu/cse21-fall-2017-miles-jones/ permutation P(n,r) = n(n-1) (n-2) (n-r+1) = Terminology
More informationCounting k-marked Durfee Symbols
Counting k-marked Durfee Symbols Kağan Kurşungöz Department of Mathematics The Pennsylvania State University University Park PA 602 kursun@math.psu.edu Submitted: May 7 200; Accepted: Feb 5 20; Published:
More informationSome 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 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 informationCountable and uncountable sets. Matrices.
Lecture 11 Countable and uncountable sets. Matrices. Instructor: Kangil Kim (CSE) E-mail: kikim01@konkuk.ac.kr Tel. : 02-450-3493 Room : New Milenium Bldg. 1103 Lab : New Engineering Bldg. 1202 Next topic:
More informationPencils of Quadratic Forms over Finite Fields
Southern Illinois University Carbondale OpenSIUC Articles and Preprints Department of Mathematics 2004 Pencils of Quadratic Forms over Finite Fields Robert W. Fitzgerald Southern Illinois University Carbondale,
More informationCONVOLUTION TREES AND PASCAL-T TRIANGLES. JOHN C. TURNER University of Waikato, Hamilton, New Zealand (Submitted December 1986) 1.
JOHN C. TURNER University of Waikato, Hamilton, New Zealand (Submitted December 986). INTRODUCTION Pascal (6-66) made extensive use of the famous arithmetical triangle which now bears his name. He wrote
More informationSome Review Problems for Exam 3: Solutions
Math 3355 Spring 017 Some Review Problems for Exam 3: Solutions I thought I d start by reviewing some counting formulas. Counting the Complement: Given a set U (the universe for the problem), if you want
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 information