Linearized stability analysis of discrete Volterra equations

Various different types of stability are defined, in a unified framework, for discrete Volterra equations of the type x(n)=f(n)+∑ⁿ_j=0K(n,j,x(n)) (n?0). Under appropriate assumptions, stability results are obtainable from those valid in the linear case (K(n,j,x(n))=B(n,j)x(j)), and a linearized stability theory is studied here by using the fundamental and resolvent matrices. Several necessary and sufficient conditions for stability are obtained for solutions of the linear equation by considering the equations in various choices of Banach space , the elements of which are sequences of vectors (, , n,j?0, etc.). We show that the theory, including a number of new results as well as results already known, can be presented in a systematic framework, in which results parallel corresponding results for classical Volterra integral equations of the second kind.     

Resolvable group divisible designs with block size four and general index

In this paper, we investigate the existence of resolvable group divisible designs (RGDDs) with block size four, group-type hⁿ and general index λ. The necessary conditions for the existence of such a design are n≥4, and . These necessary conditions are shown to be sufficient for all λ≥2, with the definite exceptions of (λ,h,n)∈{(3,2,6)}∪{(2j+1,2,4):j≥1}. The known existence result for λ=1 is also improved.     

Moment conditions and support theorems for Radon transforms on affine Grassmann manifolds

Let G(p,n) and G(q,n) be the affine Grassmann manifolds of p- and q-planes in Rⁿ, respectively, and let be the Radon transform from smooth functions on G(p,n) to smooth functions on G(q,n) arising from the inclusion incidence relation. When p<q and dimG(p,n)=dimG(p,n), we present a range characterization theorem for via moment conditions. We then use this range result to prove a support theorem for . This complements a previous range characterization theorem for via differential equations when dimG(p,n)<dimG(p,n). We also present a support theorem in this latter case.     

Large deviations for martingales and derivatives

Fix a sequence of positive integers (mn) and a sequence of positive real numbers (wn). Two closely related sequences of linear operators (Tn) are considered. One sequence has given by the Lebesgue derivatives . The other sequence has given by the dyadic martingale when (l−1)/n²?x<l/n² for l=1,…,n². We prove both positive and negative results concerning the convergence of .     

Stable functions and Vietoris' theorem

An analytic function f(z) in the unit disc D is called stable if s_n(f,·)/f?1/f holds for all for . Here s_n stands for the nth partial sum of the Taylor expansion about the origin of f, and ? denotes the subordination of analytic functions in . We prove that (1−z)^λ, λ∈[−1,1], are stable. The stability of turns out to be equivalent to a famous result of Vietoris on non-negative trigonometric sums. We discuss some generalizations of these results, and related conjectures, always with an eye on applications to positivity results for trigonometric and other polynomials.     

Perfectness and imperfectness of unit disk graphs on triangular lattice points

Given a finite set of 2-dimensional points P⊆R² and a positive real d, a unit disk graph, denoted by (P,d), is an undirected graph with vertex set P such that two vertices are adjacent if and only if the Euclidean distance between the pair is less than or equal to d. Given a pair of non-negative integers m and n, P(m,n) denotes a subset of 2-dimensional triangular lattice points defined by where . Let T_m,n(d) be a unit disk graph defined on a vertex set P(m,n) and a positive real d. Let be the kth power of T_m,n(1).In this paper, we show necessary and sufficient conditions that [ is perfect] and/or [ is perfect], respectively. These conditions imply polynomial time approximation algorithms for multicoloring (T_m,n(d),w) and .     

Carleson embeddings for Sobolev spaces via heat equation

Let u(t,x) be the solution of the heat equation (∂_t-Δ_x)u(t,x)=0 on subject to u(0,x)=f(x) on Rⁿ. The main goal of this paper is to characterize such a nonnegative measure μ on that f(x)?u(t²,x) induces a bounded embedding from the Sobolev space , p∈[1,n) into the Lebesgue space , q∈(0,∞).     

Resolvable group divisible designs with block size four and index three

In this paper, we investigate the existence of resolvable group divisible designs (RGDDs) with block size four, group-type hⁿ and index three. The necessary conditions for the existence of such a design are n?4 and hn≡0. These necessary conditions are shown to be sufficient except for (h,n)∈{(2,4),(2,6)} and possibly excepting (h,n)=(2,54).     

Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph

In this paper, we prove that directed cyclic Hamiltonian cycle systems of the complete symmetric digraph, , exist if and only if n is odd with n≠15 and n≠p^α for p an odd prime and α≥2 or with n≠2p^α for p an odd prime and α≥1. We also show that directed cyclic Hamiltonian cycle systems of the complete symmetric digraph minus a set of n/2 vertex-independent digons, (K_n−I)^∗, exist if and only if .     

Connectivity preserving transformations for higher dimensional binary images

An N-dimensional digital binary image (I) is a function I:Z^N→{0,1}. I is connected if and only if its black pixels and white pixels are each (3^N−1)-connected. I is only connected if and only if its black pixels are (3^N−1)-connected. For a 3-D binary image, the respective connectivity models are and . A pair of (3^N−1)-neighboring opposite-valued pixels is called interchangeable in a N-D binary image I, if reversing their values preserves the original connectedness. We call such an interchange to be a (3^N−1)-local interchange. Under the above connectivity models, we show that given two binary images of n pixels/voxels each, we can transform one to the other using a sequence of (3^N−1)-local interchanges. The specific results are as follows. Any two -connected 3-dimensional images I and J each having n black voxels are transformable using a sequence of O((c₁+c₂)n²) 26-local interchanges. Here, c₁ and c₂ are the total number of 8-connected components in all 2-dimensional layers of I and J respectively. We also show bounds on connectivity under a different interchange model as proposed in [A. Dumitrescu, J. Pach, Pushing squares around, Graphs and Combinatorics 22 (1) (2006) 37-50]. Next, we show that any two simply connected images under the , connectivity model and each having n black voxels are transformable using a sequence of O(n²) 26-local interchanges. We generalize this result to show that any two , -connected N-dimensional simply connected images each having n black pixels are transformable using a sequence of O(Nn²)(3^N−1)-local interchanges, where N>1.     

The Cameron-Erd?s conjecture

A subset A of integers is said to be sum-free if a+b∉A for any a,b∈A. Let s(n) be the number of sum-free sets in interval [1,n] of integers. P. Cameron and P. Erd?s conjectured that s(n)=O(2^n/2). We show that for even n and for odd n, where are absolute constants, thereby proving the conjecture.     

p-Catalan numbers and squarefree binomial coefficients

In this paper, we consider the generalized Catalan numbers , which we call s-Catalan numbers. For p prime, we find all positive integers n such that p^q divides F(p^q,n), and also determine all distinct residues of , q?1. As a byproduct we settle a question of Hough and the late Simion on the divisibility of the 4-Catalan numbers by 4. In the second part of the paper we prove that if pq?99999, then is not squarefree for n?τ₁(p^q) sufficiently large (τ₁(p^q) computable). Moreover, using the results of the first part, we find n<τ₁(p^q) (in base p), for which may be squarefree. As consequences, we obtain that is squarefree only for n=1,3,45, and is squarefree only for n=1,4,10.     

Hypersurfaces with constant mean curvature in a hyperbolic space

Let Mⁿ be an n-dimensional complete connected and oriented hypersurface in a hyperbolic space Hⁿ⁺¹（c） with non-zero constant mean curvature H and two distinct principal curvatures. In this paper, we show that （1） if the multiplicities of the two distinct principal curvatures are greater than 1,then Mⁿ is isometric to the Riemannian product S^k（r）×H^n-k（-1/（r² + ρ²））, where r > 0 and 1 < k < n - 1;（2）if H² > -c and one of the two distinct principal curvatures is simple, then Mⁿ is isometric to the Riemannian product S^n-1（r） × H¹（-1/（r² +ρ²）） or S¹（r） × H^n-1（-1/（r² +ρ²））,r > 0, if one of the following conditions is satisfied （i） S≤（n-1）t²2+c²t^-22 on Mⁿ or （ii）S≥ （n-1）t²1+c²t^-21 on Mⁿ or（iii）（n-1）t²2+c²t^-22≤ S≤（n-1）t²1+c²t^-21 on Mⁿ, where t₁ and t₂ are the positive real roots of （1.5）.     

A bilinear version of Orlicz-Pettis theorem

Given three Banach spaces X, Y and Z and a bounded bilinear map , a sequence x=n(xn)⊆X is called B-absolutely summable if is finite for any y∈Y. Connections of this space with are presented. A sequence x=n(xn)⊆X is called B-unconditionally summable if is finite for any y∈Y and z^∗∈Z^∗ and for any M⊆N there exists xM∈X for which _∑n∈M〈B(xn,y),z^∗〉=〈B(xM,y),z^∗〉 for all y∈Y and z^∗∈Z^∗. A bilinear version of Orlicz-Pettis theorem is given in this setting and some applications are presented.     

On the value distribution and moments of the Epstein zeta function to the right of the critical strip

We study the Epstein zeta function En(L,s) for and a random lattice L of large dimension n. For any fixed we determine the value distribution and moments of En(⋅,cn) (suitably normalized) as n→∞. We further discuss the random function c?En(⋅,cn) for c∈[A,B] with and determine its limit distribution as n→∞.     

Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence

A bijection is presented between (1): partitions with conditions f_j+f_j+1≤k−1 and f₁≤i−1, where f_j is the frequency of the part j in the partition, and (2): sets of k−1 ordered partitions (n⁽¹⁾,n⁽²⁾,…,n^(k−1)) such that and , where m_j is the number of parts in n^(j). This bijection entails an elementary and constructive proof of the Andrews multiple-sum enumerating partitions with frequency conditions. A very natural relation between the k−1 ordered partitions and restricted paths is also presented, which reveals our bijection to be a modification of Bressoud’s version of the Burge correspondence.