scholarly journals ARITHMETIC PROPERTIES OF 1-SHELL TOTALLY SYMMETRIC PLANE PARTITIONS

2013 ◽  
Vol 89 (3) ◽  
pp. 473-478 ◽  
Author(s):  
MICHAEL D. HIRSCHHORN ◽  
JAMES A. SELLERS
Keyword(s):  
Generating Function ◽  
Main Diagonal ◽  
Plane Partitions ◽  
Combinatorial Objects ◽  
Arithmetic Properties ◽  
Symmetric Plane ◽  
Image Position

AbstractBlecher [‘Geometry for totally symmetric plane partitions (TSPPs) with self-conjugate main diagonal’,Util. Math. 88(2012), 223–235] defined the combinatorial objects known as 1-shell totally symmetric plane partitions of weight$n$. He also proved that the generating function for$f(n), $the number of 1-shell totally symmetric plane partitions of weight$n$, is given by$$\begin{eqnarray*}\displaystyle \sum _{n\geq 0}f(n){q}^{n} = 1+ \sum _{n\geq 1}{q}^{3n- 2} \prod _{i= 0}^{n- 2} (1+ {q}^{6i+ 3} ).\end{eqnarray*}$$In this brief note, we prove a number of arithmetic properties satisfied by$f(n)$using elementary generating function manipulations and well-known results of Ramanujan and Watson.

NEW INFINITE FAMILIES OF CONGRUENCES MODULO 4 AND 8 FOR 1-SHELL TOTALLY SYMMETRIC PLANE PARTITIONS

2014 ◽  
Vol 90 (1) ◽  
pp. 37-46 ◽  
Author(s):  
OLIVIA X. M. YAO
Keyword(s):  
Special Class ◽  
Main Diagonal ◽  
Plane Partitions ◽  
Arithmetic Properties ◽  
Symmetric Plane ◽  
Image Position ◽  
Regular Partitions ◽  
Appl Math

AbstractIn 2012, Blecher [‘Geometry for totally symmetric plane partitions (TSPPs) with self-conjugate main diagonal’,Util. Math. 88(2012), 223–235] introduced a special class of totally symmetric plane partitions, called$\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}1$-shell totally symmetric plane partitions. Let$f(n)$denote the number of$1$-shell totally symmetric plane partitions of weight$n$. More recently, Hirschhorn and Sellers [‘Arithmetic properties of 1-shell totally symmetric plane partitions’,Bull. Aust. Math. Soc.to appear. Published online 27 September 2013] discovered a number of arithmetic properties satisfied by$f(n)$. In this paper, employing some results due to Cui and Gu [‘Arithmetic properties of$l$-regular partitions’,Adv. Appl. Math. 51(2013), 507–523], and Hirschhorn and Sellers, we prove several new infinite families of congruences modulo 4 and 8 for$1$-shell totally symmetric plane partitions. For example, we find that, for$n\geq 0$and$\alpha \geq 1$,$$\begin{equation*} f(8 \times 5^{2\alpha } n+39\times 5^{2\alpha -1})\equiv 0 \pmod 8. \end{equation*}$$

A NEW CONGRUENCE MODULO 25 FOR 1-SHELL TOTALLY SYMMETRIC PLANE PARTITIONS

2014 ◽  
Vol 91 (1) ◽  
pp. 41-46 ◽  
Author(s):  
ERNEST X. W. XIA
Keyword(s):  
Positive Integer ◽  
Generating Function ◽  
Plane Partitions ◽  
Arithmetic Properties ◽  
Symmetric Plane ◽  
Congruence Modulo

AbstractFor any positive integer $n$, let $f(n)$ denote the number of 1-shell totally symmetric plane partitions of $n$. Recently, Hirschhorn and Sellers [‘Arithmetic properties of 1-shell totally symmetric plane partitions’, Bull. Aust. Math. Soc.89 (2014), 473–478] and Yao [‘New infinite families of congruences modulo 4 and 8 for 1-shell totally symmetric plane partitions’, Bull. Aust. Math. Soc.90 (2014), 37–46] proved a number of congruences satisfied by $f(n)$. In particular, Hirschhorn and Sellers proved that $f(10n+5)\equiv 0\ (\text{mod}\ 5)$. In this paper, we establish the generating function of $f(30n+25)$ and prove that $f(250n+125)\equiv 0\ (\text{mod\ 25}).$

scholarly journals The poset perspective on alternating sign matrices

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Jessica Striker
Keyword(s):  
Generating Function ◽  
Young Tableaux ◽  
Alternating Sign Matrices ◽  
Plane Partitions ◽  
Combinatorial Objects ◽  
Symmetric Plane ◽  
International Audience ◽  
Order Ideals ◽  
Nous Utilisons

International audience Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We put ASMs into a larger context by studying the order ideals of subposets of a certain poset, proving that they are in bijection with a variety of interesting combinatorial objects, including ASMs, totally symmetric self―complementary plane partitions (TSSCPPs), Catalan objects, tournaments, semistandard Young tableaux, and totally symmetric plane partitions. We use this perspective to prove an expansion of the tournament generating function as a sum over TSSCPPs which is analogous to a known formula involving ASMs. Les matrices à signe alternant (ASMs) sont des matrices carrées dont les coefficients sont 0,1 ou -1, telles que dans chaque ligne et chaque colonne la somme des entrées vaut 1 et les entrées non nulles ont des signes qui alternent. Nous incluons les ASMs dans un cadre plus vaste, en étudiant les idéaux des sous-posets d'un certain poset, dont nous prouvons qu'ils sont en bijection avec de nombreux objets combinatoires intéressants, tels que les ASMs, les partitions planes totalement symétriques autocomplémentaires (TSSCPPs), des objets comptés par les nombres de Catalan, les tournois, les tableaux semistandards, ou les partitions planes totalement symétriques. Nous utilisons ce point de vue pour démontrer un développement de la série génératrice des tournois en une somme portant sur les TSSCPPs, analogue à une formule déjà connue faisant appara\^ıtre les ASMs.

scholarly journals Cyclic Sieving for Plane Partitions and Symmetry

2020 ◽  
Author(s):  
Sam Hopkins ◽  
Keyword(s):  
Fixed Points ◽  
Generating Function ◽  
Cyclic Group ◽  
Product Formula ◽  
Roots Of Unity ◽  
Plane Partitions ◽  
Cyclic Sieving Phenomenon ◽  
Combinatorial Set ◽  
Symmetric Plane ◽  
Cyclic Sieving

The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of the most impressive instances of the cyclic sieving phenomenon is a theorem of Rhoades asserting that the set of plane partitions in a rectangular box under the action of promotion exhibits cyclic sieving. In Rhoades's result the sieving polynomial is the size generating function for these plane partitions, which has a well-known product formula due to MacMahon. We extend Rhoades's result by also considering symmetries of plane partitions: specifically, complementation and transposition. The relevant polynomial here is the size generating function for symmetric plane partitions, whose product formula was conjectured by MacMahon and proved by Andrews and Macdonald. Finally, we explain how these symmetry results also apply to the rowmotion operator on plane partitions, which is closely related to promotion.

XIII.—The Generating Function of Solid Partitions

1967 ◽  
Vol 67 (3) ◽  
pp. 185-195 ◽  
Author(s):  
E. M. Wright
Keyword(s):  
Generating Function ◽  
Additional Condition ◽  
Number Of Solutions ◽  
Plane Partitions ◽  
Image Position ◽  
Simplified Form

SynopsisThe generating function for the number of linear partitions was found by Euler, the method being almost trivial. That for plane partitions is due to Macmahon, but, even in a simplified form found by Chaundy, the proof is far from trivial. The number of solid partitions of n, i.e. the number of solutions ofis denoted by r(n). It has often been conjectured that the generating function of r(n) is , but this is now known to be false. We write η(a, b, c) for the generating function of the number of solutions of (1) subject to the additional condition thatMacmahon 1916 found n(a, 1, 1) for general a. Here we find η(a, b, c) for general a, b. c.

scholarly journals Arithmetic Properties of Plane Partitions

10.37236/1997 ◽  
2011 ◽  
Vol 18 (2) ◽  
Author(s):  
Tewodros Amdeberhan ◽  
Victor H. Moll
Keyword(s):  
Simple Manner ◽  
Alternating Sign Matrices ◽  
Plane Partitions ◽  
Arithmetic Properties ◽  
Symmetric Plane

The $2$-adic valuations of sequences counting the number of alternating sign matrices of size $n$ and the number of totally symmetric plane partitions are shown to be related in a simple manner.

scholarly journals Arithmetic properties of Andrews' singular overpartitions

2015 ◽  
Vol 11 (05) ◽  
pp. 1463-1476 ◽  
Author(s):  
Shi-Chao Chen ◽  
Michael D. Hirschhorn ◽  
James A. Sellers
Keyword(s):  
Recent Work ◽  
Generating Function ◽  
General Theorem ◽  
Infinite Family ◽  
Combinatorial Objects ◽  
Arithmetic Properties

In a very recent work, G. E. Andrews defined the combinatorial objects which he called singular overpartitions with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers–Ramanujan type for ordinary partitions with restricted successive ranks. As a small part of his work, Andrews noted two congruences modulo 3 which followed from elementary generating function manipulations. In this work, we show that Andrews' results modulo 3 are two examples of an infinite family of congruences modulo 3 which hold for that particular function. We also expand the consideration of such arithmetic properties to other functions which are part of Andrews' framework for singular overpartitions.

scholarly journals XXV.—The Generating Function of the Reciprocal of a Determinant

1905 ◽  
Vol 40 (3) ◽  
pp. 615-629
Author(s):  
Thomas Muir
Keyword(s):  
Generating Function ◽  
Specific Character ◽  
Partial Fraction ◽  
Homogeneous Functions ◽  
Series Form ◽  
General Proposition ◽  
In Series ◽  
Image Position ◽  
The Given

(1) This is a subject to which very little study has been directed. The first to enunciate any proposition regarding it was Jacobi; but the solitary result which he reached received no attention from mathematicians,—certainly no fruitful attention,—during seventy years following the publication of it.Jacobi was concerned with a problem regarding the partition of a fraction with composite denominator (u1 − t1) (u2 − t2) … into other fractions whose denominators are factors of the original, where u1, u2, … are linear homogeneous functions of one and the same set of variables. The specific character of the partition was only definable by viewing the given fraction (u1−t1)−1 (u2−t2)−1…as expanded in series form, it being required that each partial fraction should be the aggregate of a certain set of terms in this series. Of course the question of the order of the terms in each factor of the original denominator had to be attended to at the outset, since the expansion for (a1x+b1y+c1z−t)−1 is not the same as for (b1y+c1z+a1x−t)−1. Now one general proposition to which Jacobi was led in the course of this investigation was that the coefficient ofx1−1x2−1x3−1…in the expansion ofy1−1u2−1u3−1…, whereis |a1b2c3…|−1, provided that in energy case the first term of uris that containing xr.

Ramanujan Congruences For p-k(n) Modulo Powers Of 17

1991 ◽  
Vol 43 (3) ◽  
pp. 506-525 ◽  
Author(s):  
Kim Hughes
Keyword(s):  
Partition Function ◽  
Generating Function ◽  
Ramanujan Congruences ◽  
Image Position

For each integer r we define the sequence pr(n) by We note that p-1(n) = p(n), the ordinary partition function. On account of this some authors set r = — k to make positive values of k correspond to positive powers of the generating function for p(n): We follow this convention here. In [3], Atkin proved the following theorem.

Positivity and continued fractions from the binomial transformation

2019 ◽  
Vol 149 (03) ◽  
pp. 831-847 ◽  
Author(s):  
Bao-Xuan Zhu
Keyword(s):  
Generating Function ◽  
Continued Fractions ◽  
Continued Fraction ◽  
Hankel Matrix ◽  
Eulerian Polynomials ◽  
Binomial Convolution ◽  
Image Position ◽  
Moment Property

AbstractGiven a sequence of polynomials$\{x_k(q)\}_{k \ges 0}$, define the transformation$$y_n(q) = a^n\sum\limits_{i = 0}^n {\left( \matrix{n \cr i} \right)} b^{n-i}x_i(q)$$for$n\ges 0$. In this paper, we obtain the relation between the Jacobi continued fraction of the ordinary generating function ofyn(q) and that ofxn(q). We also prove that the transformation preservesq-TPr+1(q-TP) property of the Hankel matrix$[x_{i+j}(q)]_{i,j \ges 0}$, in particular forr= 2,3, implying ther-q-log-convexity of the sequence$\{y_n(q)\}_{n\ges 0}$. As applications, we can give the continued fraction expressions of Eulerian polynomials of typesAandB, derangement polynomials typesAandB, general Eulerian polynomials, Dowling polynomials and Tanny-geometric polynomials. In addition, we also prove the strongq-log-convexity of derangement polynomials typeB, Dowling polynomials and Tanny-geometric polynomials and 3-q-log-convexity of general Eulerian polynomials, Dowling polynomials and Tanny-geometric polynomials. We also present a new proof of the result of Pólya and Szegö about the binomial convolution preserving the Stieltjes moment property and a new proof of the result of Zhu and Sun on the binomial transformation preserving strongq-log-convexity.

Sign in / Sign up

Export Citation Format

Share Document