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

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}).$

2013 ◽  
Vol 89 (3) ◽  
pp. 473-478 ◽  
Author(s):  
MICHAEL D. HIRSCHHORN ◽  
JAMES A. SELLERS

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.


Author(s):  
Sam Hopkins ◽  

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.


2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Jessica Striker

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.


10.37236/1997 ◽  
2011 ◽  
Vol 18 (2) ◽  
Author(s):  
Tewodros Amdeberhan ◽  
Victor H. Moll

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.


2014 ◽  
Vol 90 (1) ◽  
pp. 37-46 ◽  
Author(s):  
OLIVIA X. M. YAO

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*}$$


2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Lenny Tevlin

International audience This paper contains two results. First, I propose a $q$-generalization of a certain sequence of positive integers, related to Catalan numbers, introduced by Zeilberger, see Lassalle (2010). These $q$-integers are palindromic polynomials in $q$ with positive integer coefficients. The positivity depends on the positivity of a certain difference of products of $q$-binomial coefficients.To this end, I introduce a new inversion/major statistics on lattice walks. The difference in $q$-binomial coefficients is then seen as a generating function of weighted walks that remain in the upper half-plan. Cet document contient deux résultats. Tout d’abord, je vous propose un $q$-generalization d’une certaine séquence de nombres entiers positifs, liés à nombres de Catalan, introduites par Zeilberger (Lassalle, 2010). Ces $q$-integers sont des polynômes palindromiques à $q$ à coefficients entiers positifs. La positivité dépend de la positivité d’une certaine différence de produits de $q$-coefficients binomial.Pour ce faire, je vous présente une nouvelle inversion/major index sur les chemins du réseau. La différence de $q$-binomial coefficients est alors considérée comme une fonction de génération de trajets pondérés qui restent dans le demi-plan supérieur.


1961 ◽  
Vol 13 ◽  
pp. 217-220 ◽  
Author(s):  
C. Y. Lee

We will consider the following enumeration problem. Let A and B be finite sets with α and β elements in each set respectively. Let n be some positive integer such that n ≦ αβ. A subset S of the product set A × B of exactly n distinct ordered pairs (ai, bj) is said to be admissible if given any a ∈ A and b ∈ B, there exist elements (ai, bj) and (ak, bl) (they may be the same) in S such that ai = a and bl = b. We shall find here a generating function for the number N(α, β n) of distinct admissible subsets of A × B and from this generating function, an explicit expression for N(α, β n). In obtaining this result, the idea of a cut probability is used. This approach in a problem of enumeration may be of interest.


2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Long Chen ◽  
Kaimin Cheng ◽  
Tingting Wang

Let p be an odd prime number and n be a positive integer. Let vpn, N∗, and Q+ denote the p-adic valuation of the integer n, the set of positive integers, and the set of positive rational numbers, respectively. In this paper, we introduce an arithmetic function fp:N∗⟶Q+ defined by fpn≔n/pvpn1−vpn for any positive integer n. We show several interesting arithmetic properties about that function and then use them to establish some curious results involving the p-adic valuation. Some of these results extend Farhi’s results from the case of even prime to that of odd prime.


2015 ◽  
Vol 11 (04) ◽  
pp. 1063-1072
Author(s):  
Olivia X. M. Yao

The notion of Fu's k dots bracelet partitions was introduced by Shishuo Fu. For any positive integer k, let 𝔅k(n) denote the number of Fu's k dots bracelet partitions of n. Fu also proved several congruences modulo primes and modulo powers of 2. Recently, Radu and Sellers extended the set of congruences proven by Fu by proving three congruences modulo squares of primes for 𝔅5(n), 𝔅7(n) and 𝔅11(n). More recently, Cui and Gu, and Xia and the author derived a number of congruences modulo powers of 2 for 𝔅5(n). In this paper, we prove four congruences modulo 2 and two congruences modulo 4 for 𝔅9(n) by establishing the generating functions of 𝔅9(An+B) modulo 4 for some values of A and B.


2015 ◽  
Vol 30 (33) ◽  
pp. 1550202 ◽  
Author(s):  
Amer Iqbal ◽  
Babar A. Qureshi ◽  
Khurram Shabbir ◽  
Muhammad A. Shehper

We study (p, q) 5-brane webs dual to certain N M5-brane configurations and show that the partition function of these brane webs gives rise to cylindric Schur process with period N. This generalizes the previously studied case of period 1. We also show that open string amplitudes corresponding to these brane webs are captured by the generating function of cylindric plane partitions with profile determined by the boundary conditions imposed on the open string amplitudes.


Sign in / Sign up

Export Citation Format

Share Document