The ordering of trees and connected graphs by algebraic connectivity

In this paper, we first determine that the first four trees of order n?9 with the smallest algebraic connectivity are P_n,Q_n,W_n and Z_n with α(P_n)<α(Q_n)<α(W_n)<α(Z_n)<α(T), where T is any tree of order n other than P_n, Q_n, W_n, and Z_n. Then we consider the effect on the Laplacian eigenvalues of connected graphs by suitably adding edges. By using these results and methods, we finally determine that the first six connected graphs of order n?9 with the smallest algebraic connectivity are and , with , where G is any connected graph of order n other than P_n, Q_n, , W_n, and .     

Divisors of the number of Latin rectangles

A k×n Latin rectangle on the symbols {1,2,…,n} is called reduced if the first row is (1,2,…,n) and the first column is T(1,2,…,k). Let Rk,n be the number of reduced k×n Latin rectangles and m=⌊n/2⌋. We prove several results giving divisors of Rk,n. For example, (k−1)! divides Rk,n when k?m and m! divides Rk,n when m<k?n. We establish a recurrence which determines the congruence class of for a range of different t. We use this to show that Rk,n≡((−1)^k−1(k−1)!)ⁿ⁻¹. In particular, this means that if n is prime, then Rk,n≡1 for 1?k?n and if n is composite then if and only if k is larger than the greatest prime divisor of n.     

Strong convergence theorems for uniformly continuous pseudocontractive maps

Let K be a nonempty closed convex subset of a real Banach space E and let be a uniformly continuous pseudocontraction. Fix any u∈K. Let {xn} be defined by the iterative process: x₀∈K, xn+1:=μn(αnTxn+(1−αn)xn)+(1−μn)u. Let δ(?) denote the modulus of continuity of T with pseudo-inverse ?. If and {xn} are bounded then, under some mild conditions on the sequences n{αn} and n{μn}, the strong convergence of {xn} to a fixed point of T is proved. In the special case where T is Lipschitz, it is shown that the boundedness assumptions on and {xn} can be dispensed with.     

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

On polynomial-like functions

A polynomial-like function (PLF) of degree n is a smooth function F whose nth derivative never vanishes. A PLF has ?n real zeros; in case of equality it is called hyperbolic; F(i) has ?n−i real zeros. We consider the arrangements of the n(n+1)/2 distinct real numbers , i=0,…,n−1, k=1,…,n−i, which satisfy the conditions . We ask the question whether all such arrangements are realizable by the roots of a hyperbolic PLF and its derivatives. We show that for n?5 the answer is negative.     

Toeplitz operators associated to commuting row contractions

Let H be a complex Hilbert space and let {Tn}_n?1 be a sequence of commuting bounded operators on H such that . Let denote the space of all operators X in B(H) for which and suppose that . We will show that there exists a triple {K,Γ,{Un}_n?1} where K is a Hilbert space, Γ:K→H is a bounded operator and {Un}_n?1⊂B(K) is a sequence of commuting normal operators with such that TnΓ=ΓUn for n?1, and for which the mapping Y?ΓYΓ^∗ is a complete isometry from the commutant of {Un}_n?1 onto the space . Moreover we show that the inverse of this mapping can be extended to a ^∗-homomorphism

     

On the properties of Newton-Euler pairs

If and are two sequences such that a₁=b₁ and , then we say that (a_n,b_n) is a Newton-Euler pair. In the paper, we establish many formulas for Newton-Euler pairs, and then make use of them to obtain new results concerning some special sequences such as and B_n, where p(n) is the number of partitions of n, σ(n) is the sum of divisors of n, and B_n is the nth Bernoulli number.     

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.     

On Wohlfahrt series and wreath products

Suppose that a group A contains only a finite number of subgroups of index d for each positive integer d. Let G?Sn be the wreath product of a finite group G with the symmetric group Sn on {1,…,n}. For each positive integer n, let Kn be a subgroup of G?Sn containing the commutator subgroup of G?Sn. If the sequence satisfies a certain compatible condition, then the exponential generating function of the sequence takes the form of a sum of exponential functions.     

On root arrangements for hyperbolic polynomial-like functions and their derivatives

A real polynomial P of degree n in one real variable is hyperbolic if its roots are all real. A real-valued function P is called a hyperbolic polynomial-like function (HPLF) of degree n if it has n real zeros and P(n) vanishes nowhere. Denote by the roots of P(i), k=1,…,n−i, i=0,…,n−1. Then in the absence of any equality of the form one has ∀i<j, (the Rolle theorem). For n?4 (resp. for n?5) not all arrangements without equalities (∗) of n(n+1)/2 real numbers and compatible with (∗∗) (we call them admissible) are realizable by the roots of hyperbolic polynomials (resp. of HPLFs) of degree n and of their derivatives. For n=5 we show that from 286 admissible arrangements, exactly 236 are realizable by HPLFs; from these 236 arrangements, 116 are realizable by hyperbolic polynomials and 24 by perturbations of such.     

Ingham-type inequalities for complex frequencies and applications to control theory

For complex valued sequences of the form ωn=an+ibn with an∈R and bn?0, we prove inequalities of the form , for all sequences {xn} with . We apply these to prove exact null-controllability for a class of hinged beam equations with mild internal damping with either boundary control or internal control.     

Strong convergence theorems for fixed points of asymptotically pseudocontractive semi-groups

Let K be a nonempty closed convex and bounded subset of a real Banach space E. Let be a strongly continuous uniformly asymptotically regular and uniformly L-Lipschitzian semi-group of asymptotically pseudocontractive mappings from K into K. Then for a given u∈K there exists a sequence {y_n}∈K satisfying the equation y_n=(1−α_n)(T(t_n))ⁿy_n+α_nu for each , where α_n∈(0,1) and t_n>0 satisfy appropriate conditions. Suppose further that E is uniformly convex and has uniformly Gâteaux differentiable norm, under suitable conditions on the mappings T, the sequence {y_n} converges strongly to a fixed point of . Furthermore, an explicit sequence {x_n} generated from x₁∈K by x_n+1:=(1−λ_n)x_n+λ_n(T(t_n))ⁿx_n−λ_nθ_n(x_n−x₁) for all integers n?1, where {λ_n}, {θ_n} are positive real sequences satisfying appropriate conditions, converges strongly to a fixed point of .     

Strong and weak convergence theorems for common fixed points of nonself asymptotically nonexpansive mappings

Suppose that K is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach space E. Let be two nonself asymptotically nonexpansive mappings with sequences {kn},{ln}⊂[1,∞), limn→∞kn=1, limn→∞ln=1, , respectively. Suppose {xn} is generated iteratively by

     

Path-kipas Ramsey numbers

For two given graphs F and H, the Ramsey number R(F,H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a subgraph or the complement of G contains H as a subgraph. In this paper, we study the Ramsey numbers , where P_n is a path on n vertices and is the graph obtained from the join of K₁ and P_m. We determine the exact values of for the following values of n and m: 1?n?5 and m?3; n?6 and (m is odd, 3?m?2n-1) or (m is even, 4?m?n+1); 6?n≤7 and m=2n-2 or m?2n; n?8 and m=2n-2 or m=2n or (q·n-2q+1?m?q·n-q+2 with 3?q?n-5) or m?(n-3)²; odd n?9 and (q·n-3q+1?m?q·n-2q with 3?q?(n-3)/2) or (q·n-q-n+4?m?q·n-2q with (n-1)/2?q?n-4). Moreover, we give lower bounds and upper bounds for for the other values of m and n.     

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.     

q-Partition algebra combinatorics

We study a q-analog Qr(n,q) of the partition algebra Pr(n). The algebra Qr(n,q) arises as the centralizer algebra of the finite general linear group GLn(Fq) acting on a vector space coming from r-iterations of Harish-Chandra restriction and induction. For n?2r, we show that Qr(n,q) has the same semisimple matrix structure as Pr(n). We compute the dimension to be a q-polynomial that specializes as dn,r(1)=nr and dn,r(0)=B(r), the rth Bell number. Our method is to write dn,r(q) as a sum over integer sequences which are q-weighted by inverse major index. We then find a basis of indexed by n-restricted q-set partitions of {1,…,r} and show that there are dn,r(q) of these.     

A spectral condition for odd cycles in graphs

Let G be a graph of sufficiently large order n, and let the largest eigenvalue μ(G) of its adjacency matrix satisfies . Then G contains a cycle of length t for every t?n/320This condition is sharp: the complete bipartite graph T₂(n) with parts of size ⌊n/2⌋ and ⌈n/2⌉ contains no odd cycles and its largest eigenvalue is equal to .This condition is stable: if μ(G) is close to and G fails to contain a cycle of length t for some t?n/321, then G resembles T₂(n).