Decomposing thick subcategories of the stable module category

Let be the stable category of finitely generated modular representations of a finite group G over a field k. We prove a Krull-Remak-Schmidt theorem for thick subcategories of . It is shown that every thick tensor-ideal of (i.e. a thick subcategory which is a tensor ideal) has a (usually infinite) unique decomposition into indecomposable thick tensor-ideals. This decomposition follows from a decomposition of the corresponding idempotent kG-module into indecomposable modules. If is the thick tensor-ideal corresponding to a closed homogeneous subvariety W of the maximal ideal spectrum of the cohomology ring , then the decomposition of reflects the decomposition of W into connected components. Received: 27 April 1998 / In revised form: 16 July 1998     

Total restrained domination in graphs with minimum degree two

In this paper, we continue the study of total restrained domination in graphs, a concept introduced by Telle and Proskurowksi (Algorithms for vertex partitioning problems on partial k-trees, SIAM J. Discrete Math. 10 (1997) 529-550) as a vertex partitioning problem. A set S of vertices in a graph G=(V,E) is a total restrained dominating set of G if every vertex is adjacent to a vertex in S and every vertex of V?S is adjacent to a vertex in V?S. The minimum cardinality of a total restrained dominating set of G is the total restrained domination number of G, denoted by γ_tr(G). Let G be a connected graph of order n with minimum degree at least 2 and with maximum degree Δ where Δ?n-2. We prove that if n?4, then and this bound is sharp. If we restrict G to a bipartite graph with Δ?3, then we improve this bound by showing that and that this bound is sharp.     

Total Domination in Graphs with Given Girth

A set S of vertices in a graph G without isolated vertices is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γ _t (G) of G. In this paper, we establish an upper bound on the total domination number of a graph with minimum degree at least two in terms of its order and girth. We prove that if G is a graph of order n with minimum degree at least two and girth g, then γ _t (G) ≤ n/2 + n/g, and this bound is sharp. Our proof is an interplay between graph theory and transversals in hypergraphs. Michael A. Henning: Research supported in part by the South African National Research Foundation and the University of KwaZulu-Natal.     

Periodical states and marching groups in a closed owari

Owari is an old African game that consists of cyclically ordered pits that are filled with pebbles. In a sowing move all the pebbles are taken out of one pit and distributed one by one in subsequent pits. Repeated sowing will give rise to recurrent states of the owari. Bouchet studied such periodical states in an idealised setup, where there are infinitely many pits. We characterise periodical states in owaris with finitely many pits. Our result implies Bouchet's result.     

On claw-free t-perfect graphs

A graph is called t-perfect, if its stable set polytope is defined by non-negativity, edge and odd-cycle inequalities. We characterise the class of all claw-free t-perfect graphs by forbidden t-minors, and show that they are 3-colourable. Moreover, we determine the chromatic number of claw-free h-perfect graphs and give a polynomial-time algorithm to compute an optimal colouring.     

The early exercise region for Bermudan options on two underlyings

This paper investigates the early exercise region for Bermudan options on two underlying assets. We present a set of analytical validation results for the early exercise region which can be used as a means of validating pricing techniques. When all strike prices are identical we show the existence of an intersection point such that for any asset price pair below this point early exercise is always optimal. We develop an approximation to this point in the two asset put case. When the strike prices are not all equal, we show that three separate cases exist for the early exercise region. For a Bermudan put on two assets we present these cases and show that there exists a critical point in which the boundaries of the two asset early exercise region bifurcate. Comparisons are drawn between the Bermudan results presented and the corresponding American option results.     

Location-domination in line graphs

A set $D$ of vertices of a graph $G$ is locating if every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N\left(u\right)\cap D\ne N\left(v\right)\cap D$, where $N\left(u\right)$ denotes the open neighborhood of $u$. If $D$ is also a dominating set (total dominating set), it is called a locating-dominating set (respectively, locating-total dominating set) of $G$. A graph $G$ is twin-free if every two distinct vertices of $G$ have distinct open and closed neighborhoods. It is conjectured (Garijo et al., 2014 [15]) and (Foucaud and Henning, 2016 [12]) respectively, that any twin-free graph $G$ without isolated vertices has a locating-dominating set of size at most one-half its order and a locating-total dominating set of size at most two-thirds its order. In this paper, we prove these two conjectures for the class of line graphs. Both bounds are tight for this class, in the sense that there are infinitely many connected line graphs for which equality holds in the bounds.