Fermionic stochastic differential equations and the index of Fredholm operators

The index of a Fredholm operator associated to a-summable Fredholm module is expressed in terms of the vacuum expectation value of a unitary operator-valued stochastic process which satisfies a stochastic differential equation with unbounded coefficients driven by fermion noise.     

LP modeling languages for personal computers: A comparison

The purpose of this paper is to compare and contrast the modeling capabilities of seven algebraic modeling languages (ML) available today, namely, AMPL, GAMS, LINGO, LPL, MPL, PC-PROG and XPRESS-LP. In general, these MLs do an excellent job of providing an interface with which the modeler can specify an algebraically formatted linear program (LP). That is, each ML provides a substantial improvement in time and convenience over the matrix generator/report writers of the last few decades. Further, each of the MLs provides: (1) significant flexibility in model specification, instantiation and modification, (2) effective and efficient conversion from algebraic to solver format, and (3) an understandable and, for the most part, self-documenting model representation. In addition, each of the MLs is constantly being updated and upgraded to provide additional capabilities sought by practitioners and users. However, as shown in the fifteen tables provided in the body of this paper, each ML has its own set of competitive advantages. For example, the most integrated environments (i.e. those integrating the modeling language with a full-screen editor, data import capabilities and a solver) are provided by LINGO and PC-PROG. The most user-friendly interfaces are provided by MPL and PC-PROG, both of which provide window-based interfaces to create models and pop-up windows to display error messages; MPL also uses pull-down menus to specify various operations, whereas PC-PROG uses function keys for operational control. Package costs are led by a current (March, 1991) introductory offer from LINGO. Modeling effectiveness, especially with respect to flexibility in specifying arithmetic statements, is led by GAMS and LPL. Model compactness, as measured by the number of lines required to specify a model, is led by AMPL, LPL, MPL and PC-PROG; LPL, MPL and PC-PROG also provide context sensitive editors which automatically position the cursor where the error was detected. And finally, the most comprehensive user documentation is provided by GAMS, whereas GAMS, LINGO and LPL provide extensive libraries of sample models for those users who learn by example.     

Why do clocks tick?

Drawing on recent developments in the matrix model approach to string theory and the causal set program for quantum gravity we address the question of the origin of time as one aspect of the phase transition from a topological quantum field theory to a quantum theory of gravity. We construct a model with two phases which can be interpreted as containing clocks which either do not tick or tick exactly once. This demonstrates that while a theory based on causal sets may appear to have inherent notions of time and causality, the existence of a phase transition means, that as Saint Augustine wrote in hisConfessions, the time, if such we may call it, when there was no time was not time at all.Received an Honorable Mention in the 1992 Gravity Research Foundation Essay Contest—Ed.     

Lattice size estimates for Gabor decompositions

It is shown that the Gabor frame operator for frames with lattice such thatab=1/N for some integerN1 is continuous on the modulation spaces ([9], [20]) whenever the basic functiong is a Schwartz function and (g, a, b) generates a frame forL ² (R). From this a sufficient condition on the lattice is given which guarantees that one has a Banach frame for the modulation spaces of Feichtinger.This work was supported by NSF grant # DMS-8916968 while the author was visiting Yale University.     

Quasi sure analysis and Stratonovich anticipative stochastic differential equations

Summary Consider a stochastic differential equation on ^d with smooth and bounded coefficients. We apply the techniques of the quasi-sure analysis to show that this equation can be solved pathwise out of a slim set. Furthermore, we can restrict the equation to the level sets of a nondegenerate and smooth random variable, and this provides a method to construct the solution to an anticipating stochastic differential equation with smooth and nondegenerate initial condition.     

On sparse spanners of weighted graphs

Given a graphG, a subgraphG' is at-spanner ofG if, for everyu,v V, the distance fromu tov inG' is at mostt times longer than the distance inG. In this paper we give a simple algorithm for constructing sparse spanners for arbitrary weighted graphs. We then apply this algorithm to obtain specific results for planar graphs and Euclidean graphs. We discuss the optimality of our results and present several nearly matching lower bounds.The work of G. Das and D. Joseph was supported by NSF PYI Grant DCR-8402375. The work of D. Dobkin was supported by NSF Grant CCR-8700917. The work of J. Soares was supported by CNPq proc 203039/87.4 (Brazil) and NSF Grant CCR-9014562. This research was accomplished while G. Das was a student at the University of Wisconsin-Madison. A preliminary version was presented at the Second Scandinavian Workshop on Algorithm Theory, Bergen, Norway, 1990, under the title Generating Sparse Spanners for Weighted Graphs, and proceedings appear in the series Lecture Notes in Computer Science, Springer-Verlag. The preliminary version also appears as Princeton University Technical Report CS-TR-261-90, and as University of Wisconsin-Madison Computer Sciences Technical Report 882.     

Order series of labelled posets

Order series of labelled posets are multi-analogues of the more familiar order polynomials; the corresponding multi-analogues of the related representation polynomials are calledE-series. These series can be used to describe the effect of composition of labelled posets on their order polynomials, whence their interest for us. We give a reciprocity theorem forE-series, and show that for an unlabelled poset the form of theE-series depends only upon the comparability graph of the poset. We also prove that theE-series of any labelled poset is a rational power series (in many indeterminates) and give an algorithm for computing it which runs in polynomial time when the poset is strictly labelled and of bounded width. Finally, we give an explicit product formula for theE-series of strictly labelled interval posets.This research was supported by the Natural Sciences and Engineering Research Council of Canada under operating grant #0105392.     

Local analyticity for the [`(?)]\overline \partial -Neumann problem in completely decoupled pseudoconvex domains-Neumann problem in completely decoupled pseudoconvex domains

In this paper we prove local analyticity of solutions to the -Neumann problem up to the boundary of rigid, completely decoupled pseudoconvex domains with real-analytic boundary. These are domains that are locally of the form Imw > Σ |h _k (z _k )|² with eachh _k holomorphic and vanishing only at 0. As in those earlier papers, we use purelyL ² methods and must construct a special holomorphic vector fieldM and then use carefully balanced polynomials inM to localize high powers ofT = ∂/∂t effectively, wheret = Rew.     

The reaction of allenylsilanes with α,β-unsaturated acylsilanes: new annulation approaches to five and six-membered carbocyclic compounds

The reaction of α,β-unsaturated acylsilanes with allenylsilanes can be directed to produce either five or six-membered carbocyclic compounds.