On the Order of Magnitude of the Divisor Function

Let D be an increasing sequence of positive integers, and consider the divisor functions： d（n, D） =∑d｜n,d∈D,d≤√n1, d2（n,D）=∑[d,δ]｜n,d,δ∈D,[d,δ]≤√n1, where [d,δ]=1.c.m.（d,δ）. A probabilistic argument is introduced to evaluate the series ∑n=1^∞and（n,D） and ∑n=1^∞and2（n,D）.     

A Representation of the Lorentz Spin Group and Its Application

For an integer m ≥ 4, we define a set of 2[m/2] × 2[m/2] matrices γj （m）, （j = 0, 1,..., m - 1） which satisfy γj （m）γk （m） ＋γk （m）γj （m） = 2ηjk （m）I[m/2], where （ηjk （m）） 0≤j,k≤m-1 is a diagonal matrix, the first diagonal element of which is 1 and the others are -1, I[m/2] is a 2[m/1] × 2[m/2] identity matrix with [m/2] being the integer part of m/2. For m = 4 and 5, the representation （m） of the Lorentz Spin group is known. For m≥ 6, we prove that （i） when m = 2n, （n ≥ 3）, （m） is the group generated by the set of matrices {T｜T=1/√ξ（（I＋k） 0 ＋ 0 I-K） （ U 0 0 U）, （ii） when m = 2n ＋ 1 （n≥ 3）, （m） is generated by the set of matrices {T｜T=1/√ξ（I -k^- k I）U,U∈ （m-1）,ξ=1-m-2 ∑k,j=0 ηkja^k a^j〉0, K=i[m-3 ∑j=0 a^j γj（m-2）＋a^（m-2） In],K^-=i[m-3∑j=0 a^j γj（m-2）-a^（m-2） In]}     

Bounds for the Extreme Eigenvalues of Block 2 × 2 Hermitian Matrices

Let an n × n Hermitian matrix A be presented in block 2 × 2 form as , where A₁₂ ≠ 0, and assume that the diagonal blocks A₁₁ and A₂₂ are positive definite. Under these assumptions, it is proved that the extreme eigenvalues of A satisfy the bounds

A Minimal-Automaton-Based Algorithm for the Reliability of Con(d,k, n) Systems

A d-within-consecutive-k-out-of-n system, abbreviated as Con(d, k, n), is a linear system of n components in a line which fails if and only if there exists a set of k consecutive components containing at least d failed ones. So far the fastest algorithm to compute the reliability of Con(d, k, n) is Hwang and Wright's algorithm published in 1997, where . In this paper we use automata theory to reduce to . For d small or close to k, we have reduced from exponentially many (in k) to polynomially many. The computational complexity of our final algorithm is , where .     

Parameter Estimates in Random Intercept Mixed Effects Model for Repeated Measures

In this article the following random intercept mixed effects model will be considered： yij = vi =v^τijβ＋ εij,i=1,…,m;j=1,2,…,ni, where {vi} are i.i.d, random effects with mean α 2. 2 and finite variance σ^2 v, {εij} are i.i.d, random errors with finite variance ε^2 ε. Here we will estimate α,σ^2 v,σ^2 ε,β and study their large sample properties, such as strong consistency, strong convergence rates and asymptotic normality.     

Extensions of hereditary algebras

Let be a triangular matrix algebra, uhere k is an algebraically closed field, B is the path algebra of an oriented Dynkin diagram of type E₆ or E₇ or E₈ and M is a finite dimensional k-B-bimodule. The aim of this paper is to determine the representation type of A for any orientation of the Dynkin diagram and for any indecomposable B-module M. This classification is obtained by comparing the representation types of the algebras and using the theory of tilting modules.     

Inclusion-exclusion inequalities

Ifμ is a positive measure, andA ₂, ...,A _n are measurable sets, the sequencesS ₀, ...,S _n andP _[0], ...,P _[n] are related by the inclusion-exclusion equalities. Inequalities among theS _i are based on the obviousP _[k]≧0. Letting =the average average measure of the intersection ofk of the setsA _i , it is shown that (−1) ^k Δ ^k M _i ≧0 fori+k≦n. The casek=1 yields Fréchet’s inequalities, andk=2 yields Gumbel’s and K. L. Chung’s inequalities. Generalizations are given involvingk-th order divided differences. Using convexity arguments, it is shown that forS ₀=1, whenS ₁≧N−1, and for 1≦k<N≦n andv=0, 1, .... Asymptotic results asn → ∞ are obtained. In particular it is shown that for fixedN, for all sequencesM ₀, ...,M _n of sufficiently large length if and only if for 0<t<1.     

Multivariate Refinement Equations and Convergence of Cascade Algorithms in Lp（0〈p〈1）Spaces

We consider the solutions of refinement equations written in the form

The Turán Number Of The Fano Plane

  Let PG₂(2) be the Fano plane, i. e., the unique hypergraph with 7 triples on 7 vertices in which every pair of vertices is contained in a unique triple. In this paper we prove that for sufficiently large n, the maximum number of edges in a 3-uniform hypergraph on n vertices not containing a Fano plane is

Multiple Boundary Concentrating Solutions to Dirichlet Problem of Hénon Equation

Abstract  Let Ω be the unit ball centered at the origin in . We study the following problem

Strong Approximation by Cesàro Means with Critical Index in the Hardy Spaces H p (\mathbb{S}^{{d - 1}} ) (0 < p ≤ 1)

Let be a unit sphere of the d–dimensional Euclidean space ℝ ^d and let (0 < p ≤ 1) denote the real Hardy space on For 0 < p ≤ 1 and let E _j (f,H ^p ) (j = 0, 1, ...) be the best approximation of f by spherical polynomials of degree less than or equal to j, in the space Given a distribution f on its Cesàro mean of order δ > –1 is denoted by For 0 < p ≤ 1, it is known that is the critical index for the uniform summability of in the metric H ^p . In this paper, the following result is proved: Theorem Let 0<p<1 and Then for

The Threshold for the Erdos, Jacobson and Lehel Conjecture to Be True

Let σ（k, n） be the smallest even integer such that each n-term positive graphic sequence with term sum at least σ（k, n） can be realized by a graph containing a clique of k ＋ 1 vertices. Erdos et al. （Graph Theory, 1991, 439-449） conjectured that σ（k, n） = （k - 1）（2n- k） ＋ 2. Li et al. （Science in China, 1998, 510-520） proved that the conjecture is true for k 〉 5 and n ≥ （k2） ＋ 3, and raised the problem of determining the smallest integer N（k） such that the conjecture holds for n ≥ N（k）. They also determined the values of N（k） for 2 ≤ k ≤ 7, and proved that [5k-1/2] ≤ N（k） ≤ （k2） ＋ 3 for k ≥ 8. In this paper, we determine the exact values of σ（k, n） for n ≥ 2k＋3 and k ≥ 6. Therefore, the problem of determining σ（k, n） is completely solved. In addition, we prove as a corollary that N（k） -= [5k-1/2] for k ≥6.     

Some generalizations of Knopp's identity*

For integers a, b and n > 0, define

Counting the number of isotone selfmappings of crowns

Letn>1. The number of all strictly increasing selfmappings of a 2n-element crown is . The number of all order-preserving selfmappings of a 2n-element crown is

Über lineare Komplexe von Räumen höchster Dimension einer nicht entarteten Quadrik

Sunto Conoscendo il modello minimo per la totalità degli S _k ^I d'una schiera giacenti su di una quadrica Q_2k di S_2k+1 si definisce il ? complesso lineare di S _k ^I ? come imagine d'una sezione iperpiana di . Il problema della classificazione projettiva di tali complessi lineari è posto e risolto per k≤5.      

The Existence of Solutions of Elliptic Equations with Neumann Boundary Condition for Superlinear Problems

In this paper, we study and discuss the existence of multiple solutions of a class of non-linear elliptic equations with Neumann boundary condition, and obtain at least seven non-trivial solutions in which two are positive, two are negative and three are sign-changing. The study of problem (1.1):{-△u αu=f(u),x∈Ω, x∈Ω,δu/δr=0,x∈δΩ,is based on the variational methods and critical point theory. We form our conclusion by using the sub-sup solution method, Mountain Pass Theorem in order intervals, Leray-Schauder degree theory and the invariance of decreasing flow.     

An asymptotic formula for the minimal capacity among sets of equal area

We give an asymptotic formula for

Semi-Fredholm Spectrum and Weyl＇s Theorem for Operator Matrices

When A ∈ B（H） and B ∈ B（K） are given, we denote by Mc an operator acting on the Hilbert space HΘ K of the form Me = （ A0 CB）. In this paper, first we give the necessary and sufficient condition for Mc to be an upper semi-Fredholm （lower semi-Fredholm, or Fredholm） operator for some C ∈B（K,H）. In addition, let σSF＋（A） = {λ ∈ C ： A-λI is not an upper semi-Fredholm operator} bc the upper semi-Fredholm spectrum of A ∈ B（H） and let σrsF- （A） = {λ∈ C ： A-λI is not a lower semi-Fredholm operator} be the lower semi Fredholm spectrum of A. We show that the passage from σSF±（A） U σSF±（B） to σSF±（Mc） is accomplished by removing certain open subsets of σSF-（A） ∩σSF＋ （B） from the former, that is, there is an equality σSF±（A） ∪σSF± （B） = σSF± （Mc） ∪＆ where L is the union of certain of the holes in σSF±（Mc） which ilappen to be subsets of σSF- （A） A σSF＋ （B）. Weyl＇s theorem and Browder＇s theorem are liable to fail for 2 × 2 operator matrices. In this paper, we also explore how Weyl＇s theorem, Browder＇s theorem, a-Weyl＇s theorem and a-Browder＇s theorem survive for 2 × 2 upper triangular operator matrices on the Hilbert space.     

Determinantal Inequalities for Accretive-Dissipative Matrices

A matrix is said to be accretive-dissipative if, in its Hermitian decomposition , both matrices B and C are positive definite. Further, if B= I _n, then A is called a Buckley matrix. The following extension of the classical Fischer inequality for Hermitian positive-definite matrices is proved. Let be an accretive-dissipative matrix, k and l be the orders of A ₁₁ and A ₂₂, respectively, and let m = min{k,l}. Then For Buckley matrices, the stronger bound is obtained. Bibliography: 5 titles.     

On the Relationship Between the Baum-Katz-Spitzer Complete Convergence Theorem and the Law of the Iterated Logarithm

For a sequence of i.i.d. Banach space-valued random variables {Xn; n ≥ 1} and a sequence of positive constants {an; n ≥ 1}, the relationship between the Baum-Katz-Spitzer complete convergence theorem and the law of the iterated logarithm is investigated. Sets of conditions are provided under which （i） lim sup n→∞ ｜｜Sn｜｜/an〈∞ a.s.and ∞ ∑n=1（1/n）P（｜｜Sn｜｜/an ≥ε〈∞for all ε 〉 λ for some constant λ ∈ [0, ∞） are equivalent; （ii） For all constants λ ∈ [0, ∞）, lim sup ｜｜Sn｜｜/an =λ a.s.and ^∞∑ n=1（1/n） P（｜｜Sn｜｜/an ≥ε）{〈∞, if ε〉λ =∞,if ε〈λare equivalent. In general, no geometric conditions are imposed on the underlying Banach space. Corollaries are presented and new results are obtained even in the case of real-valued random variables.