Lecture Hall Partitions II

For a non-decreasing integer sequence a=(a₁,...,a_n) we define L_a to be the set of n-tuples of integers = (₁,...,_n) satisfying . This generalizes the so-called lecture hall partitions corresponding to a_i=i and previously studied by the authors and by Andrews. We find sequences a such that the weight generating function for these a-lecture hall partitions has the remarkable form In the limit when n tends to infinity, we obtain a family of identities of the kind the number of partitions of an integer m such that the quotient between consecutive parts is greater than is equal to the number of partitions of m into parts belonging to the set P, for certain real numbers and integer sets P. We then underline the connection between lecture hall partitions and Ehrhart theory and discuss some reciprocity results.     

On the Asymptotic Behaviour of General Partition Functions,II

Let = {a ₁, a ₂,...} be a set of positive integers and let p (n) and q (n) denote the number of partitions of n into a's, resp. distinct a's. In an earlier paper the authors studied large values of log(max (2,p (n)))/log(max(2,q (n))). In this paper the small values of the same quotient are studied.     

Divisibility of Certain Partition Functions by Powers of Primes

Let be the prime factorization of a positive integer k and let b _k (n) denote the number of partitions of a non-negative integer n into parts none of which are multiples of k. If M is a positive integer, let S _k (N; M) be the number of positive integers N for which b _k(n ) 0(mod M). If we prove that, for every positive integer j In other words for every positive integer j, b _k(n) is a multiple of for almost every non-negative integer n. In the special case when k=p is prime, then in representation-theoretic terms this means that the number ofp -modular irreducible representations of almost every symmetric groupS _n is a multiple of p ^j. We also examine the behavior of b _k(n) (mod ) where the non-negative integers n belong to an arithmetic progression. Although almost every non-negative integer n (mod t) satisfies b _k(n) 0 (mod ), we show that there are infinitely many non-negative integers n r (mod t) for which b _k(n) 0 (mod ) provided that there is at least one such n. Moreover the smallest such n (if there are any) is less than 2 .     

Precise asymptotics in Chung’s law of the iterated logarithm

Let X, X1, X2,... be i.i.d, random variables with mean zero and positive, finite variance σ^2, and set Sn = X1 ＋... ＋ Xn, n≥1. The author proves that, if EX^2I{｜X｜≥t} = 0（（log log t）^-1） as t→∞, then for any a〉-1 and b〉 -1,lim ε↑1/√1＋a（1/√1＋a-ε）b＋1 ∑n=1^∞（logn）^a（loglogn）^b/nP{max κ≤n｜Sκ｜≤√σ^2π^2n/8loglogn（ε＋an）}=4/π（1/2（1＋a）^3/2）^b＋1 Г（b＋1）,whenever an = o（1/log log n）. The author obtains the sufficient and necessary conditions for this kind of results to hold.     

Minimal rates of entropy convergence for completely ergodic systems

If (X,T) is a completely ergodic system, then there exists a positive monotone increasing sequence {a _n } _n ^1/∞ with lim _n →∞a _n =∞ and a positive concave functiong defined on [1, ∞) for whichg(x)/x ² isnot integrable such that for all nontrivial partitions α ofX into two sets.     

On the Combinatorics of Lecture Hall Partitions

A lecture hall partition of length n is an integer sequence satisfying Bousquet-Mélou and Eriksson showed that the number of lecture hall partitions of length n of a positive integer N whose alternating sum is k equals the number of partitions of N into k odd parts less than 2n. We prove the fact by a natural combinatorial bijection. This bijection, though defined differently, is essentially the same as one of the bijections found by Bousquet-Mélou and Eriksson.     

Partitions and Compositions Defined by Inequalities

We consider sequences of integers (₁,..., _k) defined by a system of linear inequalities _{i j>i}a_ijj with integer coefficients. We show that when the constraints are strong enough to guarantee that all _i are nonnegative, the generating function for the integer solutions of weight n has a finite product form , where the b_i are positive integers that can be computed from the coefficients of the inequalities. The results are proved bijectively and are used to give several examples of interesting identities for integer partitions and compositions. The method can be adapted to accommodate equalities along with inequalities and can be used to obtain multivariate forms of the generating function. We show how to extend the technique to obtain the generating function when the coefficients a_i,i+1 are allowed to be rational, generalizing the case of lecture hall partitions. Our initial results were conjectured thanks to the Omega package (G.E. Andrews, P. Paule, and A. Riese, European J. Comb. 22(7) (2001), 887–904).Research supported by NSA grants MDA 904-00-1-0059 and MDA 904-01-0-0083.     

An elementary derivation of the asymptotics of partition functions

Let S_a,b = {an+b:n ≥ 0 } where n is an integer. Let P_a,b(n) denote the number of partitions of n into elements of S_a,b. In particular, we have the generating function,

On the zeros of a class of generalised Dirichlet series-XIV

We prove a general theorem on the zeros of a class of generalised Dirichlet series. We quote the following results as samples. Theorem A.Let 0<θ<1/2and let {a _n }be a sequence of complex numbers satisfying the inequality for N = 1,2,3,…,also for n = 1,2,3,…let α _n be real and |α_n| ≤ C(θ)where C(θ) > 0is a certain (small)constant depending only on θ. Then the number of zeros of the function in the rectangle (1/2-δ⩽σ⩽1/2+δ,T⩽t⩽2T) (where 0<δ<1/2)is ≥C(θ,δ)T logT where C(θ,δ)is a positive constant independent of T provided T ≥T ₀(θ,δ)a large positive constant. Theorem B.In the above theorem we can relax the condition on a _n to and |a_N| ≤ (1/2-θ)^-1.Then the lower bound for the number of zeros in (σ⩾1/3−δ,T⩽t⩽2T)is > C(θ,δ) Tlog T(log logT)^-1.The upper bound for the number of zeros in σ⩾1/3+δ,T⩽t⩽2T) isO(T)provided for every ε > 0. Dedicated to the memory of Professor K G Ramanathan     

Some generalizations of Knopp's identity*

For integers a, b and n > 0, define

一类时滞Logistic差分方程的全局吸引性

§ 1　ＩｎｔｒｏｄｕｃｔｉｏｎＣｏｎｓｉｄｅｒｔｈｅｎｏｎａｕｔｏｎｏｍｏｕｓｄｅｌａｙｌｏｇｉｓｔｉｃｄｉｆｆｅｒｅｎｃｅｅｑｕａｔｉｏｎΔｙｎ =ｐｎｙｎ( 1 - ｙτ(ｎ) )　 ,ｎ =0 ,1 ,2 ,...,( 1 1 )ｗｈｅｒｅｐｎ ∞ｎ =0 ｉｓａｓｅｑｕｅｎｃｅｏｆｐｏｓｉｔｉｖｅｒｅａｌｎｕｍｂｅｒｓ ,τ(ｎ) ∞ｎ =0 ｉｓａｎｏｎｄｅｃｒｅａｓｉｎｇｓｅｑｕｅｎｃｅｏｆｉｎｔｅｇｅｒｓ,τ(ｎ) <ｎａｎｄｌｉｍｎ→∞τ(ｎ) =∞ ,Δｙｎ=ｙｎ +1- ｙｎ.Ｍｏｔｉｖａｔｅｄｂｙｐｌａｕｓｉｂｌｅａｐｐｌｉｃａｔｉｏｎｓ…     

A general oscillation theorem for self-adjoint differential systems with applications to Sturm-Liouville eigenvalue problems and quadratic functionals

For given 2n×2n matricesS ₁₃,S ₂₄ with rank(S ₁₃,S ₂₄)=2n we consider the eigenvalue problem:u′=A(x)u+B(x)v,v′=C ₁(x;λ)u-A ^T(x)v with

Polynomial solutions of quasi-homogeneous partial differential equations

By means of a method of analytic number theory the following theorem is proved. Letp be a quasi-homogeneous linear partial differential operator with degreem,m > 0, w.r.t a dilation given by ( a₁, …, a_n). Assume that either a₁, …, a_n are positive rational numbers or for some Then the dimension of the space of polynomial solutions of the equationp[u] = 0 on ℝⁿ must be infinite     

Score sets in oriented 3-partite graphs

Let D(U, V, W) be an oriented 3-partite graph with |U|=p, |V|=q and |W|= r. For any vertex x in D(U, V, W), let d x and d-x be the outdegree and indegree of x respectively. Define aui (or simply ai) = q r d ui - d-ui, bvj(or simply bj) = p r d vj - d-vj and Cwk (or simply ck) = p q d wk - d-wk as the scores of ui in U, vj in V and wk in Wrespectively. The set A of distinct scores of the vertices of D(U, V, W) is called its score set. In this paper, we prove that if a1 is a non-negative integer, ai(2≤i≤n - 1) are even positive integers and an is any positive integer, then for n≥3, there exists an oriented 3-partite graph with the score set A = {a1,2∑i=1 ai,…,n∑i=1 ai}, except when A = {0,2,3}. Some more results for score sets in oriented 3-partite graphs are obtained.     

On summability of pairs of convolution sequences of probability measures on locally compact semigroups

In this paper we study the problem of convergence in the weak and the vague topology of the sequence

Sums of Five, Seven and Nine Squares

Let r _k(n) denote the number of representations of an integer n as a sum of k squares. We prove that

Positive Solution of Multi-Point Boundary Value Problems for the One-Dimensional p-Laplacian with Singularities

In this paper, we obtain positive solution to the following multi-point singular boundary value problem with p-Laplacian operator,{（ φp（u＇））＇＋q（t）f（t,u,u＇）=0,0〈t〈1,u（0）=∑i=1^nαiu（ξi）,u＇（1）=∑i=1^nβiu＇（ξi）,whereφp（s）=｜s｜^p-2s,p≥2;ξi∈（0,1）（i=1,2,…,n）,0≤αi,βi〈1（i=1,2,…n）,0≤∑i=1^nαi,∑i=1^nβi〈1,and q（t） may be singular at t=0,1,f（t,u,u＇）may be singular at u＇=0     

The Law of Iterated Logarithm of Rescaled Range Statistics for AR（1） Model

Let {Xn,n ≥ 0} be an AR（1） process. Let Q（n） be the rescaled range statistic, or the R/S statistic for {Xn} which is given by （max1≤k≤n（∑j=1^k（Xj - ^-Xn）） - min 1≤k≤n（∑j=1^k（ Xj - ^Xn ））） /（n ^-1∑j=1^n（Xj -^-Xn）^2）^1/2 where ^-Xn = n^-1 ∑j=1^nXj. In this paper we show a law of iterated logarithm for rescaled range statistics Q（n） for AR（1） model.     

Precise Rates in the Law of Iterated Logarithm for the Moment of I.I.D. Random Variables

Let{X,Xn;n≥1} be a sequence of i,i.d, random variables, E X = 0, E X^2 = σ^2 〈 ∞.Set Sn=X1＋X2＋…＋Xn,Mn=max k≤n│Sk│,n≥1.Let an=O（1/loglogn）.In this paper,we prove that,for b〉-1,lim ε→0 →^2（b＋1）∑n=1^∞ （loglogn）^b/nlogn n^1/2 E{Mn-σ（ε＋an）√2nloglogn}＋σ2^-b/（b＋1）（2b＋3）E│N│^2b＋3∑k=0^∞ （-1）k/（2k＋1）^2b＋3 holds if and only if EX=0 and EX^2=σ^2〈∞.     

A Weighted Erdős-Ginzburg-Ziv Theorem

An n-set partition of a sequence S is a collection of n nonempty subsequences of S, pairwise disjoint as sequences, such that every term of S belongs to exactly one of the subsequences, and the terms in each subsequence are all distinct so that they can be considered as sets. If S is a sequence of m+n−1 elements from a finite abelian group G of order m and exponent k, and if is a sequence of integers whose sum is zero modulo k, then there exists a rearranged subsequence of S such that . This extends the Erdős–Ginzburg–Ziv Theorem, which is the case when m = n and w_i = 1 for all i, and confirms a conjecture of Y. Caro. Furthermore, we in part verify a related conjecture of Y. Hamidoune, by showing that if S has an n-set partition A=A₁, . . .,A_n such that |w_iA_i| = |A_i| for all i, then there exists a nontrivial subgroup H of G and an n-set partition A′ =A′₁, . . .,A′_n of S such that and for all i, where w_iA_i={w_ia_i |a_i∈A_i}.