EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS

Size: px
Start display at page:

Download "EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS"

Transcription

1 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 of determinants such as the n n determinant n xn x k + h n k k n, for n 3, 0 h n 3 and more generally the n n determinant D n xi + j i i n, for n, where n, k, h, i, j are integers, x k k n is a sequence of indeterminates over C and A B is the usual binomial coefficient We thus prove that D n and n n n 3 Keywords: Determinants, binomial coefficients, row reduction AMS Classification Numbers: Primary C0; Secondary 05A0, B65, 5B36 Introduction In a recent work [9] about finite sequences whose n-th term does not exceed n, there appeared the determinant n n k + h n k k n, 0 h n 3 with an integer n 3 One of the authors of [9], L Haddad, conjectured after some computations that n ± The authors of the present paper first proved that n n n 3, essentially by a process of row reduction Then, following a suggestion by G E Andrews that this result should be true in a more general context, namely upon replacing n by x n and k by x k, where x k k n is an arbitrary sequence of indeterminates over C, the proof was extended to this general case We then

2 CHARLES HELOU AND JAMES A SELLERS realized that the problem can be reduced to the evaluation of a simpler, more general family of determinants, namely D n xi + j i i n, for all integers n In what follows, we will establish that D n and deduce that n n n 3 Results of a similar nature, involving determinants of matrices whose entries involve binomial coefficients, can be found in [,, 3, 4, 6, 0, ] In contrast to these papers, we note that our determinant evaluations are strikingly simple and easy to state In fact, our result is a special case of the results contained in [0], but our proof is more elementary, using only row reduction and induction We are thankful to L Haddad for his conjecture and to G E Andrews for his insightful suggestion The method of proof First recall eg [7] or [8] that for an indeterminate x over C and an integer n 0, the binomial coefficient x n is defined by x x x x x n +, n n! with the convention that x 0 It satisfies the fundamental recurrence relation x x x + +, for all n 0 n n + n + Let x k k n be a sequence of indeterminates over C, with n 3, and consider the n n determinant n n x,, x n xn x k + h n k k n 0 h n 3 First, setting i k and j h + allows one to rewrite n as n xn x i+ + j n i i n Second, the substitution i n i transforms n into n nx,, x n xn x n i + j i i n,

3 EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS 3 which has the same rows as n but in reverse order This order reversal consists in respectively swapping each row of n with all the rows above it The total number of those row swaps is n n 3 n 3 + n Therefore, n n n 3 n 3 The problem is thus reduced to the determination of n Third, setting x x n gives n x xn i + j i i n 4 Fourth, setting y i x x n i yields n yi + j i i n 5 Finally, setting m n leads to the equality n yi + j i i m 6 j m The problem is thus reduced to the evaluation of the family of determinants D n D n x,, x n xi + j i i n, 7 for n, where x, x,, x n are arbitrary indeterminates Our primary result is now the following: Theorem For any positive integer n, we have D n The proof proceeds by row reduction and is presented in the next section Corollary For any integer n 3, we have n Proof This follows from 6 and Theorem Corollary 3 For any integer n 3, we have n n n 3 Proof This follows from 3 and Corollary

4 4 CHARLES HELOU AND JAMES A SELLERS Remark 4 An alternative method for deriving the last result is to set y k x n x n k, and i k, j h + Then n yn i + j n i i n Now, reversing the order of the rows, which consists in replacing i by n i, transforms n into n yi + j i i n Moreover, the permutation ρ that reverses the n rows of n has n orbits, namely {, n }, {, n 3}, It follows that see, eg, [] the sign of ρ is ɛ ρ n n n Hence n n n n, in view of our main theorem, which yields n 3 The proof of the main Theorem We start with two results about binomial coefficients that will be used in the proof of Theorem Lemma 3 For any integers 0 a b and n, and any indeterminate x over C, we have x + b x + a b x + h n n n Proof By the fundamental recurrence relation for binomial coefficients, x + x x, n n n for n Hence, by iterating this recurrence numerous times, we have x + b x + a b x + h + x + h b x + h n n n n n ha km ha Lemma 3 For any integers 0 m n, we have n k n + m m + ha

5 EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS 5 Proof For a fixed integer m 0, the proof can be completed by induction on n m Such an argument can be found in [5, p 38] This result also follows from Lemma 3 by taking n m +, a 0, x m, b n m + We now proceed to prove Theorem by row reduction We start with D n d i n, where d xi + j for i, j n, 3 i ie D n x + x +3 x +j x3 + x3 +3 x3 +j x4 + x4 +3 x4 +j x + x3 + x4 + 3 xi + i xn+ n 3 xi + i xn+ n 3 xi +3 i xn+3 n 3 xi +j i xn+j n x +n x3 +n x4 +n 3 xi +n i xn+n n 3 Denoting the i-th row of D n by R i, the first row reduction step consists in replacing R i by R i d i R for i n This gives D n d i n, where { d d d i x i +j i xi + i j xi h i, if i n, j n, d j, if i, j n, 33 the last expression, for i, is obtained by using Lemma 3, with the usual convention that an empty sum is equal to 0 Thus

6 6 CHARLES HELOU AND JAMES A SELLERS 0 j n 0 x3 + x3 h j x3 h n h 0 x4 + x4 D n h j x4 h n h 0 xi + xi i h j xi i h n i h 0 xn+ xn n h j xn n h n n h Moreover, we obviously have Proposition 33 For k n, let D n k x3 x4 xi i xn n 34 D n D n 35 d k i n be the n n determinant obtained from D n by applying k row reduction steps, each of which consists in replacing the i-th row R k i of the determinant, obtained after k such row reduction steps, by the row D k n R k i R k i while the first k rows are unchanged, ie Then d k { j k h d k R k i j h xi k d k ik R k k, for k + i n, R k i for i k i k, if k + i n, j n,, if i k, j n, with the convention that an empty sum here, when j k is equal to 0 36 Proof The proof is by induction on k The first row reduction step was applied to D n right before this Proposition, and it gave D n d i n, which satisfies the stated equalities for d as shown in 33 above So the property holds for k Assume that it holds for k, where k n, ie assume that D n k d k i n satisfies d k { j k h j h k x i i k, if k i n, j n, d k, if i k, j n 37

7 EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS 7 Now, as for k + i n, we have R k i d k d k R k i d k ik d k ik d k kj, for j n, and by the induction assumption, there hold j k+ d k j h k d k kj Therefore we get d k d k ik j k+ h j k+ h j k+ h k k+ h h k h j h j h k j h k k Moreover, by Lemma 3, xi + h for i > k and h Hence j k+ d k j h h k h r Furthermore, by Lemma 3, j k+ j h k Thus hr+ k xi + h xi + h xk + h k k xi + h xi + h j k+ h xi + h r j k xi + r j r sk j k+ h, R k k, ie xi +, j h k xi + r s k xi + r, xi + r j h k j r j k d k j r xi + r, k r for k + i n and j n Also, for i k, since R k i R k i, we have d k k d k, for i k, j n xi + j k+ hr+ j h This shows that the property holds for k, and completes the induction k

8 8 CHARLES HELOU AND JAMES A SELLERS Corollary 34 For k n, the determinant D n k d k i n obtained from D n by applying k row reduction steps as described in Proposition 33 is given by d k { j i, if i k, j n, 38, if k + i n, j n, j k h j h k xi i k where if 0 m < n are integers then m n 0, and an empty sum is equal to 0 Proof Only the expression of d k for i k and j n needs to be proved The rest is contained in Proposition 33 This expression holds for k since by 33 d j d j j, for j n Assume that the expression holds for k, where k < n, ie d k { j i, if i k, j n,, if k i n, j n j k+ h j h k xi i k Then, by Proposition 33 and Lemma 3, we have d k d k j, for i k, j n, i and Hence d k kj d k kj j sk j k+ h s k d k and the expression holds for k j h xk + h k 0 h j, for j n k j k+ j, for i k, j n, i j h k Remark 35 We have D n D n k, since the determinant is invariant under the row reduction steps consisting of adding to a row a multiple of another row

9 In particular, EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS 9 D n n j i i n is the determinant of an upper triangular n n matrix whose diagonal entries are d n ii i i for i n Therefore D n D n n This concludes the proof of Theorem Remark 36 As noted in the Introduction, our result is a special case of the results contained in [0] Indeed, in [0], Proposition, taking p j x x j +x j, which is a polynomial of degree j in x, with leading coefficient a j, j! for j n, we get xj + X i n j i n j! X j X i, j j i<j n then specializing to X i i for i n, we get xj + i n j i n j! i<j n j i 4 Acknowledgment We are thankful to the referee for a careful, thorough reading of the paper, and for many helpful and interesting suggestions References [] T Amdeberhan and D Zeilberger, Determinants through the looking glass, Special issue in honor of Dominique Foata s 65th birthday Philadelphia, PA, 000, Adv in Appl Math 7 00, no -3, 5-30 [] G E Andrews, E Pfaff s method I The Mills-Robbins-Rumsey determinant, Selected papers in honor of Adriano Garsia Taormina, 994, Discrete Math , no 3, [3] G E Andrews and W H Burge, Determinant identities, Pacific J Math , no, -4 [4] G E Andrews and D W Stanton, Determinants in plane partition enumeration, European J Combin 9 998, no 3, 73-8 [5] R Brualdi, Introductory Combinatorics, Fifth Edition, Pearson Prentice Hall, 00 [6] W Chu and L V di Claudio, Binomial determinant evaluations, Ann Comb 9 005, no 4, [7] L Comtet, Advanced Combinatorics, D Reidel Publishing Co, Dordrecht, 974 [8] R Graham, D Knuth, O Patashnik, Concrete Mathematics, second edition, Addison- Wesley, 994

10 0 CHARLES HELOU AND JAMES A SELLERS [9] L Haddad and C Helou, Finite Sequences Dominated by the Squares, J Integer Sequences, 8, 05, # 58 [0] C Krattenthaler, Advanced determinant calculus, The Andrews Festschrift Maratea, 998, Sem Lothar Combin 4 999, Art B4q, 67 pp [] S Nelson, Defining the sign of a permutation, Amer Math Monthly , no 6, [] A M Ostrowski, On some determinants with combinatorial numbers, J Reine Angew Math 6 964, 5-30 Penn State Brandywine, 5 Yearsley Mill Road, Media, PA 9063, USA address: cxh@psuedu Penn State University Park, Department of Mathematics, 04 McAllister Building, University Park, PA 680, USA address: sellersj@psuedu

arxiv:math/ v1 [math.co] 13 Jul 2005

arxiv:math/ v1 [math.co] 13 Jul 2005 A NEW PROOF OF THE REFINED ALTERNATING SIGN MATRIX THEOREM arxiv:math/0507270v1 [math.co] 13 Jul 2005 Ilse Fischer Fakultät für Mathematik, Universität Wien Nordbergstrasse 15, A-1090 Wien, Austria E-mail:

More information

ON DIVISIBILITY OF SOME POWER SUMS. Tamás Lengyel Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA.

ON 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 information

Parking cars after a trailer

Parking 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 information

Combinatorial Interpretations of a Generalization of the Genocchi Numbers

Combinatorial Interpretations of a Generalization of the Genocchi Numbers 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.6 Combinatorial Interpretations of a Generalization of the Genocchi Numbers Michael Domaratzki Jodrey School of Computer Science

More information

Investigating Geometric and Exponential Polynomials with Euler-Seidel Matrices

Investigating Geometric and Exponential Polynomials with Euler-Seidel Matrices 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 (2011), Article 11.4.6 Investigating Geometric and Exponential Polynomials with Euler-Seidel Matrices Ayhan Dil and Veli Kurt Department of Mathematics

More information

COMPLEMENTARY FAMILIES OF THE FIBONACCI-LUCAS RELATIONS. Ivica Martinjak Faculty of Science, University of Zagreb, Zagreb, Croatia

COMPLEMENTARY FAMILIES OF THE FIBONACCI-LUCAS RELATIONS. Ivica Martinjak Faculty of Science, University of Zagreb, Zagreb, Croatia #A2 INTEGERS 9 (209) COMPLEMENTARY FAMILIES OF THE FIBONACCI-LUCAS RELATIONS Ivica Martinjak Faculty of Science, University of Zagreb, Zagreb, Croatia imartinjak@phy.hr Helmut Prodinger Department of Mathematics,

More information

ACI-matrices all of whose completions have the same rank

ACI-matrices all of whose completions have the same rank ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices

More information

Evaluation of a family of binomial determinants

Evaluation of a family of binomial determinants Electronc Journal of Lnear Algebra Volume 30 Volume 30 2015 Artcle 22 2015 Evaluaton of a famly of bnomal determnants Charles Helou Pennsylvana State Unversty, cxh22@psuedu James A Sellers Pennsylvana

More information

A hyperfactorial divisibility Darij Grinberg *long version*

A hyperfactorial divisibility Darij Grinberg *long version* A hyperfactorial divisibility Darij Grinberg *long version* Let us define a function H : N N by n H n k! for every n N Our goal is to prove the following theorem: Theorem 0 MacMahon We have H b + c H c

More information

arxiv: v1 [math.co] 3 Nov 2014

arxiv: v1 [math.co] 3 Nov 2014 SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed

More information

arxiv: v1 [math.ca] 7 Mar 2013

arxiv: v1 [math.ca] 7 Mar 2013 A SIMPLE PROOF OF ANDREWS S 5 F 4 EVALUATION IRA M. GESSEL arxiv:1303.1757v1 [math.ca] 7 Mar 2013 Department of Mathematics Brandeis University Waltham, MA 02453 gessel@brandeis.edu Abstract. We give a

More information

An alternative evaluation. of the Andrews{Burge determinant. C. Krattenthaler y. Dedicated to Gian-Carlo Rota

An alternative evaluation. of the Andrews{Burge determinant. C. Krattenthaler y. Dedicated to Gian-Carlo Rota An alternative evaluation of the Andrews{Burge determinant C. Krattenthaler y Dedicated to Gian-Carlo Rota Abstract. We give a short, self-contained evaluation of the Andrews{Burge determinant (Pacic J.

More information

Symmetric functions and the Vandermonde matrix

Symmetric 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 information

Some Congruences for the Partial Bell Polynomials

Some Congruences for the Partial Bell Polynomials 3 47 6 3 Journal of Integer Seuences, Vol. 009), Article 09.4. Some Congruences for the Partial Bell Polynomials Miloud Mihoubi University of Science and Technology Houari Boumediene Faculty of Mathematics

More information

Congruences modulo high powers of 2 for Sloane s box stacking function

Congruences 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 information

Toufik Mansour 1. Department of Mathematics, Chalmers University of Technology, S Göteborg, Sweden

Toufik Mansour 1. Department of Mathematics, Chalmers University of Technology, S Göteborg, Sweden COUNTING OCCURRENCES OF 32 IN AN EVEN PERMUTATION Toufik Mansour Department of Mathematics, Chalmers University of Technology, S-4296 Göteborg, Sweden toufik@mathchalmersse Abstract We study the generating

More information

Combinatorial properties of the numbers of tableaux of bounded height

Combinatorial properties of the numbers of tableaux of bounded height Combinatorial properties of the numbers of tableaux of bounded height Marilena Barnabei, Flavio Bonetti, and Matteo Sibani Abstract We introduce an infinite family of lower triangular matrices Γ (s), where

More information

Noncommutative Abel-like identities

Noncommutative Abel-like identities Noncommutative Abel-like identities Darij Grinberg detailed version draft, January 15, 2018 Contents 1. Introduction 1 2. The identities 3 3. The proofs 7 3.1. Proofs of Theorems 2.2 and 2.4......................

More information

ANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM

ANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM q-hypergeometric PROOFS OF POLYNOMIAL ANALOGUES OF THE TRIPLE PRODUCT IDENTITY, LEBESGUE S IDENTITY AND EULER S PENTAGONAL NUMBER THEOREM S OLE WARNAAR Abstract We present alternative, q-hypergeometric

More information

Enumerating split-pair arrangements

Enumerating split-pair arrangements Journal of Combinatorial Theory, Series A 115 (28 293 33 www.elsevier.com/locate/jcta Enumerating split-pair arrangements Ron Graham 1, Nan Zang Department of Computer Science, University of California

More information

Noncommutative Abel-like identities

Noncommutative Abel-like identities Noncommutative Abel-like identities Darij Grinberg draft, January 15, 2018 Contents 1. Introduction 1 2. The identities 3 3. The proofs 7 3.1. Proofs of Theorems 2.2 and 2.4...................... 7 3.2.

More information

Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)

Yi 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 information

arxiv: v1 [math.co] 18 Oct 2016

arxiv: v1 [math.co] 18 Oct 2016 ON SOME CLASS OF SUMS ANDREI K. SVININ Abstract. We consider some class of the sums which naturally include the sums of powers of integers. We suggest a number of conjectures concerning a representation

More information

Some families of identities for the integer partition function

Some families of identities for the integer partition function MATHEMATICAL COMMUNICATIONS 193 Math. Commun. 0(015), 193 00 Some families of identities for the integer partition function Ivica Martinja 1, and Dragutin Svrtan 1 Department of Physics, University of

More information

Determinants of Partition Matrices

Determinants of Partition Matrices journal of number theory 56, 283297 (1996) article no. 0018 Determinants of Partition Matrices Georg Martin Reinhart Wellesley College Communicated by A. Hildebrand Received February 14, 1994; revised

More information

CONGRUENCES FOR GENERALIZED FROBENIUS PARTITIONS WITH AN ARBITRARILY LARGE NUMBER OF COLORS

CONGRUENCES FOR GENERALIZED FROBENIUS PARTITIONS WITH AN ARBITRARILY LARGE NUMBER OF COLORS #A7 INTEGERS 14 (2014) CONGRUENCES FOR GENERALIZED FROBENIUS PARTITIONS WITH AN ARBITRARILY LARGE NUMBER OF COLORS Frank G. Garvan Department of Mathematics, University of Florida, Gainesville, Florida

More information

Counting Palindromic Binary Strings Without r-runs of Ones

Counting 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 information

TILING PROOFS OF SOME FORMULAS FOR THE PELL NUMBERS OF ODD INDEX

TILING PROOFS OF SOME FORMULAS FOR THE PELL NUMBERS OF ODD INDEX #A05 INTEGERS 9 (2009), 53-64 TILING PROOFS OF SOME FORMULAS FOR THE PELL NUMBERS OF ODD INDEX Mark Shattuck Department of Mathematics, University of Tennessee, Knoxville, TN 37996-1300 shattuck@math.utk.edu

More information

ON SIMILARITIES BETWEEN EXPONENTIAL POLYNOMIALS AND HERMITE POLYNOMIALS

ON SIMILARITIES BETWEEN EXPONENTIAL POLYNOMIALS AND HERMITE POLYNOMIALS Journal of Applied Mathematics and Computational Mechanics 2013, 12(3), 93-104 ON SIMILARITIES BETWEEN EXPONENTIAL POLYNOMIALS AND HERMITE POLYNOMIALS Edyta Hetmaniok, Mariusz Pleszczyński, Damian Słota,

More information

On certain combinatorial expansions of the Legendre-Stirling numbers

On 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 information

arxiv: v2 [math.co] 29 Jun 2016

arxiv: v2 [math.co] 29 Jun 2016 arxiv:1508.04949v2 [math.co] 29 Jun 2016 Complementary Families of the Fibonacci-Lucas Relations Ivica Martinjak Faculty of Science, University of Zagreb Bijenička cesta 32, HR-10000 Zagreb, Croatia Helmut

More information

Counting k-marked Durfee Symbols

Counting 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 information

Pascal Eigenspaces and Invariant Sequences of the First or Second Kind

Pascal Eigenspaces and Invariant Sequences of the First or Second Kind Pascal Eigenspaces and Invariant Sequences of the First or Second Kind I-Pyo Kim a,, Michael J Tsatsomeros b a Department of Mathematics Education, Daegu University, Gyeongbu, 38453, Republic of Korea

More information

ON PARTITION FUNCTIONS OF ANDREWS AND STANLEY

ON 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 information

EQUIDISTRIBUTION AND SIGN-BALANCE ON 132-AVOIDING PERMUTATIONS. Toufik Mansour 1,2

EQUIDISTRIBUTION 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 information

ON CHARACTERS AND DIMENSION FORMULAS FOR REPRESENTATIONS OF THE LIE SUPERALGEBRA

ON CHARACTERS AND DIMENSION FORMULAS FOR REPRESENTATIONS OF THE LIE SUPERALGEBRA ON CHARACTERS AND DIMENSION FORMULAS FOR REPRESENTATIONS OF THE LIE SUPERALGEBRA gl(m N E.M. MOENS Department of Applied Mathematics, Ghent University, Krijgslaan 281-S9, B-9000 Gent, Belgium. e-mail:

More information

On Certain Sums of Stirling Numbers with Binomial Coefficients

On 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 information

ON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES

ON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES ON COST MATRICES WITH TWO AND THREE DISTINCT VALUES OF HAMILTONIAN PATHS AND CYCLES SANTOSH N. KABADI AND ABRAHAM P. PUNNEN Abstract. Polynomially testable characterization of cost matrices associated

More information

MacMahon s Partition Analysis VIII: Plane Partition Diamonds

MacMahon s Partition Analysis VIII: Plane Partition Diamonds MacMahon s Partition Analysis VIII: Plane Partition Diamonds George E. Andrews * Department of Mathematics The Pennsylvania State University University Park, PA 6802, USA E-mail: andrews@math.psu.edu Peter

More information

LOWER BOUNDS FOR A POLYNOMIAL IN TERMS OF ITS COEFFICIENTS

LOWER BOUNDS FOR A POLYNOMIAL IN TERMS OF ITS COEFFICIENTS LOWER BOUNDS FOR A POLYNOMIAL IN TERMS OF ITS COEFFICIENTS MEHDI GHASEMI AND MURRAY MARSHALL Abstract. Recently Lasserre [6] gave a sufficient condition in terms of the coefficients for a polynomial f

More information

A simple explicit bijection between(n,2)-gog and Magog trapezoids

A simple explicit bijection between(n,2)-gog and Magog trapezoids A simple explicit bijection between(n,)-gog and Magog trapezoids Jérémie BETTINELLI April 0, 0 arxiv:.00v [math.co] Apr 0 Abstract A sub-problem of the open problem of finding an explicit bijection between

More information

Some thoughts concerning power sums

Some thoughts concerning power sums Some thoughts concerning power sums Dedicated to the memory of Zoltán Szvetits (929 20 Gábor Nyul Institute of Mathematics, University of Debrecen H 00 Debrecen POBox 2, Hungary e mail: gnyul@scienceunidebhu

More information

EXPONENTIAL POLYNOMIALS, STIRLING NUMBERS, AND EVALUATION OF SOME GAMMA INTEGRALS. Khristo N. Boyadzhiev

EXPONENTIAL POLYNOMIALS, STIRLING NUMBERS, AND EVALUATION OF SOME GAMMA INTEGRALS. Khristo N. Boyadzhiev January 29, 2010 EXPONENTIAL POLYNOMIALS, STIRLING NUMBERS, AND EVALUATION OF SOME GAMMA INTEGRALS Khristo N. Boyadzhiev Department of Mathematics, Ohio Northern University Ada, Ohio 45810, USA k-boyadzhiev@onu.edu

More information

1 Last time: least-squares problems

1 Last time: least-squares problems MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that

More information

arxiv: v2 [math.nt] 4 Jun 2016

arxiv: v2 [math.nt] 4 Jun 2016 ON THE p-adic VALUATION OF STIRLING NUMBERS OF THE FIRST KIND PAOLO LEONETTI AND CARLO SANNA arxiv:605.07424v2 [math.nt] 4 Jun 206 Abstract. For all integers n k, define H(n, k) := /(i i k ), where the

More information

Permutations with Inversions

Permutations with Inversions 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 4 2001, Article 01.2.4 Permutations with Inversions Barbara H. Margolius Cleveland State University Cleveland, Ohio 44115 Email address: b.margolius@csuohio.edu

More information

1. Introduction

1. 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 information

A combinatorial determinant

A combinatorial determinant A combinatorial erminant Herbert S Wilf Department of Mathematics, University of Pennsylvania Philadelphia, PA 19104-6395 Abstract A theorem of Mina evaluates the erminant of a matrix with entries D (f(x)

More information

LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS

LARGE 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 information

COUNTING NONINTERSECTING LATTICE PATHS WITH TURNS

COUNTING NONINTERSECTING LATTICE PATHS WITH TURNS COUNTING NONINTERSECTING LATTICE PATHS WITH TURNS C. Krattenthaler Institut für Mathematik der Universität Wien, Strudlhofgasse 4, A-1090 Wien, Austria. e-mail: KRATT@Pap.Univie.Ac.At Abstract. We derive

More information

MULTI-RESTRAINED STIRLING NUMBERS

MULTI-RESTRAINED STIRLING NUMBERS MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained

More information

A proof of the Square Paths Conjecture

A proof of the Square Paths Conjecture A proof of the Square Paths Conjecture Emily Sergel Leven October 7, 08 arxiv:60.069v [math.co] Jan 06 Abstract The modified Macdonald polynomials, introduced by Garsia and Haiman (996), have many astounding

More information

A Catalan-Hankel Determinant Evaluation

A Catalan-Hankel Determinant Evaluation A Catalan-Hankel Determinant Evaluation Ömer Eğecioğlu Department of Computer Science, University of California, Santa Barbara CA 93106 (omer@cs.ucsb.edu) Abstract Let C k = ( ) 2k k /(k +1) denote the

More information

CONGRUENCES MODULO 2 FOR CERTAIN PARTITION FUNCTIONS

CONGRUENCES MODULO 2 FOR CERTAIN PARTITION FUNCTIONS Bull. Aust. Math. Soc. 9 2016, 400 409 doi:10.1017/s000497271500167 CONGRUENCES MODULO 2 FOR CERTAIN PARTITION FUNCTIONS M. S. MAHADEVA NAIKA, B. HEMANTHKUMAR H. S. SUMANTH BHARADWAJ Received 9 August

More information

THE MAJOR COUNTING OF NONINTERSECTING LATTICE PATHS AND GENERATING FUNCTIONS FOR TABLEAUX Summary

THE MAJOR COUNTING OF NONINTERSECTING LATTICE PATHS AND GENERATING FUNCTIONS FOR TABLEAUX Summary THE MAJOR COUNTING OF NONINTERSECTING LATTICE PATHS AND GENERATING FUNCTIONS FOR TABLEAUX Summary (The full-length article will appear in Mem. Amer. Math. Soc.) C. Krattenthaler Institut für Mathematik

More information

COMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS

COMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS COMPOSITIONS WITH A FIXED NUMBER OF INVERSIONS A. KNOPFMACHER, M. E. MAYS, AND S. WAGNER Abstract. A composition of the positive integer n is a representation of n as an ordered sum of positive integers

More information

arxiv: v1 [math.co] 18 Oct 2018

arxiv: v1 [math.co] 18 Oct 2018 A NEW DETERMINANT FOR THE Q-ENUMERATION OF ALTERNATING SIGN MATRICES FLORIAN AIGNER arxiv:80.080v [math.co] 8 Oct 08 Abstract. Fischer provided a new type of binomial erminant for the number of alternating

More information

REMARKS ON THE PAPER SKEW PIERI RULES FOR HALL LITTLEWOOD FUNCTIONS BY KONVALINKA AND LAUVE

REMARKS ON THE PAPER SKEW PIERI RULES FOR HALL LITTLEWOOD FUNCTIONS BY KONVALINKA AND LAUVE REMARKS ON THE PAPER SKEW PIERI RULES FOR HALL LITTLEWOOD FUNCTIONS BY KONVALINKA AND LAUVE S OLE WARNAAR Abstract In a recent paper Konvalinka and Lauve proved several skew Pieri rules for Hall Littlewood

More information

Counting Matrices Over a Finite Field With All Eigenvalues in the Field

Counting Matrices Over a Finite Field With All Eigenvalues in the Field Counting Matrices Over a Finite Field With All Eigenvalues in the Field Lisa Kaylor David Offner Department of Mathematics and Computer Science Westminster College, Pennsylvania, USA kaylorlm@wclive.westminster.edu

More information

MUTUALLY ORTHOGONAL FAMILIES OF LINEAR SUDOKU SOLUTIONS. 1. Introduction

MUTUALLY ORTHOGONAL FAMILIES OF LINEAR SUDOKU SOLUTIONS. 1. Introduction MUTUALLY ORTHOGONAL FAMILIES OF LINEAR SUDOKU SOLUTIONS JOHN LORCH Abstract For a class of linear sudoku solutions, we construct mutually orthogonal families of maximal size for all square orders, and

More information

Higher Dimensional Lattice Chains and Delannoy Numbers

Higher Dimensional Lattice Chains and Delannoy Numbers Linfield College DigitalCommons@Linfield Faculty Publications Faculty Scholarship & Creative Works -- Higher Dimensional Lattice Chains and Delannoy Numbers John S Caughman Portland State University Charles

More information

Almost Product Evaluation of Hankel Determinants

Almost Product Evaluation of Hankel Determinants Almost Product Evaluation of Hankel Determinants Ömer Eğecioğlu Department of Computer Science University of California, Santa Barbara CA 93106 omer@csucsbedu Timothy Redmond Stanford Medical Informatics,

More information

Bilateral truncated Jacobi s identity

Bilateral 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 information

Hanoi Graphs and Some Classical Numbers

Hanoi Graphs and Some Classical Numbers Hanoi Graphs and Some Classical Numbers Sandi Klavžar Uroš Milutinović Ciril Petr Abstract The Hanoi graphs Hp n model the p-pegs n-discs Tower of Hanoi problem(s). It was previously known that Stirling

More information

NOTES Edited by Sergei Tabachnikov. Probabilistic Proofs of a Binomial Identity, Its Inverse, and Generalizations

NOTES Edited by Sergei Tabachnikov. Probabilistic Proofs of a Binomial Identity, Its Inverse, and Generalizations NOTES Edited by Sergei Tabachniov Probabilistic Proofs of a Binomial Identity, Its Inverse, and Generalizations Michael Z Spivey Abstract We give elementary probabilistic proofs of a binomial identity,

More information

A Note about the Pochhammer Symbol

A Note about the Pochhammer Symbol Mathematica Moravica Vol. 12-1 (2008), 37 42 A Note about the Pochhammer Symbol Aleksandar Petoević Abstract. In this paper we give elementary proofs of the generating functions for the Pochhammer symbol

More information

MULTISECTION METHOD AND FURTHER FORMULAE FOR π. De-Yin Zheng

MULTISECTION METHOD AND FURTHER FORMULAE FOR π. De-Yin Zheng Indian J. pure appl. Math., 39(: 37-55, April 008 c Printed in India. MULTISECTION METHOD AND FURTHER FORMULAE FOR π De-Yin Zheng Department of Mathematics, Hangzhou Normal University, Hangzhou 30036,

More information

Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China

Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China Ramanuan J. 40(2016, no. 3, 511-533. CONGRUENCES INVOLVING g n (x n ( n 2 ( 2 0 x Zhi-Wei Sun Deartment of Mathematics, Naning University Naning 210093, Peole s Reublic of China zwsun@nu.edu.cn htt://math.nu.edu.cn/

More information

Several refined conjectures on TSSCPP and ASM

Several refined conjectures on TSSCPP and ASM 0-0 Several refined conjectures on TSSCPP and ASM Masao Ishikawa Tottori University, ishikawa@fed.tottori-u.ac.jp 1 Contents of this talk 1. Preliminaries (a) Partitions (b) Symmetric functions (c) Alternating

More information

q GAUSS SUMMATION VIA RAMANUJAN AND COMBINATORICS

q 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 information

Enumerating rc-invariant Permutations with No Long Decreasing Subsequences

Enumerating rc-invariant Permutations with No Long Decreasing Subsequences Enumerating rc-invariant Permutations with No Long Decreasing Subsequences Eric S. Egge Department of Mathematics Carleton College Northfield, MN 55057 USA eegge@carleton.edu Abstract We use the Robinson-Schensted-Knuth

More information

arxiv: v1 [math.co] 25 May 2011

arxiv: v1 [math.co] 25 May 2011 arxiv:1105.4986v1 [math.co] 25 May 2011 Gog and Magog triangles, and the Schützenberger involution Hayat Cheballah and Philippe Biane Abstract. We describe an approach to finding a bijection between Alternating

More information

The Generating Functions for Pochhammer

The Generating Functions for Pochhammer The Generating Functions for Pochhammer Symbol { }, n N Aleksandar Petoević University of Novi Sad Teacher Training Faculty, Department of Mathematics Podgorička 4, 25000 Sombor SERBIA and MONTENEGRO Email

More information

Laura Chihara* and Dennis Stanton**

Laura Chihara* and Dennis Stanton** ZEROS OF GENERALIZED KRAWTCHOUK POLYNOMIALS Laura Chihara* and Dennis Stanton** Abstract. The zeros of generalized Krawtchouk polynomials are studied. Some interlacing theorems for the zeros are given.

More information

IDENTITIES INVOLVING BERNOULLI NUMBERS RELATED TO SUMS OF POWERS OF INTEGERS

IDENTITIES INVOLVING BERNOULLI NUMBERS RELATED TO SUMS OF POWERS OF INTEGERS IDENTITIES INVOLVING ERNOULLI NUMERS RELATED TO SUMS OF POWERS OF INTEGERS PIERLUIGI MAGLI Abstract. Pointing out the relations between integer power s sums and ernoulli and Genocchi polynomials, several

More information

COMBINATORICS 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. 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 information

ENUMERATION 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 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 information

On completing partial Latin squares with two filled rows and at least two filled columns

On completing partial Latin squares with two filled rows and at least two filled columns AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(2) (2017), Pages 186 201 On completing partial Latin squares with two filled rows and at least two filled columns Jaromy Kuhl Donald McGinn Department of

More information

Adjoint Representations of the Symmetric Group

Adjoint Representations of the Symmetric Group Adjoint Representations of the Symmetric Group Mahir Bilen Can 1 and Miles Jones 2 1 mahirbilencan@gmail.com 2 mej016@ucsd.edu Abstract We study the restriction to the symmetric group, S n of the adjoint

More information

Universal Juggling Cycles

Universal Juggling Cycles Universal Juggling Cycles Fan Chung y Ron Graham z Abstract During the past several decades, it has become popular among jugglers (and juggling mathematicians) to represent certain periodic juggling patterns

More information

On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations

On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract We conjecture that there is at least one composite term in

More information

THE LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin.

THE LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin. THE LARGEST INTERSECTION LATTICE OF A DISCRIMINANTAL ARRANGEMENT CHRISTOS A. ATHANASIADIS Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin. 6 (1997), 229{246] about the \largest" intersection

More information

Generating Functions of Partitions

Generating 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 information

A SIMPLIFIED FORM FOR NEARLY REDUCIBLE AND NEARLY DECOMPOSABLE MATRICES D. J. HARTFIEL

A SIMPLIFIED FORM FOR NEARLY REDUCIBLE AND NEARLY DECOMPOSABLE MATRICES D. J. HARTFIEL A SIMPLIFIED FORM FOR NEARLY REDUCIBLE AND NEARLY DECOMPOSABLE MATRICES D. J. HARTFIEL Introduction and definitions. Nearly reducible and nearly decomposable matrices have been discussed in [4], [5], and

More information

Section 5.6. LU and LDU Factorizations

Section 5.6. LU and LDU Factorizations 5.6. LU and LDU Factorizations Section 5.6. LU and LDU Factorizations Note. We largely follow Fraleigh and Beauregard s approach to this topic from Linear Algebra, 3rd Edition, Addison-Wesley (995). See

More information

NOTES ON HIGHER-DIMENSIONAL TARAI FUNCTIONS. 0. Introduction I. Takeuchi defined the following recursive function, called the tarai function,

NOTES ON HIGHER-DIMENSIONAL TARAI FUNCTIONS. 0. Introduction I. Takeuchi defined the following recursive function, called the tarai function, NOTES ON HIGHER-DIMENSIONAL TARAI FUNCTIONS TETSUYA ISHIU AND MASASHI KIKUCHI 0. Introduction I. Takeuchi defined the following recursive function, called the tarai function, in [5]. t(x, y, z) = if x

More information

On the Sylvester Denumerants for General Restricted Partitions

On the Sylvester Denumerants for General Restricted Partitions On the Sylvester Denumerants for General Restricted Partitions Geir Agnarsson Abstract Let n be a nonnegative integer and let ã = (a 1... a k be a k-tuple of positive integers. The term denumerant introduced

More information

A SIMPLE EXPLICIT BIJECTION BETWEEN (n, 2)-GOG AND MAGOG TRAPEZOIDS

A SIMPLE EXPLICIT BIJECTION BETWEEN (n, 2)-GOG AND MAGOG TRAPEZOIDS Séminaire Lotharingien de Combinatoire 75 (2016), Article B75e A SIMPLE EXPLICIT BIJECTION BETWEEN (n, 2)-GOG AND MAGOG TRAPEZOIDS JÉRÉMIE BETTINELLI ABSTRACT. A sub-problem of the open problem of finding

More information

Applications of Riordan matrix functions to Bernoulli and Euler polynomials

Applications 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 information

Elementary proofs of congruences for the cubic and overcubic partition functions

Elementary proofs of congruences for the cubic and overcubic partition functions AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 602) 204), Pages 9 97 Elementary proofs of congruences for the cubic and overcubic partition functions James A. Sellers Department of Mathematics Penn State

More information

A New Shuffle Convolution for Multiple Zeta Values

A New Shuffle Convolution for Multiple Zeta Values January 19, 2004 A New Shuffle Convolution for Multiple Zeta Values Ae Ja Yee 1 yee@math.psu.edu The Pennsylvania State University, Department of Mathematics, University Park, PA 16802 1 Introduction As

More information

ARITHMETIC PROPERTIES FOR HYPER M ARY PARTITION FUNCTIONS

ARITHMETIC PROPERTIES FOR HYPER M ARY PARTITION FUNCTIONS ARITHMETIC PROPERTIES FOR HYPER M ARY PARTITION FUNCTIONS Kevin M. Courtright Department of Mathematics, The Pennsylvania State University, University Park, PA 16802 kmc260@psu.edu James A. Sellers Department

More information

IDENTITIES FOR OVERPARTITIONS WITH EVEN SMALLEST PARTS

IDENTITIES 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 information

The Gift Exchange Problem

The Gift Exchange Problem The Gift Exchange Problem David Applegate and N. J. A. Sloane (a), AT&T Shannon Labs, 180 Park Ave., Florham Park, NJ 07932-0971, USA. (a) Corresponding author. Email: david@research.att.com, njas@research.att.com.

More information

ON THE ASYMPTOTIC DISTRIBUTION OF PARAMETERS IN RANDOM WEIGHTED STAIRCASE TABLEAUX

ON THE ASYMPTOTIC DISTRIBUTION OF PARAMETERS IN RANDOM WEIGHTED STAIRCASE TABLEAUX ON THE ASYMPTOTIC DISTRIBUTION OF PARAMETERS IN RANDOM WEIGHTED STAIRCASE TABLEAUX PAWE L HITCZENKO AND AMANDA PARSHALL Abstract In this paper, we study staircase tableaux, a combinatorial object introduced

More information

Some statistics on permutations avoiding generalized patterns

Some statistics on permutations avoiding generalized patterns PUMA Vol 8 (007), No 4, pp 7 Some statistics on permutations avoiding generalized patterns Antonio Bernini Università di Firenze, Dipartimento di Sistemi e Informatica, viale Morgagni 65, 504 Firenze,

More information

Cyclic Derangements. Sami H. Assaf. Department of Mathematics MIT, Cambridge, MA 02139, USA

Cyclic Derangements. Sami H. Assaf. Department of Mathematics MIT, Cambridge, MA 02139, USA Cyclic Derangements Sami H. Assaf Department of Mathematics MIT, Cambridge, MA 02139, USA sassaf@math.mit.edu Submitted: Apr 16, 2010; Accepted: Oct 26, 2010; Published: Dec 3, 2010 Mathematics Subject

More information

Two-boundary lattice paths and parking functions

Two-boundary lattice paths and parking functions Two-boundary lattice paths and parking functions Joseph PS Kung 1, Xinyu Sun 2, and Catherine Yan 3,4 1 Department of Mathematics, University of North Texas, Denton, TX 76203 2,3 Department of Mathematics

More information

arxiv: v1 [math.co] 20 Aug 2015

arxiv: v1 [math.co] 20 Aug 2015 arxiv:1508.04953v1 [math.co] 20 Aug 2015 On Polynomial Identities for Recursive Sequences Ivica Martinak and Iva Vrsalko Faculty of Science University of Zagreb Bienička cesta 32, HR-10000 Zagreb Croatia

More information

A q-analogue OF THE GENERALIZED FACTORIAL NUMBERS

A q-analogue OF THE GENERALIZED FACTORIAL NUMBERS J. Korean Math. Soc. 47 (2010), No. 3, pp. 645 657 DOI 10.4134/JKMS.2010.47.3.645 A q-analogue OF THE GENERALIZED FACTORIAL NUMBERS Seok-Zun Song, Gi-Sang Cheon, Young-Bae Jun, and LeRoy B. Beasley Abstract.

More information