An admissible Poisson algebra (or briefly, an adm-Poisson algebra) gives equivalent presentation with only one operation for a algebra. We establish bialgebra theory algebras independently and systematically, including but beyond the corresponding results on bialgebras given in [27]. Explicitly, we introduce notion of which are to Manin triples as well bialgebras. The direct correspondence betw...

We establish the polynomial-time solvability of a class of vector partition problems with linear objectives subject to restrictions on the number of elements in each part. c © 2000 Published by Elsevier Science B.V. All rights reserved. 1. Shaped partition problems The shaped partition problem concerns the partitioning of n vectors A; : : : ; A in d-space into p parts so as to maximize an objec...

We introduce methods for identifying operator preconditions that need not be expanded further. The methods are proved to be admissible , that is, they will not cause a solution to be missed when one exists. In certain cases, the methods also identify operator reformulations that increase the number of nonexpandable preconditions. This approach provides effective loop control in common situation...

Let G be an eulerian graph. For each vertex v # V(G), let P(v) be a partition of the edges incident with v and set P= v # V(G) P(v), called a forbidden system of G. We say that P is admissible if |P & T | 2 |T | for every P # P and every edge cut T of G. H. Fleischner and A. Frank (1990, J. Combin. Theory Ser. B 50, 245 253) proved that if G is planar and P is any admissible forbidden system of...

One of the most important prediction problems in finite population is the prediction of a linear function of characteristic values of a finite population. In this paper the admissibility of linear predictors of an arbitrary linear function of characteristic values in a finite population under reflected normal loss function is considered. Under the super-population model, we obtain the condition...

In this paper, at first, we introduce $alpha_{mu}$-admissible, $Z_mu$-contraction and  $N_{mu}$-contraction via simulation functions. We prove some new fixed point theorems for defined class of contractions   via $alpha$-admissible simulation mappings, as well. Our results  can be viewed as extension of the corresponding results in this area.  Moreover, some examples and an application to funct...

If Visser’s rules are admissible for an intermediate logic, they form a basis for the admissible rules of the logic. How to characterize the admissible rules of intermediate logics for which not all of Visser’s rules are admissible is not known. Here we study the situation for specific intermediate logics. We provide natural examples of logics for which Visser’s rule are derivable, admissible b...