Currently displaying 1 – 20 of 21

Showing per page

Order by Relevance | Title | Year of publication

Modelling integer linear programs with petri nets

P. Richard — 2010

RAIRO - Operations Research

We show in this paper that timed Petri nets, with one resource shared by all the transitions, are directly connected to the modelling of integer linear programs (ILP). To an ILP can be automatically associated an equivalent Petri net. The optimal reachability delay is an optimal solution of the ILP. We show next that a net can model any ILP. I order to do this, we give a new sufficient reachability condition for the marking equation, which also holds for general Petri nets without timed transitions. ...

Factorization through Hilbert space and the dilation of L(X,Y)-valued measures

V. MandrekarP. Richard — 1993

Studia Mathematica

We present a general necessary and sufficient algebraic condition for the spectral dilation of a finitely additive L(X,Y)-valued measure of finite semivariation when X and Y are Banach spaces. Using our condition we derive the main results of Rosenberg, Makagon and Salehi, and Miamee without the assumption that X and/or Y are Hilbert spaces. In addition we relate the dilation problem to the problem of factoring a family of operators through a single Hilbert space.

An arithmetic analogue of Clifford's theorem

Richard P. Groenewegen — 2001

Journal de théorie des nombres de Bordeaux

Number fields can be viewed as analogues of curves over fields. Here we use metrized line bundles as analogues of divisors on curves. Van der Geer and Schoof gave a definition of a function h 0 on metrized line bundles that resembles properties of the dimension l ( D ) of H 0 ( X , ( D ) ) , where D is a divisor on a curve X . In particular, they get a direct analogue of the Rieman-Roch theorem. For three theorems of curves, notably Clifford’s theorem, we will propose arithmetic analogues.

Page 1 Next

Download Results (CSV)