A (2 + )-Approximation Scheme for Minimum Domination on Circle Graphs

The main result of this paper is a (2 + )-approximation scheme for the minimum dominating set problem on circle graphs. We first present an O(n²) time 8-approximation algorithm for this problem and then extend it to an time (2 + )-approximation scheme for this problem. Here n and m are the number of vertices and the number of edges of the circle graph. We then present simple modifications to this algorithm that yield (3 + )-approximation schemes for the minimum connected and the minimum total dominating set problems on circle graphs. Keil (1993, Discrete Appl. Math.42, 51–63) shows that these problems are NP-complete for circle graphs and leaves open the problem of devising approximation algorithms for them. These are the first O(1)-approximation algorithms for domination problems on circle graphs.     

Existence and multiplicity results for some nonlinear problems with singular -Laplacian

Using Leray–Schauder degree theory we obtain various existence and multiplicity results for nonlinear boundary value problems

where l(u,u^′)=0 denotes the Dirichlet, periodic or Neumann boundary conditions on [0,T], is an increasing homeomorphism, (0)=0. The Dirichlet problem is always solvable. For Neumann or periodic boundary conditions, we obtain in particular existence conditions for nonlinearities which satisfy some sign conditions, upper and lower solutions theorems, Ambrosetti–Prodi type results. We prove Lazer–Solimini type results for singular nonlinearities and periodic boundary conditions.     

Periodic solutions of second order nonlinear difference equations with discrete -Laplacian

We use Brouwer degree to prove existence and multiplicity results for the periodic solutions of some nonlinear second order difference equations involving discrete -Laplacian. We obtain in particular upper and lower solutions theorems, Ambrosetti–Prodi type multiplicity results, sharp existence conditions for nonlinearities which are bounded from below or from above and necessary and sufficient conditions for the existence of positive periodic solutions when the nonlinearity is singular at 0.     

A (2+)-approximation algorithm for the generalized preemptive open shop problem with minsum objective

In this paper we consider a generalized version of the classical preemptive open shop problem with sum of weighted job completion times objective. The main result is a (2+)-approximation algorithm for this problem. In the last section we also discuss the possibility of improving our algorithm.     

k-Best Solutions under Distance Constraints in Valuated -Matroids

In discrete maximization problems one usually wants to find an optimal solution. However, in several topics like “alignments,” “automatic speech recognition,” and “computer chess” people are interested to find thekbest solutions for somek ≥ 2. We demand that theksolutions obey certain distance constraints to avoid that thekalternatives are too similar. Several results for valuated -matroids are presented, some of them concerning time complexity of algorithms.     

Finite element analysis of an A– method for time-dependent Maxwell’s equations based on explicit-magnetic-field scheme

In this paper, error analysis of a finite element A– method for the time-dependent Maxwell’s equations is presented. An explicit-magnetic-field scheme is applied. Provided that the time-stepsize τ is sufficiently small, the proposed algorithm yields for finite time T an error of in the L²-norm for the electric field E and the magnetic field H, where h is the mesh size.     

Disjoint spine phenomena in certain contractible n-manifolds (n5)

If M is a compact PL manifold with boundary containing a subpolyhedron K in its interior, then K is said to be a PL spine of M provided M collapses to K (MK). Guilbault [Topology 34 (1) (1995) 99–108] has shown that certain nontrivial contractible manifolds possess disjoint spines. His results stem from a standing conjecture regarding disjoint spines in contractible 4-manifolds constructed by Mazur. More to the point, there is a dimensional requirement introduced by his techniques; Guilbault produces such manifolds in dimensions n9. We shall provide techniques which allow the construction of examples in dimensions n5 following the path laid out by Guilbault. The new techniques will provide a slight strengthening of some other Guilbault results as well.     

乘积的平方性

本文证明了乘积 (f(x)=ax²+bx+c∈Z[x]是二次不可约多项式)在n充分大时不是平方数.       

Weak stability of the Ishikawa iteration procedures for -hemicontractions and accretive operators

Let X be an arbitrary Banach space, K be a nonempty closed convex subset of X, and T : K → K be a Lipschitzian and hemicontractive mapping with the property lim inf_t→∞((t)/t) > 0. It is shown that the Ishikawa iteration procedures are weakly T-stable. As consequences, several related results deal with the weak stability of these procedures for the iteration proximation of solutions of nonlinear equations involving accretive operators. Our results improve and extend those corresponding results announced by Osilike.     

ON THE SHARP GROWTH, COVERING THEOREMS FOR NORMALIZED BIHOLOMORPHIC MAPPINGS IN C^n

In this article.a normalized biholomorphic mapping f defined on bounded starlike circular domain in C″is considered,where z=0 is a zero of order k 1 of f(z)(?) The sharp growth.covering theorems for almost starlike mappings of order a and starlile mappings of order wave established.Meanwhile,the construction of the above mappings on bounded starlike circular domain in C~n is also discussed,it provides the extremal mappings for the growth,covering theorems of the above mappings.     

中约化子空间上的仿射与伪仿射对偶小波标架

本文讨论中约化子空间上的仿射(伪仿射)对偶小波标架.我们建立了仿射系与伪仿射系之间的一个标架 和对偶标架保持定理,并且在没有任何衰减性假设的条件下获得了仿射(伪仿射)对偶小波标架在傅立叶域上的一个刻画.进一步, 我们也给出了仿射Parseval标架在傅立叶域上的刻画.       

Some families of -cyclic codes

We introduce and solve several problems on -cyclic codes.We study the link between -linear cyclic codes and -cyclic codes (not necessarily linear) obtained by using two binary linear cyclic codes. We use these results to present a family of -self-dual linear cyclic codes.     

An -module structure of the cokernel of the second Johnson homomorphism

The Johnson homomorphisms τ_k (k1) give Abelian quotients of a series of certain subgroups of the mapping class group of a surface. Morita determined the rational image of the second Johnson homomorphism τ₂. In this paper, we study the structure of the torsion part of the cokernel of τ₂. First, we determine the rank of the cokernel over . Although we do it first by computing explicitly, later we improve the proof, using the Birman–Craggs homomorphism, obtained by the classical Rohlin invariant of homology 3-spheres. Since τ₂ is equivariant with respect to the action of the mapping class group, Im τ₂ is -invariant and hence acts on the cokernel. Moreover, computing this action explicitly, we show that the action reduces to that of the finite symplectic group .     

Isomorphism classes of elliptic and hyperelliptic curves over finite fields

We give the number and representatives of isomorphism classes of hyperelliptic curves of genus g defined over finite fields , g=1,2,3. These results have applications to hyperelliptic curve cryptography.     

关于“T21／2LF拓扑空间和ST21／2LF拓扑空间的分离性”的一点注记

通过一个例子说明在[3]中定理2．2的证明中用到的一个结论是错误的，并给出该定理的一种正确证明。