Quasi-P*-Maps,P(τ, α, β)-Maps,Exceptional Family of Elements,and Complementarity Problems

Quasi-P_*-maps and P(, , )-maps defined in this paper are two large classes of nonlinear mappings which are broad enough to include P_*-maps as special cases. It is of interest that the class of quasi-P_*-maps also encompasses quasimonotone maps (in particular, pseudomonotone maps) as special cases. Under a strict feasibility condition, it is shown that the nonlinear complementarity problem has a solution if the function is a nonlinear quasi-P_*-map or P(, , )-map. This result generalizes a classical Karamardian existence theorem and a recent result concerning quasimonotone maps established by Hadjisawas and Schaible, but restricted to complementarity problems. A new existence result under an exceptional regularity condition is also established. Our method is based on the concept of exceptional family of elements for a continuous function, which is a powerful tool for investigating the solvability of complementarity problems.     

The normal famility of mermorphic functions

Let F be a family of mermorphic functions in a domain D, and let a, b, c be complex numbers, a ≠ b. If for each f ∈ F, the zeros of f-c are of multiplicity ≥ k ＋ 1, and -↑Ef（k）（a） belong to -↑Ef （a）, -↑Ef（k）（b）belong to -↑Ef （b）, then F is normal in D.     

Procreating tiles of double commutative-step digraphs

Double commutative-step digraph generalizes the double-loop digraph. A double commutative-step digraph can be represented by an L-shaped tile, which periodically tessellates the plane. Given an initial tile L（l, h, x, y）, Aguil5 et al. define a discrete iteration L（p） = L（l ＋ 2p, h ＋ 2p, x ＋ p, y ＋ p）, p = 0, 1, 2,..., over L-shapes （equivalently over double commutative-step digraphs）, and obtain an orbit generated by L（l, h, x,y）, which is said to be a procreating k-tight tile if L（p）（p = 0, 1, 2, ~ ~ ~ ） are all k-tight tiles. They classify the set of L-shaped tiles by its behavior under the above-mentioned discrete dynamics and obtain some procreating tiles of double commutative-step digraphs. In this work, with an approach proposed by Li and Xu et al., we define some new discrete iteration over L-shapes and classify the set of tiles by the procreating condition. We also propose some approaches to find infinite families of realizable k-tight tiles starting from any realizable k-tight L-shaped tile L（l, h, x, y）, 0 ≤ y - x ≤ 2k ＋ 2. As an example, we present an infinite family of 3-tight optimal double-loop networks to illustrate our approaches.     

Graph family operations

In previous papers, Catlin introduced four functions, denoted , , , and , between sets of finite graphs. These functions proved to be very useful in establishing properties of several classes of graphs, including supereulerian graphs and graphs with nowhere zero k-flows for a fixed integer k3. Unfortunately, a subtle error caused several theorems previously published in Catlin (Discrete Math. 160 (1996) 67–80) to be incorrect. In this paper we correct those errors and further explore the relations between these functions, showing that there is a sort of duality between them and that they act as inverses of one another on certain sets of graphs.     

On the scarcity of contravariant left adjunctions

It is shown that any pair of contravariant mutually left adjoint functors between varieties of algebrasC andD factors through the retractions of these categories onto the complete lattices of epimorphs of their respective initial objects, and is thus fairly degenerate. However, some interesting contravariant left adjoint functors do exist between categories of finitely generated (or otherwise restricted) algebras.This work was done while the author was partly supported by NSF contract DMS 85-02330.Presented by F. E. J. Linton.     

Formal and analytic linearizability of families of conformal map germs (ℂ, 0) → (ℂ, 0)

We consider a nondegenerate one-parameter family of germs of conformal maps of (?, 0) into (?, 0). We prove that such a family is analytically linearizable whenever it is formally linearizable. In this case, the linearizing coordinate change analytically depends on the parameter.     

On Some Classical Methods to Improve Algebraic Curves and Surfaces

First, a modern presentation of the theory of the Halphen transform is given. This method associates to a plane projective curve C, once a general conic has been chosen, another birationally equivalent plane curve, whose singularities are simpler than those of C. Repeating, a curve is obtained whose only singularities are nodes. Next, it is studied how to apply this process to a family of plane curves. With this technique it is possible to transform a given family (with irreducible general member) into one where, generically, the curves are nodal. Finally, it is studied a similar process, called the Halphen–Picard transformation, for surfaces in three-space. By suitably reiterating this procedure, a surface can be transformed into a birationally equivalent one (in the same projective space), such that the sections with planes in a general pencil are, generically, nodal curves.     

On a Variational Definition for the Jensen-Shannon Symmetrization of Distances Based on the Information Radius

We generalize the Jensen-Shannon divergence and the Jensen-Shannon diversity index by considering a variational definition with respect to a generic mean, thereby extending the notion of Sibson’s information radius. The variational definition applies to any arbitrary distance and yields a new way to define a Jensen-Shannon symmetrization of distances. When the variational optimization is further constrained to belong to prescribed families of probability measures, we get relative Jensen-Shannon divergences and their equivalent Jensen-Shannon symmetrizations of distances that generalize the concept of information projections. Finally, we touch upon applications of these variational Jensen-Shannon divergences and diversity indices to clustering and quantization tasks of probability measures, including statistical mixtures.     

Constructions of optimal difference systems of sets

Difference systems of sets (DSSs) are combinatorial configurations which were introduced in 1971 by Levenstein for the construction of codes for synchronization. In this paper, we present two kinds of constructions of difference systems of sets by using disjoint difference families and a special type of difference sets, respectively. As a consequence, new infinite classes of optimal DSSs are obtained.     

Realizing tri-bimaximal mixing in minimal seesaw model with S4 family symmetry

In this Letter, we realize the tri-bimaximal mixing in the lepton sector in the context of minimal seesaw in which only two right-handed neutrinos are introduced, with the discrete group S4 as the family symmetry. In order to constrain the form of superpotential, a Z3 symmetry is also introduced. In the model, the mass matrices for charged leptons and right-handed neutrinos are diagonal. The unitary matrix that diagonalizes the light Majorana neutrino mass matrix is exact tri-bimaximal at LO, and is corrected by small quantities of O(0.01) at NLO. The mechanism to get the particular scalar VEV alignments used is also presented. Phenomenologically, the mass spectrum is of normal hierarchy with m₁=0, and ∑mi and |mee| are about 0.058 eV and 0.003 eV respectively.