Isolated singularities of some semilinear elliptic equations

Let Ω be an open subset of $\text{R}{}^{\mathrm{<mi\; mathvariant="italic"\; is="true">N</mi>}}$, N ? 3, containing 0. We consider the solutions of ?Δu(x) + g(u(x)) = f(x) in Ω-{0}, where g is nondecreasing and f is bounded and we study the possible singularities at 0: when u(x) = o(|x|^{1 ? N}) we prove that u is isotropic near 0 and show that either it is a C¹ function in Ω (removable singularity) or |x|^{N ? 2}u(x) → c, c ≠ 0 (weak singularity) or |x|^{N ? 2} |u(x) |→ + ∞ (strong singularity). We also characterize the g's for which solutions with a weak singularity exist and improve a previous removability result of H. Brézis and L. Véron (Arch. Rational Mech. Anal.23 (1979), 153–166).     

Recursions associated to trapezoid,symmetric and rotation symmetric functions over Galois fields

Rotation symmetric Boolean functions are invariant under circular translation of indices. These functions have very rich cryptographic properties and have been used in different cryptosystems. Recently, Thomas Cusick proved that exponential sums of rotation symmetric Boolean functions satisfy homogeneous linear recurrences with integer coefficients. In this work, a generalization of this result is proved over any Galois field. That is, exponential sums over Galois fields of some rotation symmetric polynomials satisfy linear recurrences with integer coefficients. In the particular case of ${\mathbb{F}}_2$, an elementary method is used to obtain explicit recurrences for exponential sums of some of these functions. The concept of trapezoid Boolean function is also introduced and it is showed that the linear recurrences that exponential sums of trapezoid Boolean functions satisfy are the same as the ones satisfied by exponential sums of the corresponding rotations symmetric Boolean functions. Finally, it is proved that exponential sums of trapezoid and symmetric polynomials also satisfy linear recurrences with integer coefficients over any Galois field ${\mathbb{F}}_q$. Moreover, the Discrete Fourier Transform matrix and some Complex Hadamard matrices appear as examples in some of our explicit formulas of these recurrences.     

Rings of quotients of f-rings by gabriel filters of ideals

The article examines the role of Gabriel filters of ideals in the ontext of semiprime f-rings. It is shown that for every 2-convex semiprime f-ring Aand every multiplicative filter B of dense ideals the ring of quotients of A by B, namely the direct limit of the Hom _A (I, A) over all I∈ B, is an l-subring of QA, the maximum ring of quotients. Relative to the category of all commutative rings with identity, it is shown that for every 2-convex semiprime f-ring A qA, the classical ring of quotients, is the largest flat epimorphic extension of A. If Ais also a Prüfer ring then it follows that every extension of Ain qA is of the form S ^-1A for a suitable multiplicative subset S. The paper also examines when a Utumi ring of quotients of a semiprime f-ring is obtained from a Gabriel filter. For a ring of continuous functions C(X), with Xcompact, this is so for each C(U) and C ^*(U), when Uis dense open, but not for an arbitrary direct limit of C(U),taken over a filter base of dense open sets. In conclusion, it is shown that, for a complemented semiprime f-ring A, the ideals of Awhich are torsion radicals with respect to some hereditary torsion theory are precisely the intersections of minimal prime ideals of A.     

On commutative rings which are strongly prüfer

Abstract

As defined by Nicholson [Nicholson, W. K. (1977). Lifting idempotents and exchange rings. Trans. Amer. Math. Soc. 229:269–278] an element of a ring R is clean if it is the sum of a unit and an idempotent, and a subset A of R is clean if every element of A is clean. It is shown that a semiprimitive Gelfand ring R is clean if and only if Max(R) is zero-dimensional; if and only if for each M ∈ Max(R), the intersection all prime ideals contained in M is generated by a set of idempotents. We also give several equivalent conditions for clean functional rings. In fact, a functional ring R is clean if and only if the set of clean elements is closed under sum; if and only if every zero-divisor is clean; if and only if; R has a clean prime ideal.     

Resonance Free Domains for Non Globally Analytic Potentials

We study the resonances of the semiclassical Schr?dinger operator near a non-trapping energy level in the case when the potential V is not necessarily analytic on all of but only outside some compact set. Then we prove that for some and for any C > 0, P admits no resonance in the domain if V is , and if V is Gevrey with index s. Here does not depend on h and the results are uniform with respect to h > 0 small enough. Submitted 05/02/02, accepted 06/05/02 An erratum to this article is available at .     

Robustness of nonuniform exponential dichotomies in Banach spaces

We give conditions for the robustness of nonuniform exponential dichotomies in Banach spaces, in the sense that the existence of an exponential dichotomy for a given linear equation x^′=A(t)x persists under a sufficiently small linear perturbation. We also establish the continuous dependence with the perturbation of the constants in the notion of dichotomy and of the “angles” between the stable and unstable subspaces. Our proofs exhibit (implicitly) the exponential dichotomies of the perturbed equations in terms of fixed points of appropriate contractions. We emphasize that we do not need the notion of admissibility (of bounded nonlinear perturbations). We also obtain related robustness results in the case of nonuniform exponential contractions. In addition, we establish an appropriate version of robustness for nonautonomous dynamical systems with discrete time.     

The consistency index in reciprocal matrices: Comparison of deterministic and statistical approaches

When checking the inconsistency level of a positive reciprocal matrix Saaty uses a deterministic criterion based on two parameters, a benchmark (the average), and a consistency level, usually 10%. Using results from a simulation experiment with 100,000 positive random reciprocal matrices of size varying from 3 to 15, we developed a probabilistic criterion and compare it to Saaty’s index. We found that if a positive reciprocal matrix is consistent according to the deterministic criterion is also consistent according to the probabilistic criterion only if we accept a higher than usual probability of Type I error. Reducing this error implies that the benchmark must be a small percentile of the probability distribution of the consistency index.     

On second maximal subgroups of Sylow subgroups of finite groups

Finite groups in which the second maximal subgroups of the Sylow p-subgroups, p a fixed prime, cover or avoid the chief factors of some of its chief series are completely classified.     

MB-GNG: Addressing drawbacks in multi-objective optimization estimation of distribution algorithms

We examine the model-building issue related to multi-objective estimation of distribution algorithms (MOEDAs) and show that some of their, as yet overlooked, characteristics render most current MOEDAs unviable when addressing optimization problems with many objectives. We propose a novel model-building growing neural gas (MB-GNG) network that is specially devised for properly dealing with that issue and therefore yields a better performance. Experiments are conducted in order to show from an empirical point of view the advantages of the new algorithm.