Weakly Pseudocompact Frames

We define the notion of weak pseudocompactness for frames and present several characterizations. Among them are characterizations in terms of strong inclusions, uniformities and cozero bases. Noteworthy is the fact that these internal characterizations are not translated from characterizations of weakly pseudocompact spaces.      

Characterizations of the solution set for non-essentially quasiconvex programming

Characterizations of the solution set in terms of subdifferentials play an important role in research of mathematical programming. Previous characterizations are based on necessary and sufficient optimality conditions and invariance properties of subdifferentials. Recently, characterizations of the solution set for essentially quasiconvex programming in terms of Greenberg–Pierskalla subdifferential are studied by the authors. Unfortunately, there are some examples such that these characterizations do not hold for non-essentially quasiconvex programming. As far as we know, characterizations of the solution set for non-essentially quasiconvex programming have not been studied yet. In this paper, we study characterizations of the solution set in terms of subdifferentials for non-essentially quasiconvex programming. For this purpose, we use Martínez–Legaz subdifferential which is introduced by Martínez–Legaz as a special case of c-subdifferential by Moreau. We derive necessary and sufficient optimality conditions for quasiconvex programming by means of Martínez–Legaz subdifferential, and, as a consequence, investigate characterizations of the solution set in terms of Martínez–Legaz subdifferential. In addition, we compare our results with previous ones. We show an invariance property of Greenberg–Pierskalla subdifferential as a consequence of an invariance property of Martínez–Legaz subdifferential. We give characterizations of the solution set for essentially quasiconvex programming in terms of Martínez–Legaz subdifferential.     

Some characterizations of φ-Lagrangian dual problems

We give some characterizations of the Lagrangian dual objective function λ_φdefined with respect to a coupling function φ, namely, conditions for the existence of a φ, and characterizations when q> is given. In particular, when φ is the so-called “natural coupling function”, one of these characterizations reduces to the main result of [6].     

Characterizations of totally balanced matrices

A (0,1)-matrix is totally balanced if it does not contain as a submatrix the incidence matrix of any cycle of length at least 3. Several alternative characterizations of these matrices are presented. These characterizations follow from properties of strongly chordal graphs, studied by Farber, and maximal totally balanced matrices, studied by Anstee. Using these characterizations, efficient recognition algorithms for totally balanced matrices are presented. In addition, a new completion algorithm for building a maximal totally balanced matrix from an arbitrary totally balanced matrix follows from these results.     

Characterizations of the polynomial numerical hull of degree k

Six characterizations of the polynomial numerical hull of degree k are established for bounded linear operators on a Hilbert space. It is shown how these characterizations provide a natural distinction between interior and boundary points. One of the characterizations is used to prove that the polynomial numerical hull of any fixed degree k for a Toeplitz matrix whose symbol is piecewise continuous approaches all or most of that of the infinite-dimensional Toeplitz operator, as the matrix size goes to infinity.     

On the semi-perfect elimination

We give algorithmic characterizations of two classes of graphs, for which every ordering produced by the Lexicographic Breadth-First Search and the Maximum Cardinality Search, respectively, satisfies a prescribed property. These characterizations allow us to design linear-time optimization algorithms for these classes of graphs.     

Characterizations of EP matrices and weighted-EP matrices

A square complex matrix A is said to be EP if A and its conjugate transpose A^∗ have the same range. In this paper, we first collect a group of known characterizations of EP matrix, and give some new characterizations of EP matrices. Then, we define weighted-EP matrix, and present a wealth of characterizations for weighted-EP matrix through various rank formulas for matrices and their generalized inverses.     

The oversemigroups of a numerical semigroup

We study the set of numerical semigroups containing a given numerical semigroup. As an application we prove characterizations of irreducible numerical semigroups that unify some of the existing characterizations for symmetric and pseudo-symmetric numerical semigroups. Finally we describe an algorithm for computing a minimal decomposition of a numerical semigroup in terms of irreducible numerical semigroups.     

On 2-Microlocal Herz Type Besov and Triebel-Lizorkin Spaces with Variable Exponents

In this paper, 2-microlocal Herz type Besov and Triebel-Lizorkin spaces with variable exponents are introduced for the first time. Then, we give characterizations of these spaces by so-called Peetre's maximal functions. Further, the atomic and molecular decompositions of these spaces are obtained. Finally, using the characterizations of the spaces by local means and molecular decomposition we obtain the wavelet characterizations.     

Finding all efficient extreme points for multiple objective linear programs

In this paper we develop a method for finding all efficient extreme points for multiple objective linear programs. Simple characterizations of the efficiency of an edge incident to a nondegenerate or a degenerate efficient vertex are given. These characterizations form the basis of an algorithm for enumerating all efficient vertices. The algorithm appears to have definite computational advantages over other methods. Some illustrative examples are included.     

Γ-amenability of locally compact groups

Let G be a locally compact group and let F be a closed subgroup of G × G. Pier introduced the notion of F-amenability which gives a new classification of groups. This concept generalizes the concept of amenability and inner amenability for locally compact groups. In this paper, among other things, we extend some standard results for amenable groups to F-amenable groups and give various characterizations for F-amenable groups. A sequence of characterizations of F-amenable groups is given here by developing the well-known Flner＇s conditions for amenable locally compact groups. Several characterizations of inner amenability are also given.     

四元数矩阵的极分解及其GL偏序

本文给出了四元数矩阵的唯一极分解定理和两个四元数矩阵可同时极分解的两种刻画；进而引进了四元数矩阵的GL偏序的概念，它是重要的Lǒwner偏序的一般化，并得到这个新偏序的6种刻画．     

The Oversemigroups of a Numerical Semigroup

Abstract. We study the set of numerical semigroups containing a given numerical semigroup. As an application we prove characterizations of irreducible numerical semigroups that unify some of the existing characterizations for symmetric and pseudo-symmetric numerical semigroups. Finally we describe an algorithm for computing a minimal decomposition of a numerical semigroup in terms of irreducible numerical semigroups.     

Exponential distributions on semigroups

Three fundamental characterizations of the standard exponential distribution on [0, ) are the remaining life, memoryless and constant failure properties. Analogs of these properties are studied for distributions on a class of semigroups in which the semigroup operation replaces addition, a compatible partial order replaces the ordinary order, and a left-invariant measure replaces Lebesgue measure. Partial characterizations of exponential distributions on such semigroups are obtained and the semigroup formulation provides new characterizations of certain aging properties studied in reliability-increasing failure rate, new better than used, and increasing failure rate average.     

Factorizations of EP operators

In this paper we characterize EP operators through the existence of different types of factorizations. Our results extend to EP operators existing characterizations for EP matrices and give new characterizations both for EP matrices and EP operators.     

Pointfree pseudocompactness revisited

We give several internal and external characterizations of pseudocompactness in frames which extend (and transcend) analogous characterizations in topological spaces. In the case of internal characterizations we do not make reference (explicitly or implicitly) to the reals.     

Set containment characterization with strict and weak quasiconvex inequalities

Dual characterizations of the containment of a convex set, defined by infinite quasiconvex constraints, in an evenly convex set, and in a reverse convex set, defined by infinite quasiconvex constraints, are provided. Notions of quasiconjugate for quasiconvex functions, λ-quasiconjugate and λ-semiconjugate, play important roles to derive the characterizations of the set containments.     

On the notion of Cohen–Macaulayness for non-Noetherian rings

There exist many characterizations of Noetherian Cohen–Macaulay rings in the literature. These characterizations do not remain equivalent if we drop the Noetherian assumption. The aim of this paper is to provide some comparisons between some of these characterizations in non-Noetherian case. Toward solving a conjecture posed by Glaz, we give a generalization of the Hochster–Eagon result on Cohen–Macaulayness of invariant rings, in the context of non-Noetherian rings.     

Set containment characterization for quasiconvex programming

Dual characterizations of containment of a convex set, defined by quasiconvex constraints, in a convex set, and in a reverse convex set, defined by a quasiconvex constraint, are provided. Notions of quasiconjugate for quasiconvex functions, H-quasiconjugate and R-quasiconjugate, play important roles to derive characterizations of the set containments.     

Nonsingularity Conditions for Multifunctions

We discuss three different characterizations of continuity properties for general multifunctions S : R^d Rⁿ. Each of these characterizations is given by the same simple nonsingularity condition, but stated in terms of three different generalized derivatives. Two of these characterizations are known, but the third is new to this paper. We discuss how all three have immediate analogues as generalized inverse mapping theorems, and we apply our new characterization to develop a fundamental and very broad sensitivity theorem for solutions to parameterized optimization problems.