Column sufficient tensors and tensor complementarity problems

Stimulated by the study of sufficient matrices in linear complementarity problems, we study column sufficient tensors and tensor complementarity problems. Column sufficient tensors constitute a wide range of tensors that include positive semi-definite tensors as special cases. The inheritance property and invariant property of column sufficient tensors are presented. Then, various spectral properties of symmetric column sufficient tensors are given. It is proved that all H-eigenvalues of an even-order symmetric column sufficient tensor are nonnegative, and all its Z-eigenvalues are nonnegative even in the odd order case. After that, a new subclass of column sufficient tensors and the handicap of tensors are defined. We prove that a tensor belongs to the subclass if and only if its handicap is a finite number. Moreover, several optimization models that are equivalent with the handicap of tensors are presented. Finally, as an application of column sufficient tensors, several results on tensor complementarity problems are established.     

关于条件极值充分条件的重新推导和证明

李文学用拉格朗日函数提出求条件极值的充分条件,但他的证明却是错误的.本文不用拉格朗日函数,而是直接通过消去一个变量将条件极值转化成无条件极值,重新推导出充分性条件.推导的过程也是条件极值充分条件的证明过程.     

Slant and pseudo-slant submanifolds in LCS-manifolds

We show new results on when a pseudo-slant submanifold is a LCS-manifold. Necessary and sufficient conditions for a submanifold to be pseudo-slant are given. We obtain necessary and sufficient conditions for the integrability of distributions which are involved in the definition of the pseudo-slant submanifold. We characterize the pseudoslant product and give necessary and sufficient conditions for a pseudo-slant submanifold to be the pseudo-slant product. Also we give an example of a slant submanifold in an LCS-manifold to illustrate the subject.     

Partitions,sufficiency and undominated families of probability measures

Summary This article is concerned with a class of statistical structures which has been introduced by Basu and Ghosh and where the underlying family of probability measures is not dominated. Using the concept of partition-inducible subfields it is shown that the intersection of arbitrarily many subfields is sufficient again. This gives rise to the notion of the coarsest sufficient subfield containing a given family of sets. This generated subfield may be calculated as a function of the minimal sufficient subfield which always exists in these structures. Finally some attention is given to invariance and sufficiency.     

Finite-Dimensional Algebras and Standard Systems

We introduce the notion of a standard system in order to deal with quasi-hereditary algebras. We shall prove that a necessary and sufficient condition for a finite-dimensional algebra to be quasi-hereditary is the existence of a full and divisible standard system. As a further application, we obtain a sufficient condition for a standardly stratified algebra.     

Fair and efficient student placement with couples

We study situations of allocating positions to students based on priorities. An example is the assignment of medical students to hospital residencies on the basis of entrance exams. For markets without couples, e.g., for undergraduate student placement, acyclicity is a necessary and sufficient condition for the existence of a fair and efficient placement mechanism (Ergin in Econometrica 70:2489–2497, 2002). We show that in the presence of couples acyclicity is still necessary, but not sufficient. A second necessary condition is priority-togetherness of couples. A priority structure that satisfies both necessary conditions is called pt-acyclic. For student placement problems where all quotas are equal to one we characterize pt-acyclicity and show that it is a sufficient condition for the existence of a fair and efficient placement mechanism. If in addition to pt-acyclicity we require reallocation- and vacancy-fairness for couples, the so-called dictator- bidictator placement mechanism is the unique fair and efficient placement mechanism. Finally, for general student placement problems, we show that pt-acyclicity may not be sufficient for the existence of a fair and efficient placement mechanism. We identify a sufficient condition such that the so-called sequential placement mechanism produces a fair and efficient allocation.      

Diophantine equations and class numbers

The goals of this paper are to provide: (1) sufficient conditions, based on the solvability of certain diophantine equations, for the non-triviality of the class numbers of certain real quadratic fields; (2) sufficient conditions for the divisibility of the class numbers of certain imaginary quadratic fields by a given integer; and (3) necessary and sufficient conditions for an algebraic integer (which is not a unit) to be the norm of an algebraic integer in a given extension of number fields.     

Permanence of two species and fixed point index

We present sufficient and necessary conditions for the permanence of discrete systems in the plane based on an index of fixed points on convex sets. In concrete models, a simple picture is sufficient to deduce whether our system is permanent or not.     

Necessary and Sufficient Conditions for Mcshane’s Identity and Variations

Greg McShane introduced a remarkable identity for lengths of simple closed geodesics on the once punctured torus with a complete, finite volume hyperbolic structure. Bowditch later generalized this and gave sufficient conditions for the identity to hold for general type-preserving representations of a free group on two generators Γ to SL(2,C), this was further generalized by the authors to obtain sufficient conditions for a generalized McShane’s identity to hold for arbitrary (not necessarily type-preserving) non-reducible representations in Tan et al. (Submitted). Here we extend the above by giving necessary and sufficient conditions for the generalized McShane identity to hold (Akiyoshi, Miyachi and Sakuma had proved it for type-preserving representations). We also give a version of Bowditch’s variation of McShane’s identity to once-punctured torus bundles, in the case where the monodromy is generated by a reducible element, and provide necessary and sufficient conditions for the variations to hold.     

Optimal myopic policies and index policies for stochastic scheduling problems

Stochastic scheduling problems are considered by using discounted dynamic programming. Both, maximizing pure rewards and minimizing linear holding costs are treated in one common Markov decision problem. A sufficient condition for the optimality of the myopic policy for finite and infinite horizon is given. For the infinite horizon case we show the optimality of an index policy and give a sufficient condition for the index policy to be myopic. Moreover, the relation between the two sufficient conditions is discussed.     

关于全不变扩张环和模(英文)

In this paper, we discuss FI-extending property of rings and modules. The main results are the following： a characterization of von Neumann regular rings which are two-sided FI-extending is given; sufficient conditions for direct summands of FI-extending modules to be FI-extending are obtained; and at last, a necessary and sufficient condition for nonsingular modules over nonsingular rings to be FI-extending is given.     

Subdivision Schemes and Irregular Grids

The present paper deals with subdivision schemes associated with irregular grids. We first give a sufficient condition concerning the difference scheme to obtain convergence. This condition generalizes a necessary and sufficient condition for convergence known in the case of uniform and stationary schemes associated with a regular grid. Through this sufficient condition, convergence of a given subdivision scheme can be proved by comparison with another scheme. Indeed, when two schemes are equivalent in some sense, and when one satisfies the sufficient condition for convergence, the other also satisfies it and it therefore converges too. We also study the smoothness of the limit functions produced by a scheme which satisfies the sufficient condition. Finally, the results are applied to the study of Lagrange interpolating subdivision schemes of any degree, with respect to particular irregular grids.     

A sufficient condition and a necessary condition for the diffusion approximations of multiclass queueing networks under priority service disciplines

We establish a sufficient condition for the existence of the (conventional) diffusion approximation for multiclass queueing networks under priority service disciplines. The sufficient condition relates to a sufficient condition for the weak stability of the fluid networks that correspond to the queueing networks under consideration. In addition, we establish a necessary condition for the network to have a continuous diffusion limit; the necessary condition is to require a reflection matrix (of dimension equal to the number of stations) to be completely-S. When applied to some examples, including generalized Jackson networks, single station multiclass queues, first-buffer-first-served re-entrant lines, a two-station Dai–Wang network and a three-station Dumas network, the sufficient condition coincides with the necessary condition.     

A Study on Abnormality in Variational and Optimal Control Problems

In this paper, a variational problem is considered with differential equality constraints over a variable interval. It is stressed that the abnormality is a local character of the admissible set; consequently, a definition of regularity related to the constraints characterizing the admissible set is given. Then, for the local minimum necessary conditions, a compact form equivalent to the well-known Euler equation and transversality condition is given. By exploiting this result and the previous definition of regularity, it is proved that nonregularity is a necessary and sufficient condition for an admissible solution to be an abnormal extremal. Then, a necessary and sufficient condition is given for an abnormal extremal to be weakly abnormal. The analysis of the abnormality is completed by considering the particular case of affine constraints over a fixed interval: in this case, the abnormality turns out to have a global character, so that it is possible to define an abnormal problem or a normal problem. The last section is devoted to the study of an optimal control problem characterized by differential constraints corresponding to the dynamics of a controlled process. The above general results are particularized to this problem, yielding a necessary and sufficient condition for an admissible solution to be an abnormal extremal. From this, a previously known result is recovered concerning the linearized system controllability as a sufficient condition to exclude the abnormality.     

On the existence of optimal solutions to integer and mixed-integer programming problems

The purpose of this paper is to present sufficient conditions for the existence of optimal solutions to integer and mixed-integer programming problems in the absence of upper bounds on the integer variables. It is shown that (in addition to feasibility and boundedness of the objective function) (1) in the pure integer case a sufficient condition is that all of the constraints (other than non-negativity and integrality of the variables) beequalities, and (2) that in the mixed-integer caserationality of the constraint coefficients is sufficient. Some computational implications of these results are also given.     

Second-order sufficient optimality conditions for local and global nonlinear programming

This paper presents a new approach to the sufficient conditions of nonlinear programming. Main result is a sufficient condition for the global optimality of a Kuhn-Tucker point. This condition can be verified constructively, using a novel convexity test based on interval analysis, and is guaranteed to prove global optimality of strong local minimizers for sufficiently narrow bounds. Hence it is expected to be a useful tool within branch and bound algorithms for global optimization.     

Necessary and Sufficient Constraint Qualification for Surrogate Duality

In mathematical programming, constraint qualifications are essential elements for duality theory. Recently, necessary and sufficient constraint qualifications for Lagrange duality results have been investigated. Also, surrogate duality enables one to replace the problem by a simpler one in which the constraint function is a scalar one. However, as far as we know, a necessary and sufficient constraint qualification for surrogate duality has not been proposed yet. In this paper, we propose necessary and sufficient constraint qualifications for surrogate duality and surrogate min–max duality, which are closely related with ones for Lagrange duality.     

Unified approach to best unbiased estimation in control problems and linear models

An analog of a sufficient statistic is proposed in the finite-dimensional linear space of statistics. It is shown that the unbiased estimator of the linear function of a parameter closest to a given function, expressed in terms of a minimal linearly sufficient statistic, is potentially unbiased and optimal.Translated from Statisticheskie Metody Otsenivaniya i Proverki Gipotez, pp. 51–58, 1986.     

Throughput and delay optimality of power-of-d choices in inhomogeneous load balancing systems

It is well-known that the power-of-d choices routing algorithm maximizes throughput and is heavy-traffic optimal in load balancing systems with homogeneous servers. However, if the servers are heterogeneous, throughput optimality does not hold in general. We find necessary and sufficient conditions for throughput optimality of power-of-d choices when the servers are heterogeneous, and we prove that almost the same conditions are sufficient to show heavy-traffic optimality. Additionally, we generalize the sufficient condition for throughput optimality to a larger class of routing policies.