We give further results for Perron-Frobenius theory on the numericalrange of real matrices and some other results generalized from nonnegative matricesto real matrices. We indicate two techniques for establishing the main theorem ofPerron and Frobenius on the numerical range. In the rst method, we use acorresponding version of Wielandt's lemma. The second technique involves graphtheory.

This study concerns the existence and multiplicity of positive weak solutions for a class of semilinear elliptic systems with nonlinear boundary conditions. Our results is depending on the local minimization method on the Nehari manifold and some variational techniques. Also, by using Mountain Pass Lemma, we establish the existence of at least one solution with positive energy.

We consider the extended trust region subproblem (eTRS) as the minimization of an indefinite quadratic function subject to the intersection of unit ball with a single linear inequality constraint. Using a variation of the S-Lemma, we derive the necessary and sufficient optimality conditions for eTRS. Then, an OCP/SDP formulation is introduced for the problem. Finally, several illustrative examp...

We describes a framework in which to view the end-to-endindependently-verifiable (E2E) voting systems based on mixnets. We use the framework to invent new systems that combine front and back-ends from existing systems.

The aim of this note is to generalize the Nakayama lemma to a class of multiplication modules over commutative rings with identity. In this note, by considering the notion of multiplication modules and the product of submodules of them, we state and prove two versions of Nakayama lemma for such modules. In the first version we give some equivalent conditions for faithful finitely generated mult...

We present a constructive proof of Ky Fan’s combinatorial lemma concerning labellings of triangulated spheres. Our construction works for triangulations of Sn that contain a flag of hemispheres. As a consequence, we produce a constructive proof of Tucker’s lemma that holds for a larger class of triangulations than previous constructive proofs.

The approximation lemma is a simplification of the well-known take lemma, and is used to prove properties of programs that produce lists of values. We show how the approximation lemma, unlike the take lemma, can naturally be generalised from lists to a large class of datatypes, and present a generic approximation lemma that is parametric in the datatype to which it applies. As a useful by-produ...

– in this paper we consider some (α ,β ) -metrics such as generalized kropina, matsumoto and f (α β )2α = + metrics, and obtain necessary and sufficient conditions for them to be einstein metrics when βis a constant killing form. then we prove with this assumption that the mentioned einstein metrics must beriemannian or ricci flat.

In this short paper, we apply estimates and ideas from [CM4] to study the ends of a properly embedded complete minimal surface 2 ⊂ R3 with finite topology. The main result is that any complete properly embedded minimal annulus that lies above a sufficiently narrow downward sloping cone must have finite total curvature. In this short paper, we apply estimates and ideas from [CM4] to study the en...

objective gastroenteritis has a diverse etiology; many pathogens can cause this condition. of the extraintestinal manifestations, one is convulsions, which may be  attributable to fever, type of bacteria, or electrolyte imbalance. to assess the risk of occurrence of convulsions, in this study we investigated the association between the paraclinical and clinical findings of children with gastroe...