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.     

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.     

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.     

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.     

The maximum asymptotic bias of S-estimates for regression over the neighborhoods defined by certain special capacities

The maximum asymptotic bias of an S-estimate for regression in the linear model is evaluated over the neighborhoods (called (c,γ)-neighborhoods) defined by certain special capacities, and its lower and upper bounds are derived. As special cases, the (c,γ)-neighborhoods include those in terms of -contamination, total variation distance and Rieder's (,δ)-contamination. It is shown that when the model distribution is normal and the (,δ)-contamination neighborhood is adopted, the lower and upper bounds of an S-estimate (including the LMS-estimate) based on a jump function coincide with the maximum asymptotic bias. The tables of the maximum asymptotic bias of the LMS-estimate are given. These results are an extension of the corresponding ones due to Martin et al. (Ann. Statist. 17 (1989) 1608), who used -contamination neighborhoods.     

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.     

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.     

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.     

Two canonical passive state/signal shift realizations of passive discrete time behaviors

A discrete time invariant linear state/signal system Σ with a Hilbert state space and a Kren signal space has trajectories (x(),w()) that are solutions of the equation , where F is a bounded linear operator from into with a closed domain whose projection onto is all of . This system is passive if the graph of F is a maximal nonnegative subspace of the Kren space . The future behavior of a passive system Σ is the set of all signal components w() of trajectories (x(),w()) of Σ on with x(0)=0 and . This is always a maximal nonnegative shift-invariant subspace of the Kren space , i.e., the space endowed with the indefinite inner product inherited from . Subspaces of with this property are called passive future behaviors. In this work we study passive state/signal systems and passive behaviors (future, full, and past). In particular, we define and study the input and output maps of a passive state/signal system, and the past/future map of a passive behavior. We then turn to the inverse problem, and construct two passive state/signal realizations of a given passive future behavior , one of which is observable and backward conservative, and the other controllable and forward conservative. Both of these are canonical in the sense that they are uniquely determined by the given data , in contrast earlier realizations that depend not only on , but also on some arbitrarily chosen fundamental decomposition of the signal space . From our canonical realizations we are able to recover the two standard de Branges–Rovnyak input/state/output shift realizations of a given operator-valued Schur function in the unit disk.     

Geometric realizations of curvature models by manifolds with constant scalar curvature

We show any pseudo-Riemannian curvature model can be geometrically realized by a manifold with constant scalar curvature. We also show that any pseudo-Hermitian curvature model, para-Hermitian curvature model, hyper-pseudo-Hermitian curvature model, or hyper-para-Hermitian curvature model can be realized by a manifold with constant scalar and -scalar curvature.     

On the distributions of the form ∑i (δpi−δni)

We present some properties of the distributions T of the form ∑_i (δ_pi−δ_ni), with ∑_i d(p_i,n_i)<∞, which arise in the study of the 3-d Ginzburg–Landau problem; see Bourgain et al. (C. R. Acad. Sci. Paris, Ser. I 331 (2000) 119–124). We show that there always exists an irreducible representation of T. We also extend a result of Smets (C. R. Acad. Sci. Paris, Ser. I 334 (2002) 371–374) which says that T is a measure iff T can be written as a finite sum of dipoles.     

-stability of discrete hybrid systems via variational Lyapunov method

The aim of this paper is to give some results on ₀-stability for discrete hybrid systems via a variational cone-valued Lyapunov method.     

Continuity in G

For a discrete group G, we consider βG, the Stone– ech compactification of G, as a right topological semigroup, and G^*=βGG as a subsemigroup of βG. We study the mappings λ_p^* :G^*→G^*and μ^* :G^*→G^*, the restrictions to G^* of the mappings λ_p :βG→βG and μ :βG→βG, defined by the rules λ_p(q)=pq, μ(q)=qq. Under some assumptions, we prove that the continuity of λ_p^* or μ^* at some point of G^* implies the existence of a P-point in ω^*.     

σ-core and -core of bounded sequences

In this paper we characterize matrices that map every bounded sequence into one whose σ-core is a subset of the -core of the original sequence.