用亚硝基R盐螯合树脂分离富集催化极谱法测定矿石中的铱

本文研究了利用亚硝基Ｒ盐螯合形成的树脂，分离富集试液中痕量贵金属元素铱的实验条件。并利用ＪＰ－１型示波极谱仪，在１．５０ｍｏｌ／Ｌ盐酸＋５．０×１０＾－５ｍｏｌ／Ｌ硫脲＋０．２ｍｏｌ／Ｌ盐酸＋５．０×１０＾－５ｍｏｌ／Ｌ硫脲＋０．２ｍｏｌ／Ｌ碘化钾＋碲（ρ（Ｂ）＝０．４ｍｇ／Ｌ）的混合底液中，对铱进行极谱催化波测定。在示波极谱仪上峰电位约－０．５５Ｖ（银汞齐为参比电极），可测定试液中５．０×１．０     

Synthesis of New Ligand 1,2-Bis{di[（R,R）-1,3,2-oxzaphosphlidine]phosphino}ethane with C_2-symmetric Axis and Application in Rh-catalyzed Asymmetric Hydrogenation

New ligand 1,2-bis{di[（R,R）-1,3,2-oxzaphosphlidine]phosphino}ethane [（R,R）-BDOPPEs 1,2,3 and 4] with C2-symmetric axis and bearing nitrogen and oxygen were synthesized from readily available optically active amino alcohols.Rh complexes with these ligands were highly enantioselective catalysts for asymmetric hydrogenation of N-benzoyldehydroamino acid derivatives and α-functionalized ketones in 99%e.e.and 98%e.e.,respectively.This new class of（R,R）-BDOPPEs 1,2,3 and 4 gave much more effectivity and enantionselectivity than their corresponding non-C2-asymmetric aminophosphine phosphinite.     

Some graphs with small second eigenvalue

For any prime,p, we construct a Cayley graph on the group,G, of affine linear transformations ofℤ/pℤ of degree 2(p−1) and second eigenvalue with the following special property: the adjacency matrix of the graph is supported on the “blocks” associated to the trivial representation and the irreducible representation of sizep−1. SinceG is of orderp(p−1), the correspondingt-uniform Cayley hypergraph has essentially optimal second eigenvalue for this degree and size of the graph (see [2] for definitions). En route we give, for any integerk>1, a simple Cayley graph onp ^k nodes of degreep of second eigenvalue . The author wishes to acknowledge the National Science Foundation for supporting this research in part under Grant CCR-8858788, and the Office of Naval Research under Grant N00014-87-K-0467.     

An approximate max-flow min-cut relation for undirected multicommodity flow,with applications

In this paper, we prove the first approximate max-flow min-cut theorem for undirected multicommodity flow. We show that for a feasible flow to exist in a multicommodity problem, it is sufficient that every cut's capacity exceeds its demand by a factor ofO(logClogD), whereC is the sum of all finite capacities andD is the sum of demands. Moreover, our theorem yields an algorithm for finding a cut that is approximately minimumrelative to the flow that must cross it. We use this result to obtain an approximation algorithm for T. C. Hu's generalization of the multiway-cut problem. This algorithm can in turn be applied to obtain approximation algorithms for minimum deletion of clauses of a 2-CNF formula, via minimization, and other problems. We also generalize the theorem to hypergraph networks; using this generalization, we can handle CNF clauses with an arbitrary number of literals per clause.Most of the results in this paper were presented in preliminary form in Approximation through multicommodity flow,Proceedings, 31th Annual Symposium on Foundations of Computer Science (1990), pp. 726–737.Research supported by the National Science Foundation under NSF grant CDA 8722809, by the Office of Naval and the Defense Advanced Research Projects Agency under contract N00014-83-K-0146, and ARPA Order No. 6320, Amendament 1.Research supported by NSF grant CCR-9012357 and by an NSF Presidential Young Investigator Award.     

A family of (n−1)! Diagonal polynomial orders ofN n

Letn>0 be an element of the setN of nonnegative integers, and lets(x)=x ₁+...+x _n , forx=(x ₁, ...,x _n ) N _n . Adiagonal polynomial order inN _n is a bijective polynomialp:N _n N (with real coefficients) such that, for allx,y N _n ,p(x)<p(y) whenevers(x)<s(y). Two diagonal polynomial orders areequivalent if a relabeling of variables makes them identical. For eachn, Skolem (1937) found a diagonal polynomial order. Later, Morales and Lew (1992) generalized this polynomial order, obtaining a family of 2 ^n–2 (n>1) inequivalent diagonal polynomial orders. Here we present, for eachn>0, a family of (n – 1)! diagonal polynomial orders, up to equivalence, which contains the Morales and Lew diagonal orders.     

The Dold-Lashof-Fuchs construction revisited

Sia dato uno spazio topologicoE con azione di un monoide topologicoH e siaE→B una funzione continue che, su ogni apertoU di una partizione dell'unità diB, sia, a meno di omotopia, la proiezioneU×H→U (ovvero una fibrazione numerabile). Un classico risultato di A. Dold e R. Lashof (1959) permette di costruire, a partire daE→B, una funzione continuaE _∞→B_∞, conE _∞ debolmente contraibile e munito di azione diH: laH-fibrazione universale associata daH. Tale funzione, in generale, non è purtroppo numerabile e quindi non si presta alla classificazione delleH-fibrazioni numerabili. Successivamente (1971), M. Fuchs ha trovato un modo di modificare la costruzione di Dold-Lashof per recuperare la numerabilità. La costruzione di Dold-Lashof-Fuchs è, da allora, uno dei principali strumenti nella teoria degli spazi classificanti di monoidi topologici, anche se vi è un uso di topologie alquanto complesse e quindi poco maneggevoli. In questo lavoro ci proponiamo di mostrare come, lavorando nella categoria conveniente deik-spazi, sia possibile descrivere la costruzione di Dold-Lashof-Fuchs in modo estremamente semplificato ed adattarla anche alla classificazione delleF-fibrazioni numerabili.

---

Conferenza tenuta da R. Piccinini il 15 maggio 1995     

Cosmological principle and primordial spinor fields

An exact solution of Dirac's equation in an open Robertson-Walker universe is constructed such that the corresponding energy-momentum densityT _µv obeys the cosmological principle. However, in anopen universe, this principlemust always be violated by the other physical densities of the cosmological solution (e.g. pseudoscalar, (axial-) current and polarization). If the current densityj _µ = isrequired to obey the cosmological principle, then the universe must beflat.     

q-transformation theory

We obtain the complete set of states of theq-oscillator in both configuration space and momentum space as well as the transformation between these spaces. The states as well as the matrix elements lie in the SU _q (2) algebra. To obtain transition probabilities, one must take the Woronowicz square.     

Right distributive quasigroups on algebraic varieties

In this paper we develop a structure theory of algebraic right distributive quasigroups which correspond to closed and connected conjugacy classes generating algebraic Fischer groups (in the sense of [6]) such that the mappingx x ^–1 ax, fora , is an automorphism of (as variety). We also give examples of algebraic Fischer groups where this does not happen. It becomes clear that the class of algebraic right distributive quasigroups has nice properties concerning subquasigroups, normal subquasigroups and direct product.We give a complete classification of one- and two-dimensional as well as of minimal algebraic right distributive quasigroups.     

TrigonometricR matrices related to ‘dilute’ Birman-Wenzl-Murakami algebra

Explicit expressions for three series ofR matrices which are related to a dilute generalisation of the Birman-Wenzl-Murakami algebra are presented. Of those, one series is equivalent to the quantumR matrices of theD _n+1 ⁽²⁾ generalised Toda systems, whereas the remaining two series appear to be new.