Approximation of Sobolev classes by polynomials and ridge functions

Let be the usual Sobolev class of functions on the unit ball in , and be the subclass of all radial functions in . We show that for the classes and , the orders of best approximation by polynomials in coincide. We also obtain exact orders of best approximation in of the classes by ridge functions and, as an immediate consequence, we obtain the same orders in for the usual Sobolev classes .     

Additive maps preserving the ascent and descent of operators

Let and be the algebras of all bounded linear operators on infinite dimensional complex Banach spaces X and Y, respectively. We characterize additive maps from onto preserving different quantities such as the nullity, the defect, the ascent, and the descent of operators.     

On Feferman’s operational set theory

We study and some of its most important extensions primarily from a proof-theoretic perspective, determine their consistency strengths by exhibiting equivalent systems in the realm of traditional set theory and introduce a new and interesting extension of which is conservative over .     

Positive solutions of singular p-Laplacian dynamic equations with sign changing nonlinearity

Let be a time scale such that . By the Schauder fixed-point theorem and the upper and lower solution method, we present some existence criteria of the positive solution of m-point singular p-Laplacian dynamic equation with boundary conditions , where φ_p(s)=|s|^p-2s with p>1, is continuous for i=1,2,…,m-1 and nonincreasing if . The nonlinear term may be singular in its dependent variable and is allowed to change sign. Our results are new even for the corresponding differential and difference equations . As an application, an example is given to illustrate our result.     

Limits of small functors

For a small category enriched over a suitable monoidal category , the free completion of under colimits is the presheaf category . If is large, its free completion under colimits is the -category of small presheaves on , where a presheaf is small if it is a left Kan extension of some presheaf with small domain. We study the existence of limits and of monoidal closed structures on .     

Sparse p-version BEM for first kind boundary integral equations with random loading

We consider the weakly singular boundary integral equation on a deterministic smooth closed curve with random loading g(ω). Given the kth order statistical moment of g, the aim is the efficient deterministic computation of the kth order statistical moment of u. We derive a deterministic formulation for the kth statistical moment. It is posed in the tensor product Sobolev space and involves the k-fold tensor product operator . The standard full tensor product Galerkin BEM requires unknowns for the kth moment problem, where N is the number of unknowns needed to discretize Γ. Extending ideas of [V.N. Temlyakov, Approximation of functions with bounded mixed derivative, Proc. Steklov Inst. Math. (1989) vi+121. A translation of Trudy Mat. Inst. Steklov 178 (1986)], we develop the p-Sparse Grid Galerkin BEM to reduce the number of unknowns from to .     

Lattices generated by orbits of subspaces under finite singular pseudo-symplectic groups I

Let be the (2ν+1+l)-dimensional vector space over the finite field . In the paper we assume that is a finite field of characteristic 2, and the singular pseudo-symplectic groups of degree 2ν+1+l over . Let be any orbit of subspaces under . Denote by the set of subspaces which are intersections of subspaces in and the intersection of the empty set of subspaces of is assumed to be . By ordering by ordinary or reverse inclusion, two lattices are obtained. This paper studies the inclusion relations between different lattices, a characterization of subspaces contained in a given lattice , and the characteristic polynomial of .     

Formal extension and quotients of the invariant holonomic system

Let be a semisimple Lie algebra and a Cartan subalgebra of . Fix . Let be the invariant holonomic system (see [R. Hotta, M. Kashiwara, The invariant holonomic system on a semisimple Lie algebra, Invent. Math. 75 (1984) 327–358]). First we investigate its formal extension . In the sequel we calculate the characteristic variety of some simple quotients of and its Fourier transform .     

Polynomial-time approximation schemes for piercing and covering with applications in wireless networks

Let be a set of disks of arbitrary radii in the plane, and let be a set of points. We study the following three problems: (i) Assuming contains the set of center points of disks in , find a minimum-cardinality subset of (if exists), such that each disk in is pierced by at least h points of , where h is a given constant. We call this problem minimum h-piercing. (ii) Assuming is such that for each there exists a point in whose distance from D's center is at most αr(D), where r(D) is D's radius and 0α<1 is a given constant, find a minimum-cardinality subset of , such that each disk in is pierced by at least one point of . We call this problem minimum discrete piercing with cores. (iii) Assuming is the set of center points of disks in , and that each covers at most l points of , where l is a constant, find a minimum-cardinality subset of , such that each point of is covered by at least one disk of . We call this problem minimum center covering. For each of these problems we present a constant-factor approximation algorithm (trivial for problem (iii)), followed by a polynomial-time approximation scheme. The polynomial-time approximation schemes are based on an adapted and extended version of Chan's [T.M. Chan, Polynomial-time approximation schemes for packing and piercing fat objects, J. Algorithms 46 (2003) 178–189] separator theorem. Our PTAS for problem (ii) enables one, in practical cases, to obtain a (1+ε)-approximation for minimum discrete piercing (i.e., for arbitrary ).     

Inheritance of hyper-duality in imprimitive Bose–Mesner algebras

We prove the following result concerning the inheritance of hyper-duality by block and quotient Bose–Mesner algebras associated with a hyper-dual pair of imprimitive Bose–Mesner algebras. Let and denote Bose–Mesner algebras. Suppose there is a hyper-duality ψ from the subconstituent algebra of with respect to p to the subconstituent algebra of with respect to . Also suppose that is imprimitive with respect to a subset of Hadamard idempotents, so is dual imprimitive with respect to the subset of primitive idempotents, where is the formal duality associated with ψ. Let denote the block Bose–Mesner algebra of on the block containing p, and let denote the quotient Bose–Mesner algebra of with respect to . Then there is a hyper-duality from the subconstituent algebra of with respect to p to the subconstituent algebra of with respect to .     

-structure on the deformation complex of a morphism

-structure is shown to exist on the deformation complex of a morphism of associative algebras. The main step of the construction is the extension of a -algebra by an associative algebra. Actions of -algebras on associative and -algebras are analyzed; extensions of -algebras by associative and -algebras that they act upon are constructed. The resulting -algebra on the deformation complex of a morphism is shown to be quasi-isomorphic to the -algebra on the deformation complex of the corresponding diagram algebra.     

Semifields of order with left nucleus and center

In [G. Marino, O. Polverino, R. Trombetti, On -linear sets of PG(3,q³) and semifields, J. Combin. Theory Ser. A 114 (5) (2007) 769–788] it has been proven that there exist six non-isotopic families (i=0,…,5) of semifields of order q⁶ with left nucleus and center , according to the different geometric configurations of the associated -linear sets. In this paper we first prove that any semifield of order q⁶ with left nucleus , right and middle nuclei and center is isotopic to a cyclic semifield. Then, we focus on the family by proving that it can be partitioned into three further non-isotopic families: , , and we show that any semifield of order q⁶ with left nucleus , right and middle nuclei and center belongs to the family .     

Generalized rough approximations in

In this paper we will treat a generalization of inner and outer approximations of fuzzy sets, which we will call -inner and -outer approximations respectively ( being any finite set of rational numbers in [0,1]). In particular we will discuss the case of those fuzzy sets which are definable in the logic by means of step functions from the hypercube [0,1]^k and taking value in an arbitrary (finite) subset of . Then, we will show that if a fuzzy set is definable as truth table of a formula of , then both its -inner and -outer approximation are definable as truth table of formulas of . Finally, we will introduce a generalization of abstract approximation spaces and compare our approach with the notion of fuzzy rough set.     

On the sizes of Delaunay meshes

Let be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of with bounded vertex degree is within a factor of the size of any Delaunay mesh of with bounded radius-edge ratio. The term depends on the geometry of and it is likely a small constant when the boundaries of are fine triangular meshes. There are several consequences. First, among all Delaunay meshes with bounded radius-edge ratio, those returned by Delaunay refinement algorithms have asymptotically optimal sizes. This is another advantage of meshing with Delaunay refinement algorithms. Second, if no input angle is acute, the minimum Delaunay mesh with bounded radius-edge ratio is not much smaller than any minimum mesh with aspect ratio bounded by a particular constant.     

A foundation for real recursive function theory

The class of recursive functions over the reals, denoted by , was introduced by Cristopher Moore in his seminal paper written in 1995. Since then many subsequent investigations brought new results: the class was put in relation with the class of functions generated by the General Purpose Analogue Computer of Claude Shannon; classical digital computation was embedded in several ways into the new model of computation; restrictions of were proved to represent different classes of recursive functions, e.g., recursive, primitive recursive and elementary functions, and structures such as the Ritchie and the Grzergorczyk hierarchies.The class of real recursive functions was then stratified in a natural way, and and the analytic hierarchy were recently recognised as two faces of the same mathematical concept.In this new article, we bring a strong foundational support to the Real Recursive Function Theory, rooted in Mathematical Analysis, in a way that the reader can easily recognise both its intrinsic mathematical beauty and its extreme simplicity. The new paradigm is now robust and smooth enough to be taught. To achieve such a result some concepts had to change and some new results were added.     

The jump operator on the -enumeration degrees

The jump operator on the ω-enumeration degrees was introduced in [I.N. Soskov, The ω-enumeration degrees, J. Logic Computat. 17 (2007) 1193–1214]. In the present paper we prove a jump inversion theorem which allows us to show that the enumeration degrees are first order definable in the structure of the ω-enumeration degrees augmented by the jump operator. Further on we show that the groups of the automorphisms of and of the enumeration degrees are isomorphic.In the second part of the paper we study the jumps of the ω-enumeration degrees below . We define the ideal of the almost zero degrees and obtain a natural characterization of the class H of the ω-enumeration degrees below which are high n for some n and of the class L of the ω-enumeration degrees below which are low n for some n.     

Integral-type operators from iterated logarithmic Bloch spaces to Zygmund-type spaces

Let denote the space of all holomorphic functions on the unit ball of and the radial derivative of h. In this paper we study the boundedness and compactness of the following integral operator:, from iterated logarithmic Bloch spaces to Zygmund-type spaces.     

Inverse eigenproblem for -symmetric matrices and their approximation

Let be a nontrivial involution, i.e., R=R⁻¹≠±I_n. We say that is R-symmetric if RGR=G. The set of all -symmetric matrices is denoted by . In this paper, we first give the solvability condition for the following inverse eigenproblem (IEP): given a set of vectors in and a set of complex numbers , find a matrix such that and are, respectively, the eigenvalues and eigenvectors of A. We then consider the following approximation problem: Given an n×n matrix , find such that , where is the solution set of IEP and is the Frobenius norm. We provide an explicit formula for the best approximation solution by means of the canonical correlation decomposition.