This study focused on persons 65 years of age and over who were dually entitled to Medicare and Medicaid in 1978. The paper examines their age, sex, and race characteristics, and their Medicare utilization and mortality rates in comparison to persons eligible for Medicare only. The study showed that the group entitled to both Medicare and Medicaid was relatively much older than those with Medic...

Many works related to dually chordal graphs, their cliques and neighborhoods were published. We will undertake a similar study but by considering minimal separators and their properties. Moreover we find new characterizations of dually chordal graphs.

We investigate questions in quantum information geometry which concern the existence and non-existence of dual and dually flat structures on stratified sets of density operators on finite-dimensional Hilbert spaces. We show that the set of density operators of a given rank admits dually flat connections for which one connection is complete if and only if this rank is maximal. We prove moreover ...

We provide a new modus operandi for the computation of the nucleolus in cooperative games with transferable utility. Using the concept of dual game we extend the theory of characterization sets. Dually essential and if the game is monotonic dually saturated coalitions determine both the core and the nucleolus whenever the core is non-empty. We show how these two sets are related to the existing...

A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T . This paper investigates the Colourability problem on dually chordal graphs. It will show that it is NP-complete in case of four colours and solvable in linear time with a simple algorithm in case of three colours. In addition, it will be shown that a dually chordal graph is ...

Dually flat manifolds constitute fundamental mathematical objects of information geometry. This note establishes some facts on the global properties and topology of dually flat manifolds which, in particular, provide answers to questions and problems in global information geometry posed by Amari and Amari-Nagaoka.

A vertex with neighbours of degrees d1 ≥ · · · ≥ dr has vertex type (d1, . . . , dr). A graph is vertex-oblique if each vertex has a distinct vertex-type. While no graph can have distinct degrees, Schreyer, Walther and Mel’nikov [Vertex oblique graphs, same proceedings] have constructed infinite classes of super vertex-oblique graphs, where the degree-types of G are distinct even from the degre...