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.     

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.     

A characterization of convex calibrable sets in with respect to anisotropic norms

A set is called “calibrable” if its characteristic function is an eigenvector of the subgradient of the total variation. The main purpose of this paper is to characterize the “-calibrability” of bounded convex sets in with respect to a norm (called anisotropy in the sequel) by the anisotropic mean -curvature of its boundary. It extends to the anisotropic and crystalline cases the known analogous results in the Euclidean case. As a by-product of our analysis we prove that any convex body C satisfying a -ball condition contains a convex -calibrable set K such that, for any V[|K|,|C|], the subset of C of volume V which minimizes the -perimeter is unique and convex. We also describe the anisotropic total variation flow with initial data the characteristic function of a bounded convex set.     

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.     

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).     

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.     

Uniform Kazhdan constant for some families of linear groups

Let R be a ring generated by l elements with stable range r. Assume that the group EL_d(R) has Kazhdan constant ₀>0 for some dr+1. We prove that there exist (₀,l)>0 and , s.t. for every nd, EL_n(R) has a generating set of order k and a Kazhdan constant larger than . As a consequence, we obtain for where n3, a Kazhdan constant which is independent of n w.r.t. generating set of a fixed size.     

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.     

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.     

Interlacing and spacing properties of zeros of polynomials, in particular of orthogonal and -minimal polynomials,

Let be a sequence of polynomials with real coefficients such that uniformly for [α-δ,β+δ] with G(eⁱ)≠0 on [α,β], where 0α<βπ and δ>0. First it is shown that the zeros of are dense in [α,β], have spacing of precise order π/n and are interlacing with the zeros of p_n+1(cos) on [α,β] for every nn₀. Let be another sequence of real polynomials with uniformly on [α-δ,β+δ] and on [α,β]. It is demonstrated that for all sufficiently large n the zeros of p_n(cos) and strictly interlace on [α,β] if on [α,β]. If the last expression is zero then a weaker kind of interlacing holds. These interlacing properties of the zeros are new for orthogonal polynomials also. For instance, for large n a simple criteria for interlacing of zeros of Jacobi polynomials on [-1+,1-], >0, is obtained. Finally it is shown that the results hold for wide classes of weighted L_q-minimal polynomials, q[1,∞], linear combinations and products of orthogonal polynomials, etc.     

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.     

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).     

Classification Theorems for General Orthogonal Polynomials on the Unit Circle

The set of all probability measures σ on the unit circle splits into three disjoint subsets depending on properties of the derived set of {|_n|²dσ}_n0, denoted by Lim(σ). Here {_n}_n0 are orthogonal polynomials in L²(dσ). The first subset is the set of Rakhmanov measures, i.e., of σ with {m}=Lim(σ), m being the normalized (m( )=1) Lebesgue measure on . The second subset Mar( ) consists of Markoff measures, i.e., of σ with mLim(σ), and is in fact the subject of study for the present paper. A measure σ, belongs to Mar( ) iff there are >0 and l>0 such that sup{|a_n+j|:0jl}>, n=0,1,2,…,{a_n} is the Geronimus parameters (=reflectioncoefficients) of σ. We use this equivalence to describe the asymptotic behavior of the zeros of the corresponding orthogonal polynomials (see Theorem G). The third subset consists of σ with {m}Lim(σ). We show that σ is ratio asymptotic iff either σ is a Rakhmanov measure or σ satisfies the López condition (which implies σMar( )). Measures σ satisfying Lim(σ)={ν} (i.e., weakly asymptotic measures) are also classified. Either ν is the sum of equal point masses placed at the roots of zⁿ=λ, λ , n=1,2,…, or ν is the equilibrium measure (with respect to the logarithmic kernel) for the inverse image under an m-preserving endomorphism z→zⁿ, n=1,2,…, of a closed arc J (including J= ) with removed open concentric arc J₀ (including J₀=). Next, weakly asymptotic measures are completely described in terms of their Geronimus parameters. Finally, we obtain explicit formulae for the parameters of the equilibrium measures ν and show that these measures satisfy {ν}=Lim(ν).     

Optimal Sobolev Imbeddings Involving Rearrangement-Invariant Quasinorms

Let m and n be positive integers with n2 and 1mn−1. We study rearrangement-invariant quasinorms _R and _D on functions f: (0, 1)→ such that to each bounded domain Ω in ⁿ, with Lebesgue measure |Ω|, there corresponds C=C(|Ω|)>0 for which one has the Sobolev imbedding inequality _R(u*(|Ω| t))C_D(|^mu|* (|Ω| t)), uC^m₀(Ω), involving the nonincreasing rearrangements of u and a certain mth order gradient of u. When m=1 we deal, in fact, with a closely related imbedding inequality of Talenti, in which _D need not be rearrangement-invariant, _R(u*(|Ω| t))C_D((d/dt) ∫_{{x ⁿ : |u(x)|>u*(|Ω| t)}} |(u)(x)| dx), uC¹₀(Ω). In both cases we are especially interested in when the quasinorms are optimal, in the sense that _R cannot be replaced by an essentially larger quasinorm and _D cannot be replaced by an essentially smaller one. Our results yield best possible refinements of such (limiting) Sobolev inequalities as those of Trudinger, Strichartz, Hansson, Brézis, and Wainger.     

Weak Copositive and Intertwining Approximation

It is known that shape preserving approximation has lower rates than unconstrained approximation. This is especially true for copositive and intertwining approximations. ForfL_p, 1p<∞, the former only has rateω(f, n⁻¹)_p, and the latter cannot even be bounded byC f_p. In this paper, we discuss various ways to relax the restrictions in these approximations and conclude that the most sensible way is the so-calledalmostcopositive/intertwining approximation in which one relaxes the restriction on the approximants in a neighborhood of radiusΔ_n(y_j) of each sign changey_j.     

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.     

Maximal Inequalities and Lebesgue's Differentiation Theorem for Best Approximant by Constant over Balls

For fL_p( ⁿ), with 1p<∞, >0 and x ⁿ we denote by T(f)(x) the set of every best constant approximant to f in the ball B(x, ). In this paper we extend the operators T_p to the space L_p−1( ⁿ)+L_∞( ⁿ), where L₀ is the set of every measurable functions finite almost everywhere. Moreover we consider the maximal operators associated to the operators T_p and we prove maximal inequalities for them. As a consequence of these inequalities we obtain a generalization of Lebesgue's Differentiation Theorem.     

On Mean Convergence of Lagrange Interpolation for General Arrays

For n1, let {x_jn}ⁿ_j=1 be n distinct points in a compact set K and letL_n[·] denote the corresponding Lagrange interpolation operator. Let v be a suitably restricted function on K. What conditions on the array {x_jn}_1jn, n1 ensure the existence of p>0 such that lim_n→∞ (f−L_n[f]) v_Lp(K)=0 for very continuous f: K→ ? We show that it is necessary and sufficient that there exists r>0 with sup_n1 π_nv_Lr(K) ∑ⁿ_j=1 (1/|π′_n| (x_jn))<∞. Here for n1, π_n is a polynomial of degree n having {x_jn}ⁿ_j=1 as zeros. The necessity of this condition is due to Ying Guang Shi.