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

Fuzzy set theory has been proposed as a means for modeling the vagueness in complex systems. Fuzzy systems usually employ type-1 fuzzy sets, representing uncertainty by numbers in the range [0, 1]. Despite commercial success of fuzzy logic, a type-1 fuzzy set (T1FS) does not capture uncertainty in its manifestations when it arises from vagueness in the shape of the membership function. Such unc...

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...

Rather than loading the owner's guide down with lots of " this is what you just bought and let us tell you how wonderful it is " propaganda, we fought to keep it concise, non-intimidating, and solution directed. Many of SpinRite 3.1's initial users have reported that they love the guide's brevity. But it explains nothing about how and what SpinRite does. So we created this " under the hood " te...