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.     

Efficient Continuous Wave-laser emission of Pr3+-doped fluorides at room temperature

We report, to our knowledge for the first time, Continuous Wave (CW) laser emission at room temperature of Pr:LiYF₄ (Pr.YLF) at six wavelengths: 522, 545, 607, 639.5, 720 and 907.4 nm. The pump source was an argon-ion laser tuned to a wavelength of = 457.9 nm. The maximum output powers at 522 nm (³P_i ³H₅) and 639.5 nm (³P₀ ³F₂) were 144 and 266 mW, respectively. We also observed CW laser action of Pr:GdLiF₄ (Pr: GLF) at = 639 nm and of Pr:KYF₄ (Pr: KYF) at = 642.5 nm.     

Inclusion-exclusion: Exact and approximate

It is often required to find the probability of the union of givenn eventsA ₁ ,...,A _n . The answer is provided, of course, by the inclusion-exclusion formula: Pr(A _i )= _i – _i<j Pr(A _i A _j )±.... Unfortunately, this formula has exponentially many terms, and only rarely does one manage to carry out the exact calculation. From a computational point of view, finding the probability of the union is an intractable, #P-hard problem, even in very restricted cases. This state of affairs makes it reasonable to seek approximate solutions that are computationally feasible. Attempts to find such approximate solutions have a long history starting already with Boole [1]. A recent step in this direction was taken by Linial and Nisan [4] who sought approximations to the probability of the union, given the probabilities of allj-wise intersections of the events forj=1,...k. The developed a method to approximate Pr(A _i ), from the above data with an additive error of exp . In the present article we develop an expression that can be computed in polynomial time, that, given the sums _|S|=j Pr( _iS A _i ) forj=1,...k, approximates Pr(A _i ) with an additive error of exp . This error is optimal, up to the logarithmic factor implicit in the notation.The problem of enumerating satisfying assignments of a boolean formula in DNF formF=v _l ^m C _i is an instance of the general problem that had been extensively studied [7]. HereA _i is the set of assignments that satisfyC _i , and Pr( _iS A _i )=a _S /2ⁿ where _iS C _i is satisfied bya _S assignments. Judging from the general results, it is hard to expect a decent approximation ofF's number of satisfying assignments, without knowledge of the numbersa _S for, say, all cardinalities . Quite surprisingly, already the numbersa _S over |S|log(n+1)uniquely determine the number of satisfying assignments for F.We point out a connection between our work and the edge-reconstruction conjecture. Finally we discuss other special instances of the problem, e.g., computing permanents of 0,1 matrices, evaluating chromatic polynomials of graphs and for families of events whose VC dimension is bounded.Work supported in part by a grant of the Binational Israel-US Science Foundation.Work supported in part by a grant of the Binational Israel-US Science Foundation and by the Israel Science Foundation.     

Surgery on the Novikov complex

Let M be a closed connected smooth manifold with dim M=n6, and : ₁(M) Z be an epimorphism. Denote by the group ring of ₁(M) and let ^– be its Novikov completion. Let D _* be a free-based finitely generated chain complex over ^– . Assume that D _ii=0 for i1 and in–1 and that D _* has the same simple homotopy type as the Novikov-completed simplicial chain complex of the universal covering M. Let N be an integer. We prove that D _* can be realized, up to the terms of ^– of degree N as the Novikov complex of a Morse map : M S ¹, belonging to . Applications to Arnold's conjectures and to the theory of fibering of M over S ¹ are given.