For a Pareto maximization problem defined in infinite dimensions in terms of cones, relationships among several types of maximal elements are noted and optimality conditions are developed in terms of tangent cones.

In this paper, the notion of maximal m-open set is introduced and itsproperties are investigated. Some results about existence of maximal m-open setsare given. Moreover, the relations between maximal m-open sets in an m-spaceand maximal open sets in the corresponding generated topology are considered.Our results are supported by examples and counterexamples.

A norm inequality is proved for elements of a star algebra so that the algebra is noncommutative. In particular, a relation between maximal and minimal extensions of regular norm on a C∗-algebra is established.

We study a conjectural formula for the maximal elements in wavefront set associated with theta representation of covering group over p-adic fields. In particular, it is shown that agrees existing work literature various families groups. also recapitulate results an analogous archimedean case, which motivated setting.

Abstract Let denote the maximal number of different primes that may occur in order a finite solvable group G , all elements which have orders divisible by at most n distinct primes. We show for . As an application, we improve on recent bound Hung and Yang arbitrary groups.

‎Let $G$ be a finite group‎. ‎By $MT(G)=(m_1,cdots,m_k)$ we denote the type of‎ ‎conjugacy classes of maximal subgroups of $G$‎, ‎which implies that $G$ has exactly $k$ conjugacy classes of‎ ‎maximal subgroups and $m_1,ldots,m_k$ are the numbers of conjugates‎ ‎of maximal subgroups of $G$‎, ‎where $m_1leqcdotsleq m_k$‎. ‎In this paper‎, ‎we‎ ‎give some new characterizations of finite groups by ...

In this paper o-algebraic complete partial orders are considered the compact elements of which are not maximal in the partial order. Under the assumption that these elements are indexed such that their equality is decidable and the order is semi-decidable (completely enumerable) it is shown that the computable domain elements can be effectively enumerated without repetition. Computable one-to-o...