Polynomial expansions and generating functions

We study expansions in polynomials {P_n(x)}^∞_o generated by ∑^∞_{n = o}P_n(x)tⁿ = A(t) φ(xt^kθ(t)), θ(0) ≠ 0, and ∑^∞_{n = 0}P_n(x)tⁿ = ∑^k_{j = 1}A_j(t) φ(xt?_j), ?₁,…,?_k being the k roots of unity. The case k = 1 is contained in a recent work by Fields and Ismail. We also prove a new generalization of Vandermond's inverse relations.     

Accurate approximation of time-varying matrices of linear differential systems

We consider the problem of the identification of the time-varying matrix A(t) of a linear m-dimensional differential system y′ = A(t)y. We develop an approximation A_n,k = ∑ⁿ_{j ? 1}c_j{Y(t_k + τ_j) Y^?1(t_k) ? I} to A(t_k) for grid points t_k = a + kh, k = 0,…, N using specified τ_j = θ_jh, 0 < θ_j < 1, j = 1, …, n, and show that for each t_k, the L₁ norm of the error matrix is $\text{O}$(hⁿ). We demonstrate an efficient scheme for the evaluation of A_n,k and treat sample problems.     

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

Exact constants in Jackson inequalities for periodic differentiable functions in the space L ∞

It is proved that, in the space L _∞[0, 2π], the following equalities hold for all k = 0, 1, 2, …, n ∈ ?, r = 1, 3, 5, …, µ≥ r: where E _n?1(f) and E _n,µ (f) are the best approximations of f by, respectively, trigonometric polynomials of degree n ? 1 and 2π-periodic splines of minimal deficiency of order µ with 2n equidistant nodes, ω(f ^(r), h) is the modulus of continuity of f ^(r), Ψ _r,2k+1 is the rth periodic integral of the special function Ψ _0,2k+1, which is odd and piecewise constant on the partition jπ/(2k + 1), j ∈ ?. For k = 0, this result was obtained earlier by Ligun.     

L（1, 2）-edge-labelings for lattices

For a graph G and two positive integers j and k, an m-L(j, k)-edge-labeling of G is an assignment on the edges to the set {0, 1, 2,..., m}, such that adjacent edges which receive labels differ at least by j, and edges which are distance two apart receive labels differ at least by kThe λ j,k-number of G is the minimum m such that an m-L(j, k)-edge-labeling is admitted by GIn this article, the L(1, 2)-edge-labeling for the hexagonal lattice, the square lattice and the triangular lattice are studied, and the bounds for λ j,k-numbers of these graphs are obtained.     

Bound on integrals: Elimination of the dual and reduction of the number of equality constraints

Let L_j (j = 1, …, n + 1) be real linear functions on the convex set $\text{F}$ of probability distributions. We consider the problem of maximization of L_n+1(F) under the constraint F ? $\text{F}$ and the equality constraints L₁(F) = z₁ (i = 1, …, n). Incorporating some of the equality constraints into the basic set $\text{F}$, the problem is equivalent to a problem with less equality constraints. We also show how the dual problems can be eliminated from the statement of the main theorems and we give a new illuminating proof of the existence of particular solutions.The linearity of the functions L_j(j = 1, …, n + 1) can be dropped in several results.     

An extremal problem for finite topologies and distributive lattices

Let (r₁, r₂, …) be a sequence of non-negative integers summing to n. We determine under what conditions there exists a finite distributive lattice L of rank n with r_i join-irreducibles of rank i, for all i = 1, 2, …. When L exists, we give explicit expressions for the greatest number of elements L can have of any given rank, and for the greatest total number of elements L can have. The problem is also formulated in terms of finite topological spaces.     

On the rate for uniform strong consistency of empirical distributions of independent nonidentically distributed multivariate random variables

Let X_j = (X_1j ,…, X_pj), j = 1,…, n be n independent random vectors. For x = (x₁ ,…, x_p) in R^p and for α in [0, 1], let F_j${}^1$(x) = αI(X_1j < x₁ ,…, X_pj < x_p) + (1 ? α) I(X_1j ≤ x₁ ,…, X_pj ≤ x_p), where I(A) is the indicator random variable of the event A. Let F_j(x) = E(F_j${}^1$(x)) and D_n = sup_{x, α} max_{1 ≤ N ≤ n} |Σ₀ⁿ(F_j${}^1$(x) ? F_j(x))|. It is shown that P[D_n ≥ L] < 4pL exp{?2(L²n^?1 ? 1)} for each positive integer n and for all L² ≥ n; and, as n → ∞, $\text{D}{}_{\mathrm{n}}\text{= 0((n}\text{log}\text{n)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{)}$ with probability one.     

Some explicit formulae in simultaneous padé approximation

Using old results on the explicit calculation of determinants, formulae are given for the coefficients of P₀(z) and P₀(z)f_i(z) ? P_i(z), where P_i(z) are polynomials of degree σ ? ρ_i (i=0,1,…,n), P₀(z)f_i(z) ? P_i(z) are power series in which the terms with z^k, 0?k?σ, vanish (i=1,2,…,n), (ρ₀,ρ₁,…,ρ_n) is an (n+1)-tuple of nonnegative integers, σ=ρ₀+ρ₁+?+ρ_n, and {f_i}ⁿ_i=1 is the set of hypergeometric functions {₁F₁(1;c_i;z)}ⁿ_i=1$\text{(c}{}_{\mathrm{i}}\text{?}\text{Z}\text{z.drule;}\text{N}\text{, c}{}_{\mathrm{i}}\text{? c}{}_{\mathrm{j}}\text{?}\text{Z}\text{)}$ or {₂F₀(a_i,1;z)}ⁿ_i=1$\text{(a}{}_{\mathrm{i}}\text{?}\text{Z}\text{?}\text{N}\text{, a}{}_{\mathrm{i}}\text{? a}{}_{\mathrm{j}}\text{?}\text{Z}\text{)}$ under the condition ρ₀?ρ_i ? 1 (i=1,2,…,n).     

Bernstein type operators having 1 and x j as fixed points

For certain generalized Bernstein operators {L _n } we show that there exist no i, j ∈ {1, 2, 3,…}, i < j, such that the functions e _i (x) = x ⁱ and e _j (x) = x ^j are preserved by L _n for each n = 1, 2,… But there exist infinitely many e _i such that e ₀(x) = 1 and e _j (x) = x _j are its fixed points.     

Laguerre polynomial expansions in indefinite inner product spaces

When ?j ? 1 < α < ?j, where j is a positive integer, the Laguerre polynomials {L_n^(α)}_{n = 0}^∞ form a complete orthogonal set in a nondegenerate inner product space H which is defined by employing an appropriate regularized linear functional on H^(j)[[0, ∞); x^{α + j}e^?x]. Expansions in terms of these Laguerre polynomials are exhibited. The Laguerre differential operator is shown to be self-adjoint with real, discrete, integer eigenvalues. Its spectral resolution and resolvent are exhibited and discussed.     

A symmetry relationship for a class of partitions

Let S(n, k, v) denote the number of vectors (a₀,…, a_n?1) with nonnegative integer components that satisfy a₀ + … + a_{n ? 1} = k and Σ_i=0^n?1ia_i ≡ v (mod n). Two proofs are given for the relation S(n, k, v) = S(k, n, v). The first proof is by algebraic enumeration while the second is by combinatorial construction.     

Optimal labelling of a product of two paths

If G is a graph with p vertices and at least one edge, we set φ (G) = m n max |f(u) ? f(v)|, where the maximum is taken over all edges uv and the minimum over all one-to-one mappings f : V(G) → {1, 2, …, p}: V(G) denotes the set of vertices of G.P_n will denote a path of length n whose vertices are integers 1, 2, …, n with i adjacent to j if and only if |i ? j| = 1. P_m × P_n will denote a graph whose vertices are elements of {1, 2, …, m} × {1, 2, …, n} and in which (i, j), (r, s) are adjacent whenever either i = r and |j ? s| = 1 or j = s and |i ? r| = 1.Theorem.If max(m, n) ? 2, thenφ(P_m × P_n) = min(m, n).     

Product formulas for semigroups with elliptic generators

Real constant coefficient nth order elliptic operators, Q, which generate strongly continuous semigroups on L²($\text{R}$^k) are analyzed in terms of the elementary generator,

$\text{A = (?n)}{}^{\mathrm{<mtext>(</mtext><mtext>n</mtext><mtext>2</mtext><mtext>\; ?\; 1</mtext>}}\text{)(n!)}{}^{\mathrm{?1}}\text{∑}\text{k}\text{j = 1}\text{?}{}^{\mathrm{n}}\text{?x}{}_{\mathrm{j}}{}^{\mathrm{n}}$

, for n even. Integral operators are defined using the fundamental solutions p_n(x, t) to u_t = Au and using real polynomials q_l,…, q_k on $\text{R}$^m by the formula, for q = (q_l,…, q_k),

$\text{(F(t)?)(x) = ∫}$

_$\text{R}$m

$\text{?(x + q(z)) P}{}_{\mathrm{n}}\text{(z, t)dz}$

. It is determined when, strongly on L²($\text{R}$^k),

$\text{e}{}^{\mathrm{tQ}}\text{=}\text{lim}\text{j → ∞}\text{F}\text{t}\text{j}{}^{\mathrm{j}}$

. If n = 2 or k = 1, this can always be done. Otherwise the symbol of Q must have a special form.     

A generalization of the Kruskal-Katona theorem

Let k_n ? k_n?1 ? … ? k₁ be positive integers and let ($\text{i}\text{j}$) denote the coefficient of xⁱ in $\text{Π}\text{r=1}\text{j}\text{(1 + x + x}{}^2\text{+ … + x}{}^{\mathrm{kr}}\text{)}$. For given integers l, m, where 1 ? l ? k_n + k_n?1 + … + k₁ and $\text{1 ? m ? (}\text{n}\text{n}\text{)}$, it is shown that there exist unique integers m(l), m(l ? 1),…, m(t), satisfying certain conditions, for which $\text{m = (}\text{m(l)}\text{l}\text{+ (}\text{m(l?1)}\text{l?1}\text{) + … + (}\text{m(t)}\text{t}\text{)}$. Moreover, any m l-subsets of a multiset with k_i elements of type i, i = 1, 2,…, n, will contain at least $\text{(}\text{m(l)}\text{l?1}\text{) + (}\text{m(l?1)}\text{l?2}\text{) + … + (}\text{m(t)}\text{t?1}$ different (l ? 1)-subsets. This result has been anticipated by Greene and Kleitman, but the formulation there is not completely correct. If k₁ = 1, the numbers ($\text{j}\text{i}$) are binomial coefficients and the result is the Kruskal-Katona theorem.     

On estimates of lengths of lemniscates

For any natural number n and any C > 0, we obtain an integral formula for calculating the lengths |L(P _n , C)| of the lemniscates $$L\left( {P_n ,C} \right): = \left\{ {z:\left| {P_n \left( z \right)} \right| = C} \right\}$$ of algebraic polynomials P _n (z):= z ⁿ + c _n?1 z ^n?1 + ... + c ₀ in the complex variable z with complex coefficients c _j , j = 0, ..., n ? 1, and establish the upper bound for the quantities $$\lambda _n : = \sup \left\{ {\left| {L\left( {P_n ,1} \right)} \right|:P_n (z)} \right\},$$ which is currently best for 3 ≤ n ≤ 10¹⁴. We also study the properties of the derivative S′(C) of the area function S(C) of the set {z: |P _n (z)| ≤ C}.