Near-perfect matrices

A 0, 1 matrixA isnear-perfect if the integer hull of the polyhedron {x0: Ax } can be obtained by adding one extra (rank) constraint. We show that in general, such matrices arise as the cliquenode incidence matrices of graphs. We give a colouring-like characterization of the corresponding class of near-perfect graphs which shows that one need only check integrality of a certain linear program for each 0, 1, 2-valued objective function. This in contrast with perfect matrices where it is sufficient to check 0, 1-valued objective functions. We also make the following conjecture: a graph is near-perfect if and only if sequentially lifting any rank inequality associated with a minimally imperfect graph results in the rank inequality for the whole graph. We show that the conjecture is implied by the Strong Perfect Graph Conjecture. (It is also shown to hold for graphs with no stable set of size eleven.) Our results are used to strengthen (and give a new proof of) a theorem of Padberg. This results in a new characterization of minimally imperfect graphs: a graph is minimally imperfect if and only if both the graph and its complement are near-perfect.The research has partially been done when the author visited Mathematic Centrum, CWI, Amsterdam, The Netherlands.     

An exact algorithm for the maximum stable set problem

We describe a new branch-and-bound algorithm for the exact solution of the maximum cardinality stable set problem. The bounding phase is based on a variation of the standard greedy algorithm for finding a colouring of a graph. Two different node-fixing heuristics are also described. Computational tests on random and structured graphs and very large graphs corresponding to real-life problems show that the algorithm is competitive with the fastest algorithms known so far.This work has been supported by Agenzia Spaziale Italiana.     

The diagnonal multivariate natural exponential families and their classification

A natural exponential family (NEF)F in ? ⁿ ,n>1, is said to be diagonal if there existn functions,a ₁,...,a _n , on some intervals of ?, such that the covariance matrixV _F (m) ofF has diagonal (a ₁(m ₁),...,a _n (m _n )), for allm=(m ₁,...,m _n ) in the mean domain ofF. The familyF is also said to be irreducible if it is not the product of two independent NEFs in ? ^k and ? ^n-k , for somek=1,...,n?1. This paper shows that there are only six types of irreducible diagonal NEFs in ? ⁿ , that we call normal, Poisson, multinomial, negative multinomial, gamma, and hybrid. These types, with the exception of the latter two, correspond to distributions well established in the literature. This study is motivated by the following question: IfF is an NEF in ? ⁿ , under what conditions is its projectionp(F) in ? ^k , underp(x ₁,...,x _n )∶=(x ₁,...,x _k ),k=1,...,n?1, still an NEF in ? ^k ? The answer turns out to be rather predictable. It is the case if, and only if, the principalk×k submatrix ofV _F (m ₁,...,m _n ) does not depend on (m _k+1,...,m _n ).     

Banach spaces that admit support sets

It is shown that the existence of a closed convex set all of whose points are properly supported in a Banach space is equivalent to the existence of a certain type of uncountable ordered one-sided biorthogonal system. Under the continuum hypothesis, we deduce that this notion is weaker than the existence of an uncountable biorthogonal system.

     

Impossibility of a Certain Cyclotomic Equation with Applicationsto Difference Sets

Under certain conditions, we show the nonexistence ofan element in the p-th cyclotomicfield over , that satisfies . As applications, we establish the nonexistence ofsome difference sets and affine difference sets.     

Countable network weight and multiplication of Borel sets

A space Borel multiplies with a space if each Borel set of is a member of the -algebra in generated by Borel rectangles. We show that a regular space Borel multiplies with every regular space if and only if has a countable network. We give an example of a Hausdorff space with a countable network which fails to Borel multiply with any non-separable metric space. In passing, we obtain a characterization of those spaces which Borel multiply with the space of countable ordinals, and an internal necessary and sufficient condition for to Borel multiply with every metric space.

     

HYPERFINITE TRANSVERSAL THEORY. II

We continue the investigation of validity of Hall's theorem in the case of the Loeb space of an internal, uniformly distributed, hyperfinite measure space initiated in1992 by the author. Some new classes of graphs are introduced for which the measure theoretic version of Hall's theorem still holds.

     

Stochastic dominance with nonadditive probabilities

Choquet expected utility which uses capacities (i.e. nonadditive probability measures) in place of-additive probability measures has been introduced to decision making under uncertainty to cope with observed effects of ambiguity aversion like the Ellsberg paradox. In this paper we present necessary and sufficient conditions for stochastic dominance between capacities (i.e. the expected utility with respect to one capacity exceeds that with respect to the other one for a given class of utility functions). One wide class of conditions refers to probability inequalities on certain families of sets. To yield another general class of conditions we present sufficient conditions for the existence of a probability measureP with f dC= f dP for all increasing functionsf whenC is a given capacity. Examples includen-th degree stochastic dominance on the reals and many cases of so-called set dominance. Finally, applications to decision making are given including anticipated utility with unknown distortion function.     

An experimental and theoretical study of vibrational spectra of picolinamide, nicotinamide, and isonicotinamide

The molecular structures and vibrational spectra of the three isomers of pyridinecarboxamide (picolinamide, nicotinamide, isonicotinamide) were calculated with the Density Functional Theory (DFT) method using the B3LYP function and the 6-31++G(d,p), Z2PolX, Z3PolX basis sets. The calculations were performed by using the Gaussian98W packet program set. The total energy distributions (TED) of the vibrational modes of these molecules were calculated by using the Scale 2.0 program and the vibrational modes of the molecules were determined. The Scaled Quantum Mechanical (SQM) method was used in the scaling procedure. In the experimental part of the study, the solid phase FT-IR and Micro Raman spectra of the three isomers of pyridinecarboxamide have been recorded in the range of 4000-650 and 1200-100 cm⁻¹, respectively. The calculated wavenumbers were compared to the corresponding experimental values. As a result, the observed bands of the three isomers of pyridinecarboxamide were assigned with good accuracy.     

THE THEORETICAL STUDY OF ADSORPTION OF METAL IONS ON CHITOSAN

1. INTRODUCTION Chitin, the most abundant natural amino polysaccharide and estimated to be produced annually almost as much as cellulose, is well known to consist of 2-acetamido-2-deoxy-β-D- glucose through α, β(1→4) linkage. Chitin is the major source of surface pollution in coastalareas. Chitosan is the N-deacetylated derivative of chitin and their structures are shown in Fig. 1. Fig. 1 Structures of Chitin and Chitosan Because of the excellent properties such as biocompatibility…