The algebraic structure underlying the totally asymmetric exclusion process is studied by using the Bethe Ansatz. From the properties of the algebra generated by the local jump operators, we construct explicitly the hierarchy of operators that commute with the Markov operator. The transfer matrix, which is the generating function of these operators, is shown to represent a discrete Markov proce...

The papers [19], [9], [1], [4], [20], [2], [18], [13], [5], [8], [14], [21], [7], [15], [12], [11], [17], [6], [10], [16], and [3] provide the terminology and notation for this paper. For simplicity we follow the rules: M is a metric space, c, g are elements of the carrier of M , F is a family of subsets of the carrier of M , A, B are subsets of the carrier of M , f is a function, n, m, p, k ar...

A subset X of vertices and edges of a graph G is totally matching if no two elements of X are adjacent or incident. In this paper we determine all graphs in which every maximal total matching is maximum.

In this paper we prove that one can find surgeries arbitrarily close to infinity in the Dehn surgery space of the figure eight knot complement for which some immersed totally geodesic surface compresses. MSC: 57M25, 57M50

We consider totally unimodular (TU) stochastic programs, that is, two-stage stochastic programs whose extensive-form constraint matrix is TU. We generalize the notion of total unimodularity to apply to sets of matrices and provide properties of such sets. We provide several sufficient conditions on stochastic programs to be TU. When solving TU stochastic problems using the L-shaped method, it i...