Permutation polynomials of the form

Recently, several classes of permutation polynomials of the form (x²+x+δ)^s+x over have been discovered. They are related to Kloosterman sums. In this paper, the permutation behavior of polynomials of the form (x^p−x+δ)^s+L(x) over is investigated, where L(x) is a linearized polynomial with coefficients in . Six classes of permutation polynomials on are derived. Three classes of permutation polynomials over are also presented.     

Topological complexity is a fibrewise L–S category

Topological complexity of a space B is introduced by M. Farber to measure how much complex the space is, which is first considered on a configuration space of a motion planning of a robot arm. We also consider a stronger version of topological complexity with an additional condition: in a robot motion planning, a motion must be stasis if the initial and the terminal states are the same. Our main goal is to show the equalities and , where d(B)=B×B is a fibrewise pointed space over B whose projection and section are given by the canonical projection to the second factor and the diagonal. In addition, our method in studying fibrewise L–S category is able to treat a fibrewise space with singular fibres.     

Poincaré's theorem for the modular group of real Riemann surfaces

Let Mod_g denote the modular group of (closed and orientable) surfaces S of genus g. Each element [h]Mod_g induces a symplectic automorphism H([h]) of . Poincaré showed that is an epimorphism. A real Riemann surface is a Riemann surface S together with an anticonformal involution σ. Let (S,σ) be a real Riemann surface, be the group of orientation preserving homeomorphisms of S such that h○σ=σ○h and be the subgroup of consisting of those isotopic to the identity by an isotopy in . The group plays the role of the modular group in the theory of real Riemann surfaces. In this work we describe the image by H of . Such image depends on the topological type of the involution σ.     

Probabilistic n-normed spaces, -n-compact sets and -n-bounded sets

In this paper, first we define and study the probabilistic n-normed spaces and -n-compactness, also we prove some theorems and inequalities. In the next section we define -n-boundedness and prove some results in relation between -n-compact and -n-bounded sets in these spaces.     

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

Gottlieb groups of spheres

This paper takes up the systematic study of the Gottlieb groups of spheres for k≤13 by means of the classical homotopy theory methods. We fully determine the groups for k≤13 except for the 2-primary components in the cases: k=9,n=53;k=11,n=115. In particular, we show if n=2ⁱ−7 for i≥4.     

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 .     

The maximum edit distance from hereditary graph properties

For a graph property , the edit distance of a graph G from , denoted , is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying . What is the largest possible edit distance of a graph on n vertices from ? Denote this distance by .A graph property is hereditary if it is closed under removal of vertices. In a previous work, the authors show that for any hereditary property, a random graph essentially achieves the maximal distance from , proving: with high probability. The proof implicitly asserts the existence of such , but it does not supply a general tool for determining its value or the edit distance.In this paper, we determine the values of and for some subfamilies of hereditary properties including sparse hereditary properties, complement invariant properties, (r,s)-colorability and more. We provide methods for analyzing the maximum edit distance from the graph properties of being induced H-free for some graphs H, and use it to show that in some natural cases G(n,1/2) is not the furthest graph. Throughout the paper, the various tools let us deduce the asymptotic maximum edit distance from some well studied hereditary graph properties, such as being Perfect, Chordal, Interval, Permutation, Claw-Free, Cograph and more. We also determine the edit distance of G(n,1/2) from any hereditary property, and investigate the behavior of as a function of p.The proofs combine several tools in Extremal Graph Theory, including strengthened versions of the Szemerédi Regularity Lemma, Ramsey Theory and properties of random graphs.     

Levels of multi-continued fraction expansion of multi-formal Laurent series

The multi-continued fraction expansion of a multi-formal Laurent series is a sequence pair consisting of an index sequence and a multi-polynomial sequence . We denote the set of the different indices appearing infinitely many times in by H_∞, the set of the different indices appearing in by H₊, and call |H_∞| and |H₊| the first and second levels of , respectively. In this paper, it is shown how the dimension and basis of the linear space over F(z) (F) spanned by the components of are determined by H_∞ (H₊), and how the components are linearly dependent on the mentioned basis.     

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 .     

On hypersurfaces with two distinct principal curvatures in a unit sphere

We investigate the immersed hypersurfaces in a unit sphere . By using Otsuki's idea, we obtain the local and global classification results for immersed hypersurfaces in of constant m-th mean curvature and two distinct principal curvatures of multiplicities n−1,1 (in the local version, we assume that the principal curvatures are non-zero when m2). As the result, we prove that any local hypersurface in of constant mean curvature and two distinct principal curvatures is an open part of a complete hypersurface of the same curvature properties. The corresponding result does not hold for m-th mean curvature when m2.     

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.     

Common hermitian and positive solutions to the adjointable operator equations ,

Let be a C^*-algebra. For any Hilbert -modules H and K, let be the set of adjointable operators from H to K. Let H,K,L be Hilbert -modules, and . In this paper, we propose necessary and sufficient conditions for the existence of common hermitian and positive solutions to the equations , and obtain the formulae for the general forms of these solutions. Some results, known for finite matrices and Hilbert space operators, are extended to the adjointable operators acting on Hilbert C^*-modules.     

A spectral equivalence for Jacobi matrices

We use the classical results of Baxter and Golinskii–Ibragimov to prove a new spectral equivalence for Jacobi matrices on . In particular, we consider the class of Jacobi matrices with conditionally summable parameter sequences and find necessary and sufficient conditions on the spectral measure such that and lie in or for s1.     

Norms of some operators on the Bergman and the Hardy space in the unit polydisk and the unit ball

Let H(X) be the class of all holomorphic functions on the set and uH(X). We calculate operator norms of the multiplication operators M_u(f)=uf, on the weighted Bergman space , as well as on the Hardy space H^p(X), where X is the unit polydisk or the unit ball in . We also calculate the norm of the weighted composition operator from the weighted Bergman space , and the Hardy space , to a weighted-type space on the unit polydisk.     

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.     

Weak and point-wise convergence in for filter convergence

We study those filters on for which weak -convergence of bounded sequences in C(K) is equivalent to point-wise -convergence. We show that it is sufficient to require this property only for C[0,1] and that the filter-analogue of the Rainwater extremal test theorem arises from it. There are ultrafilters which do not have this property and under the continuum hypothesis there are ultrafilters which have it. This implies that the validity of the Lebesgue dominated convergence theorem for -convergence is more restrictive than the property which we study.     

On Jordan ideals and matrix rings

For A, a commutative ring, and results by Costa and Keller characterize certain -normalized subgroups of the symplectic group, via structures utilizing Jordan ideals and the notion of radices. The following work creates a Jordan ideal structure theorem for -graded rings, A₀A₁, and a -graded matrix algebra. The major theorem is a generalization of Costa and Keller’s previous work on matrix algebras over commutative rings.     

Construction of highly stable parallel two-step Runge–Kutta methods for delay differential equations

It is shown that any A-stable two-step Runge–Kutta method of order and stage order for ordinary differential equations can be extended to the P-stable method of uniform order for delay differential equations.