Results 1  10
of
16
Synchronization and linearity: an algebra for discrete event systems
, 2001
"... The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific ..."
Abstract

Cited by 369 (11 self)
 Add to MetaCart
The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific community. Copyright Statement This electronic document is in PDF format. One needs Acrobat Reader (available freely for most platforms from the Adobe web site) to benefit from the full interactive machinery: using the package hyperref by Sebastian Rahtz, the table of contents and all LATEX crossreferences are automatically converted into clickable hyperlinks, bookmarks are generated automatically, etc.. So, do not hesitate to click on references to equation or section numbers, on items of thetableofcontents and of the index, etc.. One may freely use and print this document for one’s own purpose or even distribute it freely, but not commercially, provided it is distributed in its entirety and without modifications, including this preface and copyright statement. Any use of thecontents should be acknowledged according to the standard scientific practice. The
Algebraic Tools for the Performance Evaluation of Discrete Event Systems
 IEEE Proceedings: Special issue on Discrete Event Systems
, 1989
"... In this paper, it is shown that a certain class of Petri nets called event graphs can be represented as linear "timeinvariant" finitedimensional systems using some particular algebras. This sets the ground on which a theory of these systems can be developped in a manner which is very ana ..."
Abstract

Cited by 91 (7 self)
 Add to MetaCart
In this paper, it is shown that a certain class of Petri nets called event graphs can be represented as linear "timeinvariant" finitedimensional systems using some particular algebras. This sets the ground on which a theory of these systems can be developped in a manner which is very analogous to that of conventional linear system theory. Part 2 of the paper is devoted to showing some preliminary basic developments in that direction. Indeed, there are several ways in which one can consider event graphs as linear systems: these ways correspond to approaches in the time domain, in the event domain and in a twodimensional domain. In each of these approaches, a di#erent algebra has to be used for models to remain linear. However, the common feature of these algebras is that they all fall into the axiomatic definition of "dioids". Therefore, Part 1 of the paper is devoted to a unified presentation of basic algebraic results on dioids. 1 Introduction Definitions and examples of Discrete ...
Determinant: Combinatorics, Algorithms, and Complexity
, 1997
"... We prove a new combinatorial characterization of the determinant. The characterization yields a simple combinatorial algorithm for computing the determinant. Hitherto, all (known) algorithms for the determinant have been based on linear algebra. Our combinatorial algorithm requires no division, a ..."
Abstract

Cited by 29 (7 self)
 Add to MetaCart
We prove a new combinatorial characterization of the determinant. The characterization yields a simple combinatorial algorithm for computing the determinant. Hitherto, all (known) algorithms for the determinant have been based on linear algebra. Our combinatorial algorithm requires no division, and works over arbitrary commutative rings. It also lends itself to e#cient parallel implementations. It has been known for some time now that the complexity class GapL characterizes the complexity of computing the determinant of matrices over the integers. We present a direct proof of this characterization.
Supertropical matrix algebra
 Israel J. Math
"... Abstract. The objective of this paper is to develop a general algebraic theory of supertropical matrix algebra, extending [11]. Our main results are as follows: • The tropical determinant (i.e., permanent) is multiplicative when all the determinants involved are tangible. • There exists an adjoint m ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
Abstract. The objective of this paper is to develop a general algebraic theory of supertropical matrix algebra, extending [11]. Our main results are as follows: • The tropical determinant (i.e., permanent) is multiplicative when all the determinants involved are tangible. • There exists an adjoint matrix adj(A) such that the matrix A adj(A) behaves much like the identity matrix (times A). • Every matrix A is a supertropical root of its HamiltonCayley polynomial fA. If these roots are distinct, then A is conjugate (in a certain supertropical sense) to a diagonal matrix. • The tropical determinant of a matrix A is a ghost iff the rows of A are tropically dependent, iff the columns of A are tropically dependent. • Every root of fA is a “supertropical ” eigenvalue of A (appropriately defined), and has a tangible supertropical eigenvector. 1.
A Combinatorial Algorithm for the Determinant
 In Proceedings of the 8th Annual ACMSIAM Symposium on Discrete Algorithms
, 1997
"... We show the first efficient combinatorial algorithm for the computation of the determinant. Hitherto, all (known) algorithms for determinant have been based on linear algebra. In contrast, our algorithm and its proof of correctness are totally combinatorial in nature. The algorithm requires no divis ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We show the first efficient combinatorial algorithm for the computation of the determinant. Hitherto, all (known) algorithms for determinant have been based on linear algebra. In contrast, our algorithm and its proof of correctness are totally combinatorial in nature. The algorithm requires no division and works on arbitrary commutative rings. It also lends itself to efficient sequential and parallel implementations. 1 Introduction The Determinant has been the subject of study for over 200 years. Its history can be traced back to Leibnitz, Crammer, Vandermode, Binet, Cauchy, Jacobi, Gauss and others. Given its importance in linear algebra in particular and in geometry in general, it is not surprising that a galaxy of great mathematicians investigated the determinant from varied viewpoints. The algorithmic history of the determinant is as old as the mathematical concept itself. After all, the determinant was invented to solve systems of linear equations. Much of the initial effort was...
The Jacobian conjecture as a problem of perturbative quantum field theory, math.CO/0208173, preprint
, 2002
"... The Jacobian conjecture is an old unsolved problem in mathematics, which has been unsuccessfully attacked from many different angles. We add here another point of view pertaining to the so called formal inverse approach, that of perturbative quantum field theory. ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
(Show Context)
The Jacobian conjecture is an old unsolved problem in mathematics, which has been unsuccessfully attacked from many different angles. We add here another point of view pertaining to the so called formal inverse approach, that of perturbative quantum field theory.
Determinant: Old algorithms, new insights
 in Proceedings SWAT'98  6th Scandinavian Workshop on Algorithm Theory
, 1998
"... Abstract. In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of the coefficients of the characteristic polynomial in terms of walks and closed walks of different kinds in th ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of the coefficients of the characteristic polynomial in terms of walks and closed walks of different kinds in the underlying graph. We develop algorithms based on these characterizations and show that they tally with wellknown algorithms arrived at independently from considerations in linear algebra.
Two Lectures on Maxplus Algebra
 In Proceedings of the 26th Spring School on Theoretical Computer Science and Automatic Control, Noirmoutier
, 1998
"... 5 1. Introduction: the (max, +) and tropical semirings 5 2. Seven good reasons to use the (max, +) semiring 6 3. Solving Linear Equations in the (max, +) Semiring 11 Chapter 2. Exotic Semirings: Examples and General Results 21 1. Definitions and Zoology 21 2. Combinatorial Formul in Semirings ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
5 1. Introduction: the (max, +) and tropical semirings 5 2. Seven good reasons to use the (max, +) semiring 6 3. Solving Linear Equations in the (max, +) Semiring 11 Chapter 2. Exotic Semirings: Examples and General Results 21 1. Definitions and Zoology 21 2. Combinatorial Formul in Semirings 25 3. Naturally Ordered Semirings 32 4. Semimodules and Linear Maps 34 5. Images and Kernels 36 6. Factorization of Linear Maps and Linear Extension Theorem 37 7. Finiteness Theorems for Semimodules 39 8. Minimal Generating Families, Convex Geometries, and MaxPlus Projective Geometry 41 9. Equivalence of matrices and Green classes 44 10. Hints and Answers to Exercises 47 The maxplus policy improvement algorithm 49 Bibliography 53 Index 57 3 4 CONTENTS CHAPTER 1 Motivations and Survey of Results This introductive chapter is taken verbatim from the survey "Methods and Applications of (max,+) Linear Algebra", S. Gaubert and M. Plus 1 , which appeared in the Proceedings of STACS'1997, L...