Periodicities of partition functions and stirling numbers modulo p

If p(n, k) is the number of partitions of n into parts ≤k, then the sequence {p(k, k), p(k + 1, k),…} is periodic modulo a prime p. We find the minimum period Q = Q(k, p) of this sequence. More generally, we find the minimum period, modulo p, of {p(n; T)}_{n ≥ 0}, the number of partitions of n whose parts all lie in a fixed finite set T of positive integers. We find the minimum period, modulo p, of {S(k, k), S(k + 1, k),…}, where these are the Stirling numbers of the second kind. Some related congruences are proved. The methods involve the use of cyclotomic polynomials over Z_p[x].     

Weighted Least Square Convergence of Lagrange Interpolation on the Unit Circle

In the paper, a result of Walsh and Sharma on least square convergence of Lagrange interpolation polynomials based on the n-th roots of unity is extended to Lagrange interpolation on the sets obtained by projecting vertically the zeros of (1-x)²=P ^(a,β) _n(x),a>0,β>0,(1-x)P^(a,β) _n(x),a>0,β>-1,(1+x)P P^(a,β) _n(x),a>-1,β0 and P^(a,β) _n(x),a>-1,β>-1, respectively, onto the unit circle, where P^(a,β) _n(x),a>-1,β>-1, stands for the n-th Jacobi polynomial. Moreover, a result of Saff and Walsh is also extended.     

On conjugacy of some systems of functions

Summary. We investigate the bounded solutions j:[0,1]? X \varphi:[0,1]\to X of the system of functional equations¶¶j(f_k(x))=F_k(j(x)),    k=0,?,n-1,x ? [0,1] \varphi(f_k(x))=F_k(\varphi(x)),\;\;k=0,\ldots,n-1,x\in[0,1] ,(*)¶where X is a complete metric space, f₀,?,f_n-1:[0,1]?[0,1] f_0,\ldots,f_{n-1}:[0,1]\to[0,1] and F₀,...,F_n-1:X? X F_0,...,F_{n-1}:X\to X are continuous functions fulfilling the boundary conditions f₀(0) = 0, f_n-1(1) = 1, f_k+1(0) = f_k(1), F₀(a) = a,F_n-1(b) = b,F_k+1(a) = F_k(b), k = 0,?,n-2 f_{0}(0) = 0, f_{n-1}(1) = 1, f_{k+1}(0) = f_{k}(1), F_{0}(a) = a,F_{n-1}(b) = b,F_{k+1}(a) = F_{k}(b),\,k = 0,\ldots,n-2 , for some a,b ? X a,b\in X . We give assumptions on the functions f_k and F_k which imply the existence, uniqueness and continuity of bounded solutions of the system (*). In the case X = \Bbb C X= \Bbb C we consider some particular systems (*) of which the solutions determine some peculiar curves generating some fractals. If X is a closed interval we give a collection of conditions which imply respectively the existence of homeomorphic solutions, singular solutions and a.e. nondifferentiable solutions of (*).     

Completely strong path-connected tournaments

Let T = (V, A) be a tournament with p vertices. T is called completely strong path-connected if for each arc (a, b) ∈ A and k (k = 2, 3,…, p), there is a path from b to a of length k (denoted by P_k(a, b)) and a path from a to b of length k (denoted by P′_k(a, b)). In this paper, we prove that T is completely strong path-connected if and only if for each arc (a, b) ∈ A, there exist P₂(a, b), P′₂(a, b) in T, and T satisfies one of the following conditions: (a) T/T₀-type graph, (b) T is 2-connected, (c) for each arc (a, b) ∈ A, there exists a P′_p?1(a, b) in T.     

A combinatorial problem involving graphs and matrices

In this paper we discuss a combinatorial problem involving graphs and matrices. Our problem is a matrix analogue of the classical problem of finding a system of distinct representatives (transversal) of a family of sets and relates closely to an extremal problem involving 1-factors and a long standing conjecture in the dimension theory of partially ordered sets. For an integer n ?1, let n denote the n element set {1,2,3,…, n}. Then let A be a k×t matrix. We say that A satisfies property P(n, k) when the following condition is satisfied: For every k-taple (x₁,x₂,…,x_k?n^k there exist k distinct integers j₁,j₂,…,j_k so that x_i= a_ii for i= 1,2,…,k. The minimum value of t for which there exists a k × t matrix A satisfying property P(n,k) is denoted by f(n,k). For each k?1 and n sufficiently large, we give an explicit formula for f(n, k): for each n?1 and k sufficiently large, we use probabilistic methods to provide inequalities for f(n,k).     

On the Behaviour of Zeros of Jacobi Polynomials

Denote by x_n,k(α,β) and x_n,k(λ)=x_n,k(λ−1/2,λ−1/2) the zeros, in decreasing order, of the Jacobi polynomial P^(α,β)_n(x) and of the ultraspherical (Gegenbauer) polynomial C^λ_n(x), respectively. The monotonicity of x_n,k(α,β) as functions of α and β, α,β>−1, is investigated. Necessary conditions such that the zeros of P^(a,b)_n(x) are smaller (greater) than the zeros of P^(α,β)_n(x) are provided. A. Markov proved that x_n,k(a,b)<x_n,k(α,β) (x_n,k(a,b)>x_n,k(α,β)) for every n and each k, 1kn if a>α and b<β (a<α and b>β). We prove the converse statement of Markov's theorem. The question of how large the function f_n(λ) could be such that the products f_n(λ)x_n,k(λ), k=1,…,[n/2] are increasing functions of λ, for λ>−1/2, is also discussed. Elbert and Siafarikas proved that f_n(λ)=(λ+(2n²+1)/(4n+2))^1/2 obeys this property. We establish the sharpness of their result.     

On a function associated with the Bessel functions

Summary Defining the function Δn, 1,k;x(J) asΔn, 1,k;x(J)=J _n+1(x)−J _n(x)J _n+k+1(x) associated with the Bessel functionJ _n(x), we derive a series of products of Bessel functions for Δ_{n, f, k, x} (J). Whenk=1,k;x (J) becomes Turàn expression for Bessel functions. Some consequences have been pointed out.

---

Riassunto Definita la Δ_{n, f, k, x} (J) come Δ_{n, f, k, x}, (J)=J _n+1(x)J _n+k(x)-J _n(_n+k+1)(x) associata alla funzioneJ _n(x) di Bessel, si ricava una serie di prodotti di funzioni di Bessel per Δ_{n, f, k, x}, (J). 3 Quandok=1, Δ_{n, f, k, x}, (J) diventa una espressione di Turàn per le funzioni di 2 Bessel, vengono inoltre indicate alcune altre conseguenze.

     

Maximizing the probability of correctly ordering random variables using linear predictors

Let (T₁, x₁), (T₂, x₂), …, (T_n, x_n) be a sample from a multivariate normal distribution where T_i are (unobservable) random variables and x_i are random vectors in R^k. If the sample is either independent and identically distributed or satisfies a multivariate components of variance model, then the probability of correctly ordering {T_i} is maximized by ranking according to the order of the best linear predictors {E(T_i|x_i)}. Furthermore, it orderings are chosen according to linear functions {b′x_i} then the conditional probability of correct order given (T_i = t₁; i = 1, …, n) is maximized when b′x_i is the best linear predictor. Examples are given to show that linear predictors may not be optimal and that using a linear combination other that the best linear predictor may give a greater probability of correctly ordering {T_i} if {(T_i, x_i)} are independent but not identically distributed, or if the distributions are not normal.     

Многомерные вариаци и множеств и их контин генции

LetE be a compact set inR ⁿ (n≧2), and denote byV ₀(E) the number of the components ofE. Letp=1,2, ...,n?1;k=0,1, ...,p, and $$V_k (E;n,p) = \int\limits_{\Omega _k^n } {V_0 (E \cap \tau )^{{{(n - p)} \mathord{\left/ {\vphantom {{(n - p)} {(n - k)}}} \right. \kern-\nulldelimiterspace} {(n - k)}}} d\mu _\tau ,}$$ whereΩ _k ⁿ is the set of all (n-k)-dimensional hyperplanesτ?R ⁿ anddμ _τ is the Haar measure on the spaceΩ _k ⁿ ; furthermore, let $$V_n (E;n,n - 1) = mes_n E.$$ . Theorem. Let E?Rⁿ, p=1, 2 ..., n?1, V_p+1(E;n,p)=0, and V_k(E; n, p)<∞ for k= =0,1, ..., p. Then the contingency of the set E at a point x∈E coincides with a certain p-dimensional hyperplane for almost all points x∈E in the sense of Hausdorff p-measure.     

THE EXTREME POINTS OF SEVERAL CLASSES OF ANALYTIC FUNCTIONS

1Intr0ducti0nLetAden0tethesetofallfunctionsanalyticinA={z:Izl<1}.LetB={W:WEAandIW(z)l51}.Aisalocallyconvexlineaztop0l0gicalspacewithrespecttothetopologyofuniformconvergenceon`c0mpact8ubsetsofA-LetTh(c1,'tc.-1)={p(z):p(z)EA,Rop(z)>0,p(z)=1 clz czzz ' c.-lz"-l 4z" ',wherecl,',cn-1areforedcomplexconstants}.LetTh,.(b,,-..,b,-,)={p(z):P(z)'EAwithReP(z)>Oandp(z)=1 blz ' b.-lz"-l 4z" '-,wherebl,-'-jbu-1areffeedrealconstantsanddkarerealnumbersf0rk=n,n 1,'--}-LetTu(l1,'i'tI.-1)={…     

Sums over numbers with restricted prime factors

For k a non-negative integer, let P_k(n) denote the kth largest prime factor of n where P₀(n) = +∞ and if the number of prime factors of n is less than k, then P_k(n) = 1. We shall study the asymptotic behavior of the sum Ψ_k(x, y; g) = Σ_{1 ≤ n ≤ x, Pk(n) ≤ y}g(n), where g(n) is an arithmetic function satisfying certain general conditions regarding its behavior on primes. The special case where g(n) = μ(n), the Möbius function, is discussed as an application.     

Copositive pointwise approximation

We prove that if a functionf ∈C ⁽¹⁾ (I),I: = [?1, 1], changes its signs times (s ∈ ?) within the intervalI, then, for everyn > C, whereC is a constant which depends only on the set of points at which the function changes its sign, andk ∈ ?, there exists an algebraic polynomialP _n =P _n (x) of degree ≤n which locally inherits the sign off(x) and satisfies the inequality $$\left| {f\left( x \right) - P_n \left( x \right)} \right| \leqslant c\left( {s,k} \right)\left( {\frac{1}{{n^2 }} + \frac{{\sqrt {1 - x^2 } }}{n}} \right)\omega _k \left( {f'; \frac{1}{{n^2 }} + \frac{{\sqrt {1 - x^2 } }}{n}} \right), x \in I$$ , where ω _k (f′;t) is thekth modulus of continuity of the functionf’. It is also shown that iff ∈C (I) andf(x) ≥ 0,x ∈I then, for anyn ≥k ? 1, there exists a polynomialP _n =P _n (x) of degree ≤n such thatP _n (x) ≥ 0,x ∈I, and |f(x) ?P _n (x)| ≤c(k)ω _k (f;n ^?2 +n ^?1 √1 ?x ²),x ∈I.     

Neuere Untersuchungen über die Jacobsthal-Funktiong(n)

The Jacobsthal functiong(n) is defined as the maximal distance between two integers relatively prime ton. Letk, l,... be natural numbers, letp ₁,p ₂,... be primes. From $$3 \leqq l \leqq p_1< ...< p_{l - 1}< k + 2 - l \leqq p_l< ...< p_k $$ followsTheorem 1. g(p ₁ ...p _k )≦g(p ₁ ...p _l?1 )g(p _l ...p _k )=l(k+2?l), ifkl is large enough.Theorem 1′. From (1) and12≦l followsg(p ₁ ...p _k )≦l(k+2?l).     

Uniform ergodic convergence and averaging along Markov chain trajectories

LetP(x, A) be a transition probability on a measurable space (S, Σ) and letX _n be the associated Markov chain.Theorem. Letf∈B(S, Σ). Then for anyx∈S we haveP _x a.s. $$\mathop {\underline {\lim } }\limits_{n \to \infty } \frac{1}{n}\sum\limits_{k = 1}^n {f(X_k ) \geqslant } \mathop {\underline {\lim } }\limits_{n \to \infty } \mathop {\inf }\limits_{x \in S} \frac{1}{n}\sum\limits_{k = 1}^n {P^k f(x)} $$ and (implied by it) a corresponding inequality for the lim. If 1/n∑ _k=1 ⁿ P ^k f converges uniformly, then for everyx∈S, 1/n ∑ _k=1 ⁿ f(X _k ) convergesP _x a.s. Applications are made to ergodic random walks on amenable locally compact groups. We study the asymptotic behavior of 1/n∑ _k=1 ⁿ μ ^k *f and of 1/n∑ _k=1 ⁿ f(X _k ) via that ofΨ _n *f(x)=m(A _n )^?1∫ _An f(xt), where {A _n } is a Følner sequence, in the following cases: (i)f is left uniformly continuous (ii) μ is spread out (iii)G is Abelian. Non-Abelian Example: Let μ be adapted and spread-out on a nilpotent σ-compact locally compact groupG, and let {A _n } be a Følner sequence. If forf∈B(G, ∑) m(A _n )^?1∫ _An f(xt)dm(t) converges uniformly, then 1/n∑ _k=1 ⁿ f(X _k ) converges uniformly, andP _x convergesP _x a.s. for everyx∈G.     

Spectral decomposition and Gelfand’s theorem

We consider the spectral decomposition of A, the generator of a polynomially bounded n-times integrated group whose spectrum set $\sigma(A)=\{i\lambda_{k};k\in\mathbb{\mathbb{Z}}^{*}\}We consider the spectral decomposition of A, the generator of a polynomially bounded n-times integrated group whose spectrum set s(A)={il_k;k ? \mathbb\mathbbZ^*}\sigma(A)=\{i\lambda_{k};k\in\mathbb{\mathbb{Z}}^{*}\} is discrete and satisfies ?\frac1|l_k|^ld_kⁿ < ￥\sum \frac{1}{|\lambda_{k}|^{\ell}\delta_{k}^{n}}<\infty , where ℓ is a nonnegative integer and d_k=min(\frac|l_k+1-l_k|2,\frac|l_k-1-l_k|2)\delta _{k}=\min(\frac{|\lambda_{k+1}-\lambda _{k}|}{2},\frac{|\lambda _{k-1}-\lambda _{k}|}{2}) . In this case, Theorem 3, we show by using Gelfand’s Theorem that there exists a family of projectors (P_k)_{k ? \mathbb\mathbbZ^*}(P_{k})_{k\in\mathbb{\mathbb{Z}}^{*}} such that, for any x∈D(A ^n+ℓ ), the decomposition ∑P _k x=x holds.     

Nonparametric estimation of mixed partial derivatives of a multivariate density

On the basis of a random sample of size n on an m-dimensional random vector X, this note proposes a class of estimators f_n^(p) of f^(p), where f is a density of X w.r.t. a σ-finite measure dominated by the Lebesgue measure on R^m, p = (p₁,…,p_m), p_j ≥ 0, fixed integers, and for x = (x₁,…,x_m) in R^m, f^(p)(x) = ?^p₁+…+p_m f(x)/(?^p₁x₁ … ?^p_mx_m). Asymptotic unbiasedness as well as both almost sure and mean square consistencies of f_n^(p) are examined. Further, a necessary and sufficient condition for uniform asymptotic unbisedness or for uniform mean square consistency of f_n^(p) is given. Finally, applications of estimators of this note to certain statistical problems are pointed out.     

A multiindexed sturm sequence of polynomials and unimodality of certain combinatorial sequences

With any multiset n we associate the numbers $\text{O}$(n, k) of compositions of n into exactly k parts. The polynomials k_n(x) = Σ_kO(n, k)x^k are shown to form a multiindexed Sturm sequence over (?1, 0). As consequences we obtain the unimodality of the sequence {O(n, k)}_k for any n, of the generalized Eulerian numbers, and of the number of compositions of n with certain supplementary conditions imposed on the parts. The strong logarithmic concavity of the Stirling numbers of the second kind also follows as a corollary.     

Orthogonal polynomials—centroid of their zeroes

Let c _n,k (k=1,...,n) the n zeroes of the monic orthogonal polynomials family P _n (x). The centroid of these zeroes: $s_n=\frac1n \sum\limits^n_{k=1}c_{n,k}$ controls globally the distribution of the zeroes, and it is relatively easy to obtain information on s _n , like bounds, inequalities, parameters dependence, ..., from the links between s _n , the coefficients of the expansion of P _n (x), and the coefficients β _n , γ _n in the basic recurrence relation satisfied by P _n (x). After a review of basic properties of the centroid on polynomials, this work gives some results on the centroid of a large class of orthogonal polynomials.     

Note on the local growth of iterated polynomials

The local behavior of the iterates of a real polynomial is investigated. The fundamental result may be stated as follows: THEOREM. Let x_i, for i=1, 2, ..., n+2, be defined recursively by x_i+1=f(x_i), where x₁ is an arbitrary real number and f is a polynomial of degree n. Let x_i+1?x_i≧1 for i=1, ..., n + 1. Then for all i, 1 ≦i≦n, and all k, 1≦k≦n+1?i, $$ - \frac{{2^{k - 1} }}{{k!}}< f\left[ {x_1 ,... + x_{i + k} } \right]< \frac{{x_{i + k + 1} - x_{i + k} + 2^{k - 1} }}{{k!}},$$ where f[x_i, ..., x_i+k] denotes the Newton difference quotient. As a consequence of this theorem, the authors obtain information on the local behavior of the solutions of certain nonlinear difference equations. There are several cases, of which the following is typical: THEOREM. Let {x_i}, i = 1, 2, 3, ..., be the solution of the nonlinear first order difference equation x_i+1=f(x_i) where x₁ is an arbitrarily assigned real number and f is the polynomial \(f(x) = \sum\limits_{j = 0}^n {a_j x^j } ,n \geqq 2\) . Let δ be positive with δ^n?1=|2^n?1/n!a_n|. Then, if n is even and a_n<0, there do not exist n + 1 consecutive increments Δx_i=x_i+1?x_i in the solution {x_i} with Δx_i≧δ. The special case in which the iterated polynomial has integer coefficients leads to a “nice” upper bound on a generalization of the van der Waerden numbers. Ap _k -sequence of length n is defined to be a strictly increasing sequence of positive integers {x ₁, ...,x _n } for which there exists a polynomial of degree at mostk with integer coefficients and satisfyingf(x _j )=x _j+1 forj=1, 2, ...,n?1. Definep _k (n) to be the least positive integer such that if {1, 2, ...,p _k (n)} is partitioned into two sets, then one of the two sets must contain ap _k -sequence of lengthn. THEOREM. p_n?2(n)≦(n!)^(n?2)!/2.     

Representations for the first associated q-classical orthogonal polynomials

Let {p_k(x; q)} be any system of the q-classical orthogonal polynomials, and let be the corresponding weight function, satisfying the q-difference equation D_q(σ)=τ, where σ and τ are polynomials of degree at most 2 and exactly 1, respectively. Further, let {p_k⁽¹⁾(x;q)} be associated polynomials of the polynomials {p_k(x; q)}. Explicit forms of the coefficients b_n,k and c_n,k in the expansions

are given in terms of basic hypergeometric functions. Here _k(x) equals x^k if σ⁺(0)=0, or (x;q)_k if σ⁺(1)=0, where σ⁺(x)σ(x)+(q−1)xτ(x). The most important representatives of those two classes are the families of little q-Jacobi and big q-Jacobi polynomials, respectively.Writing the second-order nonhomogeneous q-difference equation satisfied by p_n−1⁽¹⁾(x;q) in a special form, recurrence relations (in k) for b_n,k and c_n,k are obtained in terms of σ and τ.