Monotonicity of zeros of Laguerre-Sobolev-type orthogonal polynomials

Denote by , k=1,…,n, the zeros of the Laguerre-Sobolev-type polynomials orthogonal with respect to the inner product

     

Haj?asz-Sobolev imbedding and extension

The author establishes some geometric criteria for a Haj?asz-Sobolev -extension (resp. -imbedding) domain of Rn with n?2, s∈(0,1] and p∈[n/s,∞] (resp. p∈(n/s,∞]). In particular, the author proves that a bounded finitely connected planar domain Ω is a weak α-cigar domain with α∈(0,1) if and only if for some/all s∈[α,1) and p=(2−α)/(s−α), where denotes the restriction of the Triebel-Lizorkin space on Ω.     

Exact rates in log law for positively associated random variables

Let be a strictly stationary sequence of positively associated random variables with mean zero and finite variance. Set , Mn=maxk?n|Sk|, n?1. Suppose . In this paper, we study the exact convergence rates of a kind of weighted infinite series of , and as ε↘0, respectively.     

Riesz transforms associated to Schrödinger operators on weighted Hardy spaces

Let w be some Ap weight and enjoy reverse Hölder inequality, and let L=−Δ+V be a Schrödinger operator on Rn, where is a non-negative function on Rn. In this article we introduce weighted Hardy spaces associated to L in terms of the area function characterization, and prove their atomic characters. We show that the Riesz transform ∇L−1/2 associated to L is bounded on for 1<p<2, and bounded from to the classical weighted Hardy space .     

Some identities involving theta functions

Let (|q|<1). For k∈N it is shown that there exist k rational numbers A(k,0),…,A(k,k−1) such that

     

Some new results on multivariate dispersive ordering of generalized order statistics

Let be generalized order statistics based on a continuous distribution function F with parameters k and (m₁,…,m_n−1). Chen and Hu (2007) [8] investigated the sufficient conditions on F and on the parameters k and m_i’s such that , where , and is the Shaked-Shanthikumar multivariate dispersive order. Since the order does not possess the closure property under marginalization, one may naturally wonder whether the corresponding multivariate margins of the above random vectors are also ordered in the order . This is answered affirmatively in this paper. Some comparison results for generalized order statistics from two samples are presented. Potential applications are also mentioned.     

Bifurcations and distribution of limit cycles which appear from two nests of periodic orbits

In this paper, we study the distribution and simultaneous bifurcation of limit cycles bifurcated from the two periodic annuli of the holomorphic differential equation , after a small polynomial perturbation. We first show that, under small perturbations of the form , where is a polynomial of degree 2m−1 in which the power of z is odd and the power of is even, the only possible distribution of limit cycles is (u,u) for all values of u=0,1,2,…,m−3. Hence, the sharp upper bound for the number of limit cycles bifurcated from each two period annuli of is m−3, for m≥4. Then we consider a perturbation of the form , where is a polynomial of degree m in which the power of z is odd and obtain the upper bound m−5, for m≥6. Moreover, we show that the distribution (u,v) of limit cycles is possible for 0≤u≤m−5, 0≤v≤m−5 with u+v≤m−2 and m≥9.     

On the Brauer group of a semisimple algebraic group

Let k be a field with algebraic closure , G a semisimple algebraic k-group, and a maximal torus with character group X(T). Denote Λ the abstract weight lattice of the roots system of G, and by and the n-torsion subgroup of the Brauer group of k and G, respectively. We prove that if chark does not divide n and n is prime to the order of Λ/X(T) then the natural homomorphism is an isomorphism.     

The orientable genus of some joins of complete graphs with large edgeless graphs

In an earlier paper the authors showed that with one exception the nonorientable genus of the graph with m≥n−1, the join of a complete graph with a large edgeless graph, is the same as the nonorientable genus of the spanning subgraph . The orientable genus problem for with m≥n−1 seems to be more difficult, but in this paper we find the orientable genus of some of these graphs. In particular, we determine the genus of when n is even and m≥n, the genus of when n=2^p+2 for p≥3 and m≥n−1, and the genus of when n=2^p+1 for p≥3 and m≥n+1. In all of these cases the genus is the same as the genus of K_m,n, namely ⌈(m−2)(n−2)/4⌉.     

Note on the energy of regular graphs

For a simple graph G, the energy E(G) is defined as the sum of the absolute values of all the eigenvalues of its adjacency matrix A(G). Let n,m, respectively, be the number of vertices and edges of G. One well-known inequality is that , where λ₁ is the spectral radius. If G is k-regular, we have . Denote . Balakrishnan [R. Balakrishnan, The energy of a graph, Linear Algebra Appl. 387 (2004) 287-295] proved that for each ?>0, there exist infinitely many n for each of which there exists a k-regular graph G of order n with k<n-1 and , and proposed an open problem that, given a positive integer n?3, and ?>0, does there exist a k-regular graph G of order n such that . In this paper, we show that for each ?>0, there exist infinitely many such n that . Moreover, we construct another class of simpler graphs which also supports the first assertion that .     

The coarse shape groups

The (pointed) coarse shape category Sh^* (), having (pointed) topological spaces as objects and having the (pointed) shape category as a subcategory, was recently constructed. Its isomorphisms classify (pointed) topological spaces strictly coarser than the (pointed) shape type classification. In this paper we introduce a new algebraic coarse shape invariant which is an invariant of shape and homotopy, as well. For every pointed space (X,?) and for every k∈N₀, the coarse shape group , having the standard shape group for its subgroup, is defined. Furthermore, a functor is constructed. The coarse shape and shape groups already differ on the class of polyhedra. An explicit formula for computing coarse shape groups of polyhedra is given. The coarse shape groups give us more information than the shape groups. Generally, does not imply (e.g. for solenoids), but from pro-πk(X,?)=0 follows . Moreover, for pointed metric compacta (X,?), the n-shape connectedness is characterized by , for every k?n.     

Isomorphic properties of intersection bodies

We study isomorphic properties of two generalizations of intersection bodies - the class of k-intersection bodies in Rn and the class of generalized k-intersection bodies in Rn. In particular, we show that all convex bodies can be in a certain sense approximated by intersection bodies, namely, if K is any symmetric convex body in Rn and 1≤k≤n−1 then the outer volume ratio distance from K to the class can be estimated by

     

Constructions of optimal quaternary constant weight codes via group divisible designs

Generalized Steiner systems were first introduced by Etzion and used to construct optimal constant weight codes over an alphabet of size g+1 with minimum Hamming distance 2k−3, in which each codeword has length v and weight k. As to the existence of a , a lot of work has been done for k=3, while not so much is known for k=4. The notion k-^∗GDD was first introduced by Chen et al. and used to construct . The necessary condition for the existence of a is v≥14. In this paper, it is proved that there exists a for any prime power and v≥19. By using this result, the known results on the existence of optimal quaternary constant weight codes are then extended.     

The Dirichlet Markov Ensemble

We equip the polytope of n×n Markov matrices with the normalized trace of the Lebesgue measure of Rⁿ². This probability space provides random Markov matrices, with i.i.d. rows following the Dirichlet distribution of mean (1/n,…,1/n). We show that if is such a random matrix, then the empirical distribution built from the singular values of tends as n→∞ to a Wigner quarter-circle distribution. Some computer simulations reveal striking asymptotic spectral properties of such random matrices, still waiting for a rigorous mathematical analysis. In particular, we believe that with probability one, the empirical distribution of the complex spectrum of tends as n→∞ to the uniform distribution on the unit disc of the complex plane, and that moreover, the spectral gap of is of order when n is large.     

On the number of graphs with a given endomorphism monoid

For a given finite monoid , let be the number of graphs on n vertices with endomorphism monoid isomorphic to . For any nontrivial monoid we prove that where and are constants depending only on with .For every k there exists a monoid of size k with , on the other hand if a group of unity of has a size k>2 then .     

Self-correspondences of the generic fibre of Lefschetz pencils and the Leray filtration

In this paper we give a detailed analysis of the interaction between homological self-correspondences of the general fibre Y/k(t) of the Lefschetz fibration of a Lefschetz pencil on a smooth projective variety X/k, and the Leray filtration of ρ. We derive the result that, if the standard conjecture B(Y) holds, then the operator is algebraic, where is defined as the inverse of L on LPn−1(X) and 0 on LkPj(X) for (1,n−1)≠(k,j); in the course of our proof we see that, under the above assumption, the Künneth projectors for i≠n−1,n,n+1 are algebraic.     

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 .     

Uniformly minimum variance nonnegative quadratic unbiased estimation in a generalized growth curve model

Consider the generalized growth curve model subject to R(X_m)⊆?⊆R(X₁), where B_i are the matrices of unknown regression coefficients, and E=(ε₁,…,ε_s)^′ and are independent and identically distributed with the same first four moments as a random vector normally distributed with mean zero and covariance matrix Σ. We derive the necessary and sufficient conditions under which the uniformly minimum variance nonnegative quadratic unbiased estimator (UMVNNQUE) of the parametric function with C≥0 exists. The necessary and sufficient conditions for a nonnegative quadratic unbiased estimator with of to be the UMVNNQUE are obtained as well.     

Cubicity, boxicity, and vertex cover

A k-dimensional box is the cartesian product R₁×R₂×?×R_k where each R_i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G is the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the cartesian product R₁×R₂×?×R_k where each R_i is a closed interval on the real line of the form [a_i,a_i+1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. In this paper we show that cub(G)≤t+⌈log(n−t)⌉−1 and , where t is the cardinality of a minimum vertex cover of G and n is the number of vertices of G. We also show the tightness of these upper bounds.F.S. Roberts in his pioneering paper on boxicity and cubicity had shown that for a graph G, and , where n is the number of vertices of G, and these bounds are tight. We show that if G is a bipartite graph then and this bound is tight. We also show that if G is a bipartite graph then . We point out that there exist graphs of very high boxicity but with very low chromatic number. For example there exist bipartite (i.e., 2 colorable) graphs with boxicity equal to . Interestingly, if boxicity is very close to , then chromatic number also has to be very high. In particular, we show that if , s≥0, then , where χ(G) is the chromatic number of G.