Enumeration Problems for a Linear Congruence Equation
|
|
- Jerome Young
- 5 years ago
- Views:
Transcription
1 Enumeration Problems for a Linear Congruence Equation Wun-Seng Chou Institute of Mathematics Academia Sinica and Department of Mathematical Sciences National Chengchi University Taipei, Taiwan, ROC macws@math.sinica.edu.tw Tian-Xiao He Department of Mathematics and Computer Science Illinois Wesleyan University Bloomington, IL , USA the@iwu.edu Peter J.-S. Shiue Department of Mathematical Sciences University of Nevada, Las Vegas Las Vegas, NV , USA shiue@unlv.nevada.edu Corresponding author. This work is partially supported by the National Science Council of Taiwan under the grant number NSC98-25-M The author would like to thank the Department of Mathematical Sciences, University of Nevada at Las Vegas, for the hospitality. This work was partially done while the last two authors were visiting the Institute of Mathe-
2 Dedicated to Prof. Peter Bundschuh for the occasion of his 70th birthday. Abstract Let m 2 and r be integers and let c Z m {0,,..., m }. In this paper, we give an upper bound and a lower bound for the number of unordered solutions x,..., x n Z m of the congruence x + x x r c mod m. Exact formulae are also given when m or r is prime. This solution number involves the Catalan number or generalized Catalan number in some special cases. Moreover, the enumeration problem has interrelationship with the restricted integer partition. Keywords: congruence, Catalan number, generalized Catalan number, integer partition Introduction Consider the congruence equation x + x x n 0 mod n +, where n is a positive integer. It is well-known that the number of unordered solutions x, x 2,..., x n in Z n+ {0,,..., n} with repetition allowed is 2n n+ n Cn, the nth Catalan number see Guy [3] and Stanley [7]. In this paper, we consider the generalized congruence x + x x r c mod m where m 2 and r are integers and c Z m {0,,..., m }. If x a,..., x r a r is a solution of, the multiset {a,..., a r } is called an unordered solution. If the multiset {a,..., a r } is actually a set, we call it an unordered solution without repetition. Note that each unordered solution represents several solutions because the coefficients of are all the same. Moreover, different unordered solutions represent different solutions. In Section 2, we deal with enumeration problems of both unordered solutions and unordered solutions without repetition. One of our results Theorem 4 involves the Catalan numbers and generalized Catalan numbers see Sands [6]. We give an interrelationship with the restricted integer partitions for our problems in Section 3. We give explicit closed forms for numbers of unordered solutions of with either prime m or prime r in Section 4. matics, Academia Sinica, Taiwan. They acknowledge the hospitality and financial support. 2
3 2 Unordered Solutions and Catalan Numbers Let M m,r be the set of all unordered solutions of with c ranging over all numbers in Z m. Every element of M m,r is a multiset containing r numbers in Z m and so, can be uniquely represented by a non-decreasing sequence of r elements in Z m, i.e., M m,r {{a a 2 a r } a,..., a r Z m }. Lemma Let m 2 and r be integers. Then m + r M m,r, r where the number on the right hand side is the usual binomial coefficient. Proof. This is trivial because M m,r is in fact the number of choices with repetition from the set Z m within r times. Let M m,r c be the set of all unordered solutions of. Trivially, M m, c for any 0 c < m. If c c 2, then M m,r c M m,r c 2. So, M m,r M m,r 0 M m,r m is a disjoint union. Lemma 2 Let m 2 and r be integers. For 0 c, c 2, if gcdm, r, c gcdm, r, c 2, then M m,r c M m,r c 2. Proof. Let c Z m and write e gcdm, r, c. For proving this lemma, it is enough to show M m,r c M m,r e. Since gcd m, r, c, there are integers x and y so that c + xr + ym p > m e e e e e e is a prime. So gcdm, p. Let 0 x 0, p 0 m satisfy x x 0 mod m and p p 0 mod m. Then gcdm, p 0 and c + x 0 r p 0 e mod m. Now, define f : M m,r c M m,r p 0 e by f{a,..., a r } {a + x 0,..., a r + x 0 } for all {a,..., a r } M m,r c. It is trivial that f is a bijection. So, M m,r c M m,r p 0 e. On the other hand, define a map g : M m,r e M m,r p 0 e by g{a,..., a r } {p 0 a,..., p 0 a r } for all {a,..., a r } M m,r e. Since gcdm, p 0, g is a bijection. This implies M m,r e M m,r p 0 e. Therefore, M m,r c M m,r e. The following result from this lemma is easy and so its proof is omitted. Corollary 3 Let m 2 and r be positive integers. If gcdm, r, then M m,r 0 M m,r m. 3
4 The last result cannot hold if m and r are not relatively prime. For instance, M 4,2 0 {{0, 0}, {, 3}, {2, 2}}, M 4,2 {{0, }, {2, 3}}, M 4,2 2 {{0, 2}, {, }, {3, 3}}, and M 4,2 3 {{0, 3}, {, 2}}, and so their cardinalities are not identical. The following result is easy to see from Corollary 3 and Lemma. Theorem 4 Let m 2 and r be positive integers. If gcdm, r, then for any integer 0 c < m, we have M m,r c m + r. m r Remark. The anonymous referee points out that Lemma 2 and Theorem 4 can also be proved by the cycle lemma, see Sands [6] for a combinatorial explanation of generalized Catalan numbers by using cycle lemma. Example. Take m n + and r n. Then M n+,n c n+ 2n n Cn is the number of unordered solution of x + + x n c mod n +. Similarly, if m n and r n +, we also have M n,n+ c 2n n n+ 2n n+ n Cn. The interested readers can refer to Stanley [7] and Stanley s website [8] for an extensive list of combinatorial interpretations of Catalan numbers. Furthermore, G. Birkhoff [2] asked in 934 whether or not B n 2n 2n n is an integer. Indeed, Bn C n is an integer for all positive integer n because we have 2n 2n n 2n n n. Example 2. Take m nk + and r n. We have M nk +,n c nk nk + n Cn,k, a generalized Catalan number. If m n and r k n +, then M n,k n+ c nk n nk + nk n n nk nk + n Cn,k. When considering unordered solutions without repetition instead of unordered solutions, we take r m. In the case r m, there is only one c say, c 0 if m is odd while c m if m is even so that has unordered solutions without repetition in 2 fact, there is only one unordered solution {0,,..., }. Let N m,r be the set of all unordered solutions of without repetition with c ranging over all numbers in Z m and let N m,r c be the set of all unordered solutions without repetition for any c in Z m. It is trivial that N m,r m r and Nm,r c0 N m,r c, a disjoint union. Note that Lemma 2 and Corollary 3 still hold. So, if gcdm, r, then N m,r c m m r. From m+r m+r m m+r m r, we have Nm+r,r a M m,r b with 0 a < m + r and 0 b < m, whenever gcdm, r. 4
5 Example 3. Take m 2n + and r n or n +. We have N m,r c 2n n+ n Cn. If m nk+ and r n, then N m,r c nk+ nk+ n C n,k. 2n+ 2n+ n nk nk + n Let m r and let M m,r c; j {{j a a 2 a r }} for 0 c, j < m. Then M m,r c j0 M m,rc; j, a disjoint union. It is trivial that M m,2 c; j if either c 2j or m+j > m+c 2j, and M m,2 c; j 0 otherwise. This terminology will be used in the proof of the following proposition, which gives a relation between M m,r c and N m,r c. Proposition 5 For integers m r > and any integer 0 c < m, r M m,r c r N m,r c + Proof. For 0 c < m, we have M m,r c + i 0 i 0 M m,r c; i k M m,r c i M m,r c i i 0 i i 2 i 2 i 2 i 3 0 Continuing this process, we finally have M m,r c i 0 M m,r c i + + r 2 + r i r 2 k N m,k c a M m,r k a. a0 i M m,r c i ; i 2 i i 2 0 i i i 2 0 M m,r 2 c i i 2 ; i 3. i r 2 i i 2 0 M m,r 2 c i i 2 i M m,r 2 c i i 2 i r 2 M m, c i i r i r 0 i r M m, c i r0 r i j ; i r 2 j 5
6 Let 0 < k < r. For a Z m, the total number of terms M m,r k a in the summation i k i k i k 0 M m,r k c i i k of 2, with a c i i k mod m, equals N m,k c a, the number of unordered solutions without repetition of x + x x k c a mod m. So, i k i k i k 0 M m,r k c i i k a0 N m,kc a M m,r k a. Note that M m, c r j i j; i r if and only if c i i r i r mod m. So, the last term of 2 becomes i r 2 i r i r0 M m, c r j i j; i r N m,r c. Combining together, we get the result. Using this proposition, one can prove that r k0 k m m+r k k r k 0 for integers m r > 0. It seems that the expression for M m,r c is quite complicated in general. The only cases which we can give exact formulae for M m,r c are either m or r is prime. Those formulae will be given in the last section. Here we present a lower bound and an upper bound of M m,r c. Theorem 6 Let m, r 4 and 0 c < m be integers. Then m + r 2 r 3 2 m + r 2i m + 2 M m,rc +, m r r 2i + m 3 i where a denotes the least integer greater than or equal to a and a denotes the greatest integer less than or equal to a. Proof. Note that M m,r c; 0 M m,r c and M m,r c; i M m,r c i i j0 M m,r c i; j for r 2 and i < m. So, M m,r c i0 M m,r c i m + r 2 r i i i M m,r c i; j j0 i M m,r c i; j. j0 6
7 This implies m + r 2 M m,r c M m,r c i; 0 + M m,r c; 0 r i0 m + r 2 m + r 3 + M m,r 2 c r r 2 m + r 3 + M m,r 2 c. r The last inequality holds for all r > 3. Moreover, M m,i c M m,3 c m+2 m 3 see Theorem 8 in Section 4 for i, 2, 3. Iteratedly, we have an upper bound M m,r c r 3 2 m+r 2i i r 2i+ + m+2 m 3. Let M m,r c 0 be a largest one among all values M m,r c, 0 c < m. So, M m,r c 0 m+r 2 m r. For 0 c < m, define f : Mm,r c 0 M m,r c by f{y,..., y r } {c c 0, y,..., y r }. Then f is injective and so we get a lower bound M m,r c M m,r c 0 m+r 2 m r. 3 Interrelationship with the restricted integer partitions In this section, we are going to give two interrelationships with the restricted integer partitions for M m,r c. 3. First interrelationship For 0 c < m, M m,r c is the total number of integral solutions of equations x + x x r km + c, 0 k < r, with 0 x x r m. 3 For 0 k < r, each unordered solution of 3 represents a restricted partition of km + c into at most r parts with each part m. For each non-negative integer n, let p,r n be the number of restricted partitions of n into at most r parts, each m, with the convention p,r 0. Let G,r x n0 p,rnx n be the generating function of restricted partitions of non-negative integers into at most 7
8 r parts with each part m. According to Theorem 3. in [], G,r x xm+r x r+. 4 x x Note that for 0 k < r, the number of solutions of x + x x r km + c with 0 x x r m equals p,r km + c. From 3, r r [ M m,r c p,r km + c ] x km+c G,r x, 5 k0 where [ x l] G,r x is the coefficient of the term x l in G,r x. As an example, consider the case m 6 and r 3. Using 4, we have G 5,3 x x 8 x 7 x 6 x 5 x 4 / x 5 x 4 x 3 x 2 x x 5 +x 4 +2x 3 +3x 2 +4x +5x 0 +6x 9 +6x 8 +6x 7 +6x 6 +5x 5 +4x 4 +3x 3 +2x 2 +x+. By 5, we get M 6,3 0 2 k0 [x6k ]G 5,3 x , M 6 3 6,3 2 k0 [x6k+ ]G 5,3 x 9 6+2, M 6 3 6,3 2 2 k0 [x6k+2 ]G 5,3 x 9 6+2, 6 3 M 6,3 3 2 k0 [x6k+3 ]G 5,3 x 0 6+2, M 6 3 6,3 4 k0 [x6k+4 ]G 5,3 x 9 6+2, and M 6 3 6,3 5 k0 [x6k+5 ]G 5,3 x These are 6 3 consistent to the results computed by Theorem 8 in next section. Write y r x, y r x 2 x,..., y x r x r. Then 3 becomes k0 y + 2y ry r km + c, 0 k < r, with y,..., y r 0 and y + + y r m. 6 Since the changing variable y r x, y r x 2 x,..., y x r x r is linear and non-singular, the total number of solutions y,..., y r of 6 is equal to M m,r c. Moreover, for 0 k < r, the equation y +2y 2 + +ry r km+c with y,..., y r 0 and y + +y r represents a restricted partition of km+c into at most parts with each part r. As in the last paragraph, let p r, n be the number of restricted partitions of n into at most parts, each part r, with the convention p r, 0, and let G r, x n0 p r,nx n be the generating function. According to Theorem 3. in [] again, we have G r, x xm+r x m. 7 x r x It is easy to see that G r, x G,r x. So, using 6 to compute M m,r c is the same as using 3 to compute M m,r c. 8
9 3.2 Second interrelationship Denote x r+ m and write y r+ x, y r x 2 x,..., y x r+ x r. Then 3 becomes y + 2y r + y r+ km + c, k < r +, with y,..., y r+ 0 and y + + y r+ m. 8 For any integer l, n 0, let q r+ l, n be the number of restricted partitions of n into l parts, each part r +, with the convention q r+ l, 0 q r+ 0, n. Let H r+ y, z l0 n0 q r+l, ny l z n. Then H r+ y, z by formula 2.. in []. From 8, we have r+ i yz i 9 M m,r c r q r+ m, km + c k r [ y z km+c ] H r+ y, z. 0 k As an example, considering the case of m 2 and r 2l, we have 2l M 2,2l c k [ ] 2l+ yz 2k+c i { l +, c 0 yz i l, c. These results are consistent with the results obtained by Theorem 7 in next section. Note that even though we know the exact forms 7 and 9, it seems that there is no computationally closed form for either p r, km + c or q r+ m, km + c. So, it is not easy to get an exact form for M m,r c using either 5 or 0. However, there are algorithms to compute both p r, n and q r+ m, km + c see [4] and [5] for instance. One might employ those algorithms and either 5 or 0 to compute the number M m,r c. 4 Some special cases for M m,r c In this section, we compute M m,r c whenever either m or r is prime. 9
10 Theorem 7 Let m be a prime number. Then, for any positive integer r, { m+r M m,r c m r if c 0 mod m, m+r if c 0 mod m. m r Proof. If gcdm, r, the theorem holds by Theorem 4. So, we consider only that m and r are not relatively prime. Then, gcdm, r m and r m because m is prime. For any 0 c < m, M m,r c + i 0 i 0 M m,r c; i M m,r c i M m,r c i i 0 i i 2 i 2 i 2 i 3 0 Continuing this process, we finally have M m,r c i 0 M m,r c i + m 2 i m 2 i M m,r c i ; i 2 i i 2 0 i i i 2 0 M m,r 2 c i i 2 ; i 3. i i 2 0 M m,r 2 c i i 2 i M m,r 2 c i i i m 2 M m,r m+ c i i i 0 + M m,r m+ c j j; 0 Write r tm. We show the result by induction on t. At first, let t. If m 2, the last term of is M m, c ; 0 if c, and M m, c ; 0 0 if c 0. So, the theorem holds. If m is an odd prime, the last term of becomes M m, c mm /2; 0 M m, c; 0 if c 0 and M m, c; 0 0 if c 0. Hence, the theorem also holds in this case. Finally, assume r tm with t > and that the theorem holds for r < tm. The last term of becomes M m,r m c mm /2. By the assumption of 0
11 induction, M m,r m 0 m/2 M m,r m c m/2 + for any c 0. By the assumption again, the theorem holds because of Theorem 4. Theorem 8 Let r 2 be a prime number. Then for integers m > and 0 c < m, { m+r M m,r c m r if c 0 mod r, m+r if c 0 mod r. m r Proof. If gcdm, r, the theorem holds by Theorem 4. So, let m lr for some positive integer l. If l, the theorem holds by Theorem 7. Hence, let l >. Since r is prime, gcdm, r, c is either or r for any integer 0 c < m. From Lemma 2, we only consider either c 0 or c. We are going to show M lr,r 0 M r,lr 0 and M lr,r M r,lr. Let G lr,r x and G r,lr x be generating functions, respectively, as those defined in the last section. Write G lr,r x lr r i0 a i x i and G r,lr x r lr i0 c i x i. Then we have M lr,r 0 r k0 a klr, M lr,r r k0 a klr+, M r,lr 0 lr k0 c kr, and M r,lr lr k0 c kr+ from 5. As in 4 and 7, G lr,r x x lr+r x lr / x r x and G r,lr x G lr,r x x lr+r x lr+ / x r x. These imply x r G lr,r x x lr G r,lr x lr 2 i0 b ix i. Multiplying out both sides of the first equality, we have r a i x i + i0 lr i0 c i x i + lr r ir lrr ilr a i a i r x i c i c i lr x i r lr 2 a lr 2r+i x lr r+i b i x i i lr i c lrr 2+i x lrr +i The first equality implies that a kr+j k i0 b ir+j for all 0 k lr and for all 0 j < r. Combining with the second equality, we have M lr,r 0 r k0 a klr r kl k0 i0 b ir rb 0 +r l i b ir + + r l ir 2l+ b ir r l i0 c ir M r,lr 0. Similarly, we have M lr,r M r,lr. Since r is prime, M r,lr 0 lr+r r lr and Mr,lr lr+r r lr by Theorem 7. From lr+r lr r lr+r r lr, we have Mlr,r 0 lr lr+r r and Mlr,r. This completes the proof. lr lr+r r i0
12 In general, the numbers M m,r c may not assume only two values as those in Theorems 7 and 8. For instance, M 4,4 0 0, M 4,4 M 4,4 3 8, and M 4,4 2 9, which means that M 4,4 c takes 3 values. On the other hand, M m,r c might takes two values even though gcdm, n. For instance, M 4,2 c has only values 3 and 2 as we have seen right after Corollary 3. Unfortunately, we are unable to give simple expressions as those stated in theorems above for arbitrary m and r. Acknowledgements: We would like to thank Professor Zhi-Wei Sun, Nanjing University, PRC, for his data support of Theorem 8. Authors would like to express their gratitude to the anonymous referee for his/her helpfull comments and remarks that led to an improved/revised version of the original manuscript. References [] G. E. Andrews, The Theory of Partitions, Encyclo. Math. Its Appls. vol. 2, Addison-Wesley, Reading, Mass.-London-Amsterdam, 976. [2] G. Birkhoff, Problem 3674, Amer. Math. Monthly 4 934, 269. [3] R. K. Guy, Parker s permutation problem involves the Catalan numbers, Amer. Math. Monthly 00 March, 993, [4] J. D. Opdyke, A unified approach to algorithms generating unrestricted and restricted integer compositions and intefer partitions, J. Math. Model Algor , [5] L. A. Sanchis and M. B. Squire, Parallel algorithms for counting and randomly generating integer partitions, J. Paral. Distrib. Computing , [6] A. D. Sands, On generalized Catalan numbers, Discrete Math , [7] R. P. Stanley, Enumerative Combinatorics, vol. 2, Cambridge Stud. Adv. Math. vol. 62, Cambridge Univ. Press, Camabridge, 998. [8] R. P. Stanley, Catalan Addendum, 2
Department of Mathematics, Nanjing University Nanjing , People s Republic of China
Proc Amer Math Soc 1382010, no 1, 37 46 SOME CONGRUENCES FOR THE SECOND-ORDER CATALAN NUMBERS Li-Lu Zhao, Hao Pan Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic
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 informationA bijective proof of Shapiro s Catalan convolution
A bijective proof of Shapiro s Catalan convolution Péter Hajnal Bolyai Institute University of Szeged Szeged, Hungary Gábor V. Nagy {hajnal,ngaba}@math.u-szeged.hu Submitted: Nov 26, 2013; Accepted: May
More informationThe cycle polynomial of a permutation group
The cycle polynomial of a permutation group Peter J. Cameron School of Mathematics and Statistics University of St Andrews North Haugh St Andrews, Fife, U.K. pjc0@st-andrews.ac.uk Jason Semeraro Department
More informationApplication of Polynomial Interpolation in the Chinese Remainder Problem
Journal of Mathematical Research with Applications Jan., 017, Vol. 37, No. 1, pp. 90 96 DOI:10.3770/j.issn:095-651.017.01.008 Http://jmre.dlut.edu.cn Application of Polynomial Interpolation in the Chinese
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 informationDISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k
DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k RALF BUNDSCHUH AND PETER BUNDSCHUH Dedicated to Peter Shiue on the occasion of his 70th birthday Abstract. Let F 0 = 0,F 1 = 1, and F n = F n 1 +F
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 informationYi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)
SELF-INVERSE SEQUENCES RELATED TO A BINOMIAL INVERSE PAIR Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China (Submitted June 2002) 1 INTRODUCTION Pairs of
More informationk 2r n k n n k) k 2r+1 k 2r (1.1)
J. Number Theory 130(010, no. 1, 701 706. ON -ADIC ORDERS OF SOME BINOMIAL SUMS Hao Pan and Zhi-Wei Sun Abstract. We prove that for any nonnegative integers n and r the binomial sum ( n k r is divisible
More informationOn the Convergence of the Summation Formulas Constructed by Using a Symbolic Operator Approach
On the Convergence of the Summation Formulas Constructed by Using a Symbolic Operator Approach Tian-Xiao He 1, Leetsch C. Hsu 2, and Peter J.-S. Shiue 3 1 Department of Mathematics and Computer Science
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 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 informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationImpulse Response Sequences and Construction of Number Sequence Identities
Impulse Response Sequences and Construction of Number Sequence Identities Tian-Xiao He Department of Mathematics Illinois Wesleyan University Bloomington, IL 6170-900, USA Abstract As an extension of Lucas
More informationThe Wiener Polynomial of a Graph
The Wiener Polynomial of a Graph Bruce E. Sagan 1 Department of Mathematics, Michigan State University, East Lansing, MI 48824-1027, U.S.A. Yeong-Nan Yeh 2 Institute of Mathematics, Academia Sinica, Nankang,
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
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 informationCombinatorial results for certain semigroups of partial isometries of a finite chain
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 58() (014), Pages 65 75 Combinatorial results for certain semigroups of partial isometries of a finite chain F. Al-Kharousi Department of Mathematics and Statistics
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 informationThe enumeration of simple permutations
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 6 (2003), Article 03.4.4 The enumeration of simple permutations M. H. Albert and M. D. Atkinson Department of Computer Science University of Otago Dunedin
More informationGENERALIZATIONS OF SOME ZERO-SUM THEOREMS. Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad , INDIA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A52 GENERALIZATIONS OF SOME ZERO-SUM THEOREMS Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad
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 information(n = 0, 1, 2,... ). (2)
Bull. Austral. Math. Soc. 84(2011), no. 1, 153 158. ON A CURIOUS PROPERTY OF BELL NUMBERS Zhi-Wei Sun and Don Zagier Abstract. In this paper we derive congruences expressing Bell numbers and derangement
More informationNew infinite families of congruences modulo 8 for partitions with even parts distinct
New infinite families of congruences modulo for partitions with even parts distinct Ernest X.W. Xia Department of Mathematics Jiangsu University Zhenjiang, Jiangsu 212013, P. R. China ernestxwxia@13.com
More informationA GENERALIZATION OF THE FARKAS AND KRA PARTITION THEOREM FOR MODULUS 7
A GENERALIZATION OF THE FARKAS AND KRA PARTITION THEOREM FOR MODULUS 7 S. OLE WARNAAR Dedicated to George Andrews on the occasion of his 65th birthday Abstract. We prove generalizations of some partition
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 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 informationA New Identity for Complete Bell Polynomials Based on a Formula of Ramanujan
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 12 (2009, Article 09.3. A New Identity for Complete Bell Polynomials Based on a Formula of Ramanujan Sadek Bouroubi University of Science and Technology
More informationNewton, Fermat, and Exactly Realizable Sequences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.2 Newton, Fermat, and Exactly Realizable Sequences Bau-Sen Du Institute of Mathematics Academia Sinica Taipei 115 TAIWAN mabsdu@sinica.edu.tw
More information1. Introduction
Séminaire Lotharingien de Combinatoire 49 (2002), Article B49a AVOIDING 2-LETTER SIGNED PATTERNS T. MANSOUR A AND J. WEST B A LaBRI (UMR 5800), Université Bordeaux, 35 cours de la Libération, 33405 Talence
More informationThe Gaussian coefficient revisited
The Gaussian coefficient revisited Richard EHRENBORG and Margaret A. READDY Abstract We give new -(1+)-analogue of the Gaussian coefficient, also now as the -binomial which, lie the original -binomial
More informationCongruence Classes of 2-adic Valuations of Stirling Numbers of the Second Kind
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 16 (2013), Article 13.3.6 Congruence Classes of 2-adic Valuations of Stirling Numbers of the Second Kind Curtis Bennett and Edward Mosteig Department
More informationCOMBINATORIAL COUNTING
COMBINATORIAL COUNTING Our main reference is [1, Section 3] 1 Basic counting: functions and subsets Theorem 11 (Arbitrary mapping Let N be an n-element set (it may also be empty and let M be an m-element
More informationAnother Proof of Nathanson s Theorems
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 (2011), Article 11.8.4 Another Proof of Nathanson s Theorems Quan-Hui Yang School of Mathematical Sciences Nanjing Normal University Nanjing 210046
More informationarxiv: v1 [math.co] 22 May 2014
Using recurrence relations to count certain elements in symmetric groups arxiv:1405.5620v1 [math.co] 22 May 2014 S.P. GLASBY Abstract. We use the fact that certain cosets of the stabilizer of points are
More informationOn certain combinatorial expansions of the Legendre-Stirling numbers
On certain combinatorial expansions of the Legendre-Stirling numbers Shi-Mei Ma School of Mathematics and Statistics Northeastern University at Qinhuangdao Hebei, P.R. China shimeimapapers@163.com Yeong-Nan
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More informationProducts of Factorials Modulo p
Products of Factorials Modulo p Florian Luca and Pantelimon Stănică IMATE, UNAM, Ap. Postal 6-3 Xangari, CP. 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx Auburn University Montgomery,
More informationMACMAHON S PARTITION ANALYSIS IX: k-gon PARTITIONS
MACMAHON S PARTITION ANALYSIS IX: -GON PARTITIONS GEORGE E. ANDREWS, PETER PAULE, AND AXEL RIESE Dedicated to George Szeeres on the occasion of his 90th birthday Abstract. MacMahon devoted a significant
More informationMATH39001 Generating functions. 1 Ordinary power series generating functions
MATH3900 Generating functions The reference for this part of the course is generatingfunctionology by Herbert Wilf. The 2nd edition is downloadable free from http://www.math.upenn. edu/~wilf/downldgf.html,
More informationApplications of Riordan matrix functions to Bernoulli and Euler polynomials
Illinois Wesleyan University From the SelectedWors of Tian-Xiao He 06 Applications of Riordan matrix functions to Bernoulli and Euler polynomials Tian-Xiao He Available at: https://worsbepresscom/tian_xiao_he/78/
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 informationMATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology.
MATH 501 Discrete Mathematics Lecture 6: Number theory Prof. Dr. Slim Abdennadher, slim.abdennadher@guc.edu.eg German University Cairo, Department of Media Engineering and Technology 1 Number theory Number
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE. 1. Introduction
ENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE BRENDON RHOADES Abstract. Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects
More informationEquidivisible consecutive integers
& Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics
More informationAn Application of Catalan Numbers on Cayley Tree of Order 2: Single Polygon Counting
BULLETIN of the Malaysian Mathematical Sciences Society http://math.usm.my/bulletin Bull. Malays. Math. Sci. Soc. (2) 31(2) (2008), 175 183 An Application of Catalan Numbers on Cayley Tree of Order 2:
More informationDepartment of Computer Science, University of Otago
Department of Computer Science, University of Otago Technical Report OUCS-2003-05 The enumeration of simple permutations M.H.Albert, M.D.Atkinson Department of Computer Science, University of Otago M.Klazar
More informationThis paper was published in Connections in Discrete Mathematics, S. Butler, J. Cooper, and G. Hurlbert, editors, Cambridge University Press,
This paper was published in Connections in Discrete Mathematics, S Butler, J Cooper, and G Hurlbert, editors, Cambridge University Press, Cambridge, 2018, 200-213 To the best of my knowledge, this is the
More informationREFINEMENTS OF SOME PARTITION INEQUALITIES
REFINEMENTS OF SOME PARTITION INEQUALITIES James Mc Laughlin Department of Mathematics, 25 University Avenue, West Chester University, West Chester, PA 9383 jmclaughlin2@wcupa.edu Received:, Revised:,
More informationA quasisymmetric function generalization of the chromatic symmetric function
A quasisymmetric function generalization of the chromatic symmetric function Brandon Humpert University of Kansas Lawrence, KS bhumpert@math.ku.edu Submitted: May 5, 2010; Accepted: Feb 3, 2011; Published:
More information#A22 INTEGERS 17 (2017) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS
#A22 INTEGERS 7 (207) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS Shane Chern Department of Mathematics, Pennsylvania State University, University Park, Pennsylvania shanechern@psu.edu Received: 0/6/6,
More informationEQUIDISTRIBUTION AND SIGN-BALANCE ON 132-AVOIDING PERMUTATIONS. Toufik Mansour 1,2
Séminaire Lotharingien de Combinatoire 5 (2004), Article B5e EQUIDISTRIBUTION AND SIGN-BALANCE ON 32-AVOIDING PERMUTATIONS Toufik Mansour,2 Department of Mathematics, Chalmers University of Technology
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 informationSOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ω(q) AND ν(q) S.N. Fathima and Utpal Pore (Received October 13, 2017)
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 47 2017), 161-168 SOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ωq) AND νq) S.N. Fathima and Utpal Pore Received October 1, 2017) Abstract.
More informationOn Certain Sums of Stirling Numbers with Binomial Coefficients
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 18 (2015, Article 15.9.6 On Certain Sums of Stirling Numbers with Binomial Coefficients H. W. Gould Department of Mathematics West Virginia University
More informationProof of a Conjecture of Erdős on triangles in set-systems
Proof of a Conjecture of Erdős on triangles in set-systems Dhruv Mubayi Jacques Verstraëte November 11, 005 Abstract A triangle is a family of three sets A, B, C such that A B, B C, C A are each nonempty,
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 6: Counting
Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 39 Chapter Summary The Basics
More information1 Take-home exam and final exam study guide
Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationCongruences modulo high powers of 2 for Sloane s box stacking function
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume (009), Pages 55 6 Congruences modulo high powers of for Sloane s box stacking function Øystein J. Rødseth Department of Mathematics University of Bergen, Johs.
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 informationCongruence successions in compositions
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 16:, 014, 37 338 Congruence successions in compositions Toufik Mansour 1 Mark Shattuck Mark C. Wilson 3 1 Department of Mathematics, University
More informationA lattice point problem and additive number theory
A lattice point problem and additive number theory Noga Alon and Moshe Dubiner Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract
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 informationApplication of Logic to Generating Functions. Holonomic (P-recursive) Sequences
Application of Logic to Generating Functions Holonomic (P-recursive) Sequences Johann A. Makowsky Faculty of Computer Science, Technion - Israel Institute of Technology, Haifa, Israel http://www.cs.technion.ac.il/
More information6 CARDINALITY OF SETS
6 CARDINALITY OF SETS MATH10111 - Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means
More informationMathematical Structures Combinations and Permutations
Definitions: Suppose S is a (finite) set and n, k 0 are integers The set C(S, k) of k - combinations consists of all subsets of S that have exactly k elements The set P (S, k) of k - permutations consists
More informationEVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS
EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS CHARLES HELOU AND JAMES A SELLERS Abstract Motivated by a recent work about finite sequences where the n-th term is bounded by n, we evaluate some classes
More informationSome congruences for Andrews Paule s broken 2-diamond partitions
Discrete Mathematics 308 (2008) 5735 5741 www.elsevier.com/locate/disc Some congruences for Andrews Paule s broken 2-diamond partitions Song Heng Chan Division of Mathematical Sciences, School of Physical
More informationTheoretical Computer Science
Theoretical Computer Science 411 (2010) 3224 3234 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs N-player partizan games Alessandro
More informationProbabilistic Proofs of Existence of Rare Events. Noga Alon
Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationNew congruences for overcubic partition pairs
New congruences for overcubic partition pairs M. S. Mahadeva Naika C. Shivashankar Department of Mathematics, Bangalore University, Central College Campus, Bangalore-560 00, Karnataka, India Department
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More informationPart IA. Numbers and Sets. Year
Part IA Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2017 19 Paper 4, Section I 1D (a) Show that for all positive integers z and n, either z 2n 0 (mod 3) or
More information7.11 A proof involving composition Variation in terminology... 88
Contents Preface xi 1 Math review 1 1.1 Some sets............................. 1 1.2 Pairs of reals........................... 3 1.3 Exponentials and logs...................... 4 1.4 Some handy functions......................
More informationBinary Partitions Revisited
Binary Partitions Revisited Øystein J. Rødseth and James A. Sellers Department of Mathematics University of Bergen Johs. Brunsgt. N 5008 Bergen, Norway rodseth@mi.uib.no Department of Science and Mathematics
More informationPERIODIC POINTS OF THE FAMILY OF TENT MAPS
PERIODIC POINTS OF THE FAMILY OF TENT MAPS ROBERTO HASFURA-B. AND PHILLIP LYNCH 1. INTRODUCTION. Of interest in this article is the dynamical behavior of the one-parameter family of maps T (x) = (1/2 x
More informationON DIVISIBILITY OF SOME POWER SUMS. Tamás Lengyel Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (007, #A4 ON DIVISIBILITY OF SOME POWER SUMS Tamás Lengyel Department of Mathematics, Occidental College, 600 Campus Road, Los Angeles, USA
More informationReverse mathematics and marriage problems with unique solutions
Reverse mathematics and marriage problems with unique solutions Jeffry L. Hirst and Noah A. Hughes January 28, 2014 Abstract We analyze the logical strength of theorems on marriage problems with unique
More information= (q) M+N (q) M (q) N
A OVERPARTITIO AALOGUE OF THE -BIOMIAL COEFFICIETS JEHAE DOUSSE AD BYUGCHA KIM Abstract We define an overpartition analogue of Gaussian polynomials (also known as -binomial coefficients) as a generating
More informationAlexander M. Blokh and Ethan M. Coven
SHARKOVSKIĬ TYPE OF CYCLES Alexander M. Blokh and Ethan M. Coven Abstract. The Sharkovskiĭ type of a map of an interval is the Sharkovskiĭ-greatest integer t such that it has a periodic point of period
More informationMATH 3330 ABSTRACT ALGEBRA SPRING Definition. A statement is a declarative sentence that is either true or false.
MATH 3330 ABSTRACT ALGEBRA SPRING 2014 TANYA CHEN Dr. Gordon Heier Tuesday January 14, 2014 The Basics of Logic (Appendix) Definition. A statement is a declarative sentence that is either true or false.
More informationTHE RALEIGH GAME. Received: 1/6/06, Accepted: 6/25/06. Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7(2) (2007), #A13 THE RALEIGH GAME Aviezri S. Fraenkel 1 Department of Computer Science and Applied Mathematics, Weizmann Institute of Science,
More information= i 0. a i q i. (1 aq i ).
SIEVED PARTITIO FUCTIOS AD Q-BIOMIAL COEFFICIETS Fran Garvan* and Dennis Stanton** Abstract. The q-binomial coefficient is a polynomial in q. Given an integer t and a residue class r modulo t, a sieved
More informationZhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China. Received 8 July 2005; accepted 2 February 2006
Adv in Appl Math 382007, no 2, 267 274 A CONNECTION BETWEEN COVERS OF THE INTEGERS AND UNIT FRACTIONS Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing 20093, People s Republic of China
More informationA Simple Proof of the Aztec Diamond Theorem
A Simple Proof of the Aztec Diamond Theorem Sen-Peng Eu Department of Applied Mathematics National University of Kaohsiung Kaohsiung 811, Taiwan, ROC speu@nuk.edu.tw Tung-Shan Fu Mathematics Faculty National
More informationArithmetic Progressions with Constant Weight
Arithmetic Progressions with Constant Weight Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel e-mail: raphy@oranim.macam98.ac.il Abstract Let k n be two positive
More informationImpulse Response Sequences and Construction of Number Sequence Identities
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 16 (013), Article 13.8. Impulse Response Sequences and Construction of Number Sequence Identities Tian-Xiao He Department of Mathematics Illinois Wesleyan
More informationSymmetric functions and the Vandermonde matrix
J ournal of Computational and Applied Mathematics 172 (2004) 49-64 Symmetric functions and the Vandermonde matrix Halil Oruç, Hakan K. Akmaz Department of Mathematics, Dokuz Eylül University Fen Edebiyat
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 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 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 informationEXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES
#A7 INTEGERS 15A (2015) EXTENDING A THEOREM OF PILLAI TO QUADRATIC SEQUENCES Joshua Harrington Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania JSHarrington@ship.edu Lenny
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 informationDistance labelings: a generalization of Langford sequences
Also available at http://amc-journal.eu ISSN -9 (printed edn.), ISSN -9 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA (0) Distance labelings: a generalization of Langford sequences S. C. López Departament
More information