Preliminary test estimators and phi-divergence measures in generalized linear models with binary data

We consider the problem of estimation of the parameters in Generalized Linear Models (GLM) with binary data when it is suspected that the parameter vector obeys some exact linear restrictions which are linearly independent with some degree of uncertainty. Based on minimum -divergence estimation (ME), we consider some estimators for the parameters of the GLM: Unrestricted ME, restricted ME, Preliminary ME, Shrinkage ME, Shrinkage preliminary ME, James–Stein ME, Positive-part of Stein-Rule ME and Modified preliminary ME. Asymptotic bias as well as risk with a quadratic loss function are studied under contiguous alternative hypotheses. Some discussion about dominance among the estimators studied is presented. Finally, a simulation study is carried out.     

Turán type reverse Markov inequalities for compact convex sets

For a compact convex set the well-known general Markov inequality holds asserting that a polynomial p of degree n must have p^′c(K)n²p. On the other hand for polynomials in general, p^′ can be arbitrarily small as compared to p.The situation changes when we assume that the polynomials in question have all their zeroes in the convex set K. This was first investigated by Turán, who showed the lower bounds p^′(n/2)p for the unit disk D and for the unit interval I[-1,1]. Although partial results provided general lower estimates of order , as well as certain classes of domains with lower bounds of order n, it was not clear what order of magnitude the general convex domains may admit here.Here we show that for all bounded and convex domains K with nonempty interior and polynomials p with all their zeroes lying in K p^′c(K)np holds true, while p^′C(K)np occurs for any K. Actually, we determine c(K) and C(K) within a factor of absolute numerical constant.     

Extracting the resolution algorithm from a completeness proof for the propositional calculus

We prove constructively that for any propositional formula in Conjunctive Normal Form, we can either find a satisfying assignment of true and false to its variables, or a refutation of showing that it is unsatisfiable. This refutation is a resolution proof of ¬. From the formalization of our proof in Coq, we extract Robinson’s famous resolution algorithm as a Haskell program correct by construction. The account is an example of the genre of highly readable formalized mathematics.     

Conditions for a class of dimensional dual hyperovals to be of polar type

A d-dimensional dual hyperoval with monomial is of polar type if and only if d is even, Gal(GF(2^d+1)/GF(2)) and σ²=id_GF(2^d+1).     

Inner Functions and Cyclic Composition Operators on H(Bn)

The present paper shows that the algebra generated by {C|  Aut(B_n)} is cyclic on H²(B_n), and any nonconstant function f  H²(B_n) is a cyclic vector of . In addition, the hypercyclic and cyclic composition operators will be discussed.     

Relative rearrangement and Lebesgue spaces with variable exponent

We apply the techniques of monotone and relative rearrangements to the nonrearrangement invariant spaces L^p()(Ω) with variable exponent. In particular, we show that the maps uL^p()(Ω)→k(t)u_*L^p_*()(0,measΩ) and uL^p()(Ω)→u_*L^p*()(0,measΩ) are locally -Hölderian (u_* (resp. p^*) is the decreasing (resp. increasing) rearrangement of u (resp. p)). The pointwise relations for the relative rearrangement are applied to derive the Sobolev embedding with eventually discontinuous exponents.     

On the similarity of dual operators

Let k be a field with an involution σ and a non-degenerate sesquilinear form, where V,W are n-dimensional k-spaces. Assume that ΛEnd(V) and Λ^*End(W) are dual operators. We show that if Λ and Λ^* are similar, then Λ^*=Λ^-1, where :V→W is Hermitian.     

Homology of Newtonian Coalgebras

Given a Newtonian coalgebra we associate to it a chain complex. The homology groups of this Newtonian chain complex are computed for two important Newtonian coalgebras arising in the study of flag vectors of polytopes:R a, b and Rc, d. The homology of Ra, b corresponds to the homology of the boundary of then -crosspolytope. In contrast, the homology of Rc, d depends on the characteristic of the underlying ring R. In the case the ring has characteristic 2, the homology is computed via cubical complexes arising from distributive lattices. This paper ends with a characterization of the integer homology ofZ c, d.     

Orthonormal sampling functions

We investigate functions (x) whose translates {(x−k)}, where k runs through the integer lattice , provide a system of orthonormal sampling functions. The cardinal sine, whose important role in the sampling theory of bandlimited functions is well documented, is the classic example. For the bandlimited case we provide a complete characterization of such functions and give examples with rapid decay including a construction which is symmetric. We also analyze the general case of arbitrary sampling rate, a>0, which leads to some unexpected observations.     

Attractors of the reaction-diffusion systems with rapidly oscillating coefficients and their homogenization

The following reaction-diffusion system in spatially non-homogeneous almost-periodic media is considered in a bounded domain : (1)∂_tu=Au−f(u)+g, u|_∂Ω=0. Here u=(u¹,…,u^k) is an unknown vector-valued function, f is a given nonlinear interaction function and the second order elliptic operator A has the following structure: where a_ij^l(y) are given almost-periodic functions. We prove that, under natural assumptions on the nonlinear term f(u), the longtime behavior of solutions of (1) can be described in terms of the global attractor of the associated dynamical system and that the attractors  , 0<<₀1, converge to the attractor of the homogenized problem (1) as →0. Moreover, in the particular case of periodic media, we give explicit estimates for the distance between the non-homogenized and the homogenized attractors in terms of the parameter .     

LOCAL TIME ANALYSIS OF ADDITIVE LEVY PROCESSES WITH DIFFERENT L(E)VY EXPONENTS

Let X1 XN be independent, classical Levy processes on R^d with Levy exponents ψ1,…, ψN, respectively. The corresponding additive Levy process is defined as the following N-parameter random field on R^d, X（t） △= X1（t1） ＋ ... ＋ XN（tN）, At∈N. Under mild regularity conditions on the ψi＇s, we derive estimate for the local and uniform moduli of continuity of local times of X = {X（t）; t ∈R^N}.     

Le lemme de Schur pour les représentations orthogonales

Let σ be an orthogonal representation of a group G on a real Hilbert space. We show that σ is irreducible if and only if its commutant σ(G)' is isomorphic to , or . This result is an analogue of the classical Schur lemma for unitary representations. In both cases (orthogonal and unitary), a representation is irreducible if and only if its commutant is a field. If σ is irreducible, we show that there exists a unitary irreducible representation π of G such that the complexification σ is unitarily equivalent to π if σ(G)' , to π π̄ if σ(G)' , and to π π if σ(G)' (here π̄ denotes the contragredient representation of π). These results are classical for a finite-dimensional σ, but seem to be new in the general case.     

Approximate range searching using binary space partitions

We show how any BSP tree for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size for the segments themselves, such that the range-searching efficiency remains almost the same. We apply this technique to obtain a BSP tree of size O(nlogn) such that -approximate range searching queries with any constant-complexity convex query range can be answered in O(min_>0{(1/)+k}logn) time, where k is the number of segments intersecting the -extended range. The same result can be obtained for disjoint constant-complexity curves, if we allow the BSP to use splitting curves along the given curves.We also describe how to construct a linear-size BSP tree for low-density scenes consisting of n objects in such that -approximate range searching with any constant-complexity convex query range can be done in O(logn+min_>0{(1/^d−1)+k}) time.     

Strong and uniform mean stability of cosine and sine operator functions

It is first observed that a uniformly bounded cosine operator function C() and the associated sine function S() are totally non-stable. Then, using a zero-one law for the Abel limit of a closed linear operator, we prove some results concerning strong mean stability and uniform mean stability of C(). Among them are: (1) C() is strongly (C,1)-mean stable (or (C,2)-mean stable, or Abel-mean stable) if and only if 0ρ(A)σ_c(A); (2) C() is uniformly (C,2)-mean stable if and only if S() is uniformly (C,1)-mean stable, if and only if , if and only if , if and only if C() is uniformly Abel-mean stable, if and only if S() is uniformly Abel-mean stable, if and only if 0ρ(A).     

Existence of HSOLSSOMs of type

In this paper we investigate the existence of holey self-orthogonal Latin squares with a symmetric orthogonal mate of type 2ⁿu¹ (HSOLSSOM(2ⁿu¹)). For u2, necessary conditions for existence of such an HSOLSSOM are that u must be even and n3u/2+1. Xu Yunqing and Hu Yuwang have shown that these HSOLSSOMs exist whenever either (1) n9 and n3u/2+1 or (2) n263 and n2(u-2). In this paper we show that in (1) the condition n9 can be extended to n30 and that in (2), the condition n263 can be improved to n4, except possibly for 19 pairs (n,u), the largest of which is (53,28).     

A polynomial time approximation scheme for the two-source minimum routing cost spanning trees

Let G be an undirected graph with nonnegative edge lengths. Given two vertices as sources and all vertices as destinations, we investigated the problem how to construct a spanning tree of G such that the sum of distances from sources to destinations is minimum. In the paper, we show the NP-hardness of the problem and present a polynomial time approximation scheme. For any >0, the approximation scheme finds a (1+)-approximation solution in O(n^1/+1) time. We also generalize the approximation algorithm to the weighted case for distances that form a metric space.     

Theorems about the attractor for incompressible non-Newtonian flow driven by external forces that are rapidly oscillating in time but have a smooth average

This paper discusses the incompressible non-Newtonian fluid with rapidly oscillating external forces g(x,t)=g(x,t,t/) possessing the average g⁰(x,t) as →0⁺, where 0<₀<1. Firstly, with assumptions (A₁)–(A₅) on the functions g(x,t,ξ) and g⁰(x,t), we prove that the Hausdorff distance between the uniform attractors and in space H, corresponding to the oscillating equations and the averaged equation, respectively, is less than O() as →0⁺. Then we establish that the Hausdorff distance between the uniform attractors and in space V is also less than O() as →0⁺. Finally, we show for each [0,₀].     

A vanishing theorem on Kaehler Finsler manifolds

Let M be a connected compact complex manifold endowed with a strongly pseudoconvex complex Finsler metric F. In this paper, we first define the complex horizontal Laplacian □_h and complex vertical Laplacian □_v on the holomorphic tangent bundle T^1,0M of M, and then we obtain a precise relationship among □_h,□_v and the Hodge–Laplace operator on (T^1,0M,,), where , is the induced Hermitian metric on T^1,0M by F. As an application, we prove a vanishing theorem of holomorphic p-forms on M under the condition that F is a Kaehler Finsler metric on M.