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

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.

On General Polynomials

1967 ◽  
Vol 10 (4) ◽  
pp. 579-583 ◽  
Author(s):  
Kenneth S. Williams
Keyword(s):  
Finite Field ◽  
Number Of Solutions ◽  
Fixed Integer ◽  
Image Position

Let d denote a fixed integer > 1 and let GF(q) denote the finite field of q = pn elements. We consider q fixed ≥ A(d), where A(d) is a (large) constant depending only on d. Let1where each aiεGF(q). Let nr(r = 2, 3, …, d) denote the number of solutions in GF(q) offor which x1, x2, …, xr are all different.

On Cyclotomic Numbers of Order Sixteen

1954 ◽  
Vol 6 ◽  
pp. 449-454 ◽  
Author(s):  
Emma Lehmer
Keyword(s):  
Linear Combination ◽  
Primitive Root ◽  
Number Of Solutions ◽  
Integer Coefficients ◽  
Cyclotomic Numbers ◽  
Image Position ◽  
Mod P

It has been shown by Dickson (1) that if (i, j)8 is the number of solutions of (mod p),then 64(i,j)8 is expressible for each i,j, as a linear combination with integer coefficients of p, x, y, a, and b where,anda ≡ b ≡ 1 (mod 4),while the sign of y and b depends on the choice of the primitive root g. There are actually four sets of such formulas depending on whether p is of the form 16n + 1 or 16n + 9 and whether 2 is a quartic residue or not.

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.

On a variant of sum-product estimates and explicit exponential sum bounds in prime fields

2009 ◽  
Vol 146 (1) ◽  
pp. 1-21 ◽  
Author(s):  
J. BOURGAIN ◽  
M. Z. GARAEV
Keyword(s):  
Prime Order ◽  
Exponential Sums ◽  
Exponential Sum ◽  
Complex Numbers ◽  
Number Of Solutions ◽  
Prime Fields ◽  
Explicit Bounds ◽  
Multiplicative Subgroup ◽  
Image Position

AbstractLet Fp be the field of a prime order p and F*p be its multiplicative subgroup. In this paper we obtain a variant of sum-product estimates which in particular implies the bound for any subset A ⊂ Fp with 1 < |A| < p12/23. Then we apply our estimate to obtain explicit bounds for some exponential sums in Fp. We show that for any subsets X, Y, Z ⊂ F*p and any complex numbers αx, βy, γz with |αx| ≤ 1, |βy| ≤ 1, |γz| ≤ 1, the following bound holds: We apply this bound further to show that if H is a subgroup of F*p with |H| > p1/4, then Finally we show that if g is a generator of F*p then for any M < p the number of solutions of the equation is less than $M^{3-1/24+o(1)}\Bigl(1+(M^2/p)^{1/24}\Bigr).$. This implies that if p1/2 < M < p, then

scholarly journals Some problems of non-associative combinations (2)

1940 ◽  
Vol 32 ◽  
pp. vii-xii ◽  
Author(s):  
A. Erdelyi ◽  
I. M. H. Etherington
Keyword(s):  
Power Series ◽  
Algebraic Equation ◽  
Generating Function ◽  
Convex Polygon ◽  
Preceding Note ◽  
Image Position

§ 1. The preceding Note has shown the connection between the partition of a convex polygon by non-crossing diagonals and the insertion of brackets in a product, the latter being more commonly represented by the construction of a tree. It was shown that the enumeration of these entities leads to a generating function y = f(x) which satisfies an algebraic equation of the typeIn simple cases, the solution of the equation was found as a power series in x, the coefficient An of xn giving the required number of partitions of an (n + 1)-gon.

scholarly journals Ramanujan congruences for p-k (mod 11')

1983 ◽  
Vol 24 (2) ◽  
pp. 107-123 ◽  
Author(s):  
Basil Gordon
Keyword(s):  
Generating Function ◽  
Euler Product ◽  
Ramanujan Congruences ◽  
Image Position

Denote bythe Euler product, and bythe partition generating function. More generally, if k is any integer, putso that p(n) = p−1(n). In [3], Atkin proved the following theorem.

The Meromorphisms of an Elliptic Function-Field

1936 ◽  
Vol 32 (2) ◽  
pp. 212-215 ◽  
Author(s):  
H. Davenport
Keyword(s):  
Finite Field ◽  
Elliptic Function ◽  
Function Field ◽  
Unit Element ◽  
Number Of Solutions ◽  
Complicated Case ◽  
Zero Divisors ◽  
The Subject ◽  
Image Position ◽  
The Given

1. Hasse's second proof of the truth of the analogue of Riemann's hypothesis for the congruence zeta-function of an elliptic function-field over a finite field is based on the consideration of the normalized meromorphisms of such a field. The meromorphisms form a ring of characteristic 0 with a unit element and no zero divisors, and have as a subring the natural multiplications n (n = 0, ± 1, …). Two questions concerning the nature of meromorphisms were left open, first whether they are commutative, and secondly whether every meromorphism μ satisfies an algebraic equation with rational integers n0, … not all zero. I have proved that except in the case (which is equivalent to |N−q|=2 √q, where N is the number of solutions of the Weierstrassian equation in the given finite field of q elements), both these results are true. This proof, of which I give an account in this paper, suggested to Hasse a simpler treatment of the subject, which throws still more light on the nature of meromorphisms. Consequently I only give my proof in full in the case in which the given finite field is the mod p field, and indicate briefly in § 4 how it generalizes to the more complicated case.

Sign in / Sign up

Export Citation Format

Share Document