Coordination compounds of 2-mercapto-1-methylimidazole with platinum(II), palladium(II), rhodium(III) and ruthenium(III)

Summary Complexes of 2-mercapto-1-methylimidazole (TMZ) with Pt^II, Pd^II, Rh^III and Ru^III of the general formulae Pt(TMZ)₂Cl₂, Pd(TMZ)₄Cl₂. Rh(TMZ)Cl₃ and Ru(TMZ)Cl₃ have been obtained. The thermal stabilities of the compounds were estimated by derivatographic measurements and the electron-donating atom of the measurements and the electron-donating atom of the ligand was identified from the i.r. absorbtion spectra. Lattice constants for the Pt^II and Pd^II complexes were estimated from their x-ray powder diffraction patterns.     

Feasibility in reverse convex mixed-integer programming

In this paper we address the problem of the infeasibility of systems defined by reverse convex inequality constraints, where some or all of the variables are integer. In particular, we provide a polynomial algorithm that identifies a set of all constraints critical to feasibility (CF), that is constraints that may affect a feasibility status of the system after some perturbation of the right-hand sides. Furthermore, we will investigate properties of the irreducible infeasible sets and infeasibility sets, showing in particular that every irreducible infeasible set as well as infeasibility sets in the considered system, are subsets of the set CF of constraints critical to feasibility.     

Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences

In the paper a single machine time-dependent scheduling problem is considered. The processing time p_j of each job is described by a function of the starting time t of the job, p_j=1+α_jt, where the job deterioration rate α_j?0 for j=0,1,…,n and t?0. Jobs are nonpreemptable and independent, there are no ready times and no deadlines. The criterion of optimality of a schedule is the total completion time.First, the notion of a signature for a given sequence of job deterioration rates is introduced, two types of the signature are defined and their properties are shown. Next, on the basis of these properties a greedy polynomial-time approximation algorithm for the problem is formulated. This algorithm, starting from an initial sequence, iteratively constructs a new sequence concatenating the previous sequence with new elements, according to the sign of one of the signatures of this sequence.Finally, these results are applied to the problem with job deterioration rates which are consecutive natural numbers, α_j=j for j=0,1,…,n. Arguments supporting the conjecture that in this case the greedy algorithm is optimal are presented.     

Ultra <Emphasis Type="Italic">LI</Emphasis>-ideals in lattice implication algebras and <Emphasis Type="Italic">MTL</Emphasis>-algebras

A mistake concerning the ultra LI-ideal of a lattice implication algebra is pointed out, and some new sufficient and necessary conditions for an LI-ideal to be an ultra LI-ideal are given. Moreover, the notion of an LI-ideal is extended to MTL-algebras, the notions of a (prime, ultra, obstinate, Boolean) LI-ideal and an ILI-ideal of an MTL-algebra are introduced, some important examples are given, and the following notions are proved to be equivalent in MTL-algebra: (1) prime proper LI-ideal and Boolean LI-ideal, (2) prime proper LI-ideal and ILI-ideal, (3) proper obstinate LI-ideal, (4) ultra LI-ideal. This work was supported by the Zhejiang Provincial Natural Science Foundation of China (Grant No. Y605389) and K. C. Wong Magna Fund in Ningbo University.     

Weak convergence of almost orbits of asymptotically nonexpansive commutative semigroups

We give three equivalent conditions for weak convergence of almost orbits of an asymptotically nonexpansive commutative semigroup acting on a nonempty bounded closed convex subset of a uniformly convex Banach space whose dual has the Kadec property.     

Minimal infeasible constraint sets in convex integer programs

In this paper we investigate certain aspects of infeasibility in convex integer programs, where the constraint functions are defined either as a composition of a convex increasing function with a convex integer valued function of n variables or the sum of similar functions. In particular we are concerned with the problem of an upper bound for the minimal cardinality of the irreducible infeasible subset of constraints defining the model. We prove that for the considered class of functions, every infeasible system of inequality constraints in the convex integer program contains an inconsistent subsystem of cardinality not greater than 2 ⁿ , this way generalizing the well known theorem of Scarf and Bell for linear systems. The latter result allows us to demonstrate that if the considered convex integer problem is bounded below, then there exists a subset of at most 2 ⁿ −1 constraints in the system, such that the minimum of the objective function subject to the inequalities in the reduced subsystem, equals to the minimum of the objective function over the entire system of constraints.     

Quasi-Banach spaces of almost universal disposition

We show that for each p∈(0,1]$p\in (0,1]$ there exists a separable p  -Banach space _Gp${\mathbb{G}}_p$ of almost universal disposition, that is, having the following extension property: for each ε>0$\epsilon >0$ and each isometric embedding g:X→Y$g:X\to Y$, where Y is a finite-dimensional p-Banach space and X   is a subspace of _Gp${\mathbb{G}}_p$, there is an ε  -isometry f:Y→_Gp$f:Y\to {\mathbb{G}}_p$ such that x=f(g(x))$x=f(g(x))$ for all x∈X$x\in X$.     

Poset algebras over well quasi-ordered posets

A new class of partial order-types, class is defined and investigated here. A poset P is in the class iff the poset algebra F(P) is generated by a better quasi-order G that is included in L(P). The free Boolean algebra F(P) and its free distributive lattice L(P) have been defined in [ABKR]. The free Boolean algebra F(P) contains the partial order P and is generated by it: F(P) has the following universal property. If B is any Boolean algebra and f is any order-preserving map from P into a Boolean algebra B, then f can be extended to a homomorphism of F(P) into B. We also define L(P) as the sublattice of F(P) generated by P. We prove that if P is any well quasi-ordering, then L(P) is well founded, and is a countable union of well quasi-orderings. We prove that the class is contained in the class of well quasi-ordered sets. We prove that is preserved under homomorphic image, finite products, and lexicographic sum over better quasi-ordered index sets. We prove also that every countable well quasi-ordered set is in . We do not know, however if the class of well quasi-ordered sets is contained in . Additional results concern homomorphic images of posets algebras. The third author was supported by the following institutions: Israel Science Foundation (postdoctoral positions at Ben Gurion University 2000–2002), The Fields Institute (Toronto 2002–2004), and by The Nato Science Fellowship (University Paris VII, CNRS-UMR 7056, 2004).     

On ideals and congruences in bcc-algebras

We introduce a new concept of ideals in BCC-algebras and describe connections between such ideals and congruences.     

On the weak topology of Banach spaces over non-archimedean fields

It is known that within metric spaces analyticity and K-analyticity are equivalent concepts. It is known also that non-separable weakly compactly generated (shortly WCG) Banach spaces over R or C provide concrete examples of weakly K-analytic spaces which are not weakly analytic. We study the case which totally differs from the above one. A general theorem is provided which shows that a Banach space E over a locally compact non-archimedean non-trivially valued field is weakly Lindelöf iff E is separable iff E is WCG iff E is weakly web-compact (in the sense of Orihuela). This provides a non-archimedean version of a remarkable Amir-Lindenstrauss theorem.