In this paper, I show that general recursive definitions can be represented in the free monad which supports the ‘effect’ of making a recursive call, without saying how these calls should be executed. Diverse semantics can be given within a total framework by suitable monad morphisms. The Bove-Capretta construction of the domain of a general recursive function can be presented datatype-generica...

A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1, 2, · · · , v+e. Such a labeling is vertex magic if the sum of the label on a vertex and the labels on its incident edges is a constant independent of the choice of vertex, and edge magic if the sum of an edge label and the labels of the endpoints of the edge ...

It was shown by Dikranjan and Shakhmatov in 1992 that if a compact abelian group K admits a proper totally dense pseudocompact subgroup, then K cannot have a torsion closed Gδ-subgroup; moreover this condition was shown to be also sufficient under LH. We prove in ZFC that this condition actually ensures the existence of a proper totally dense subgroup H of K that contains an ω-bounded dense sub...

Let 5( + , < ) be a system consisting of a set S endowed with an associative binary operation + and a total ( = linear = simple) order relation < . The composition + and the relation < may be connected by either or both of the following conditions. MC (Monotone Condition). If a and b are elements of 5 such that ax+y ...

Totally tubular chitin lies create uniform tracheal tubes by molding them around an expanding chitin filament, according to Anna Tonning, Anne Uv, and colleagues (Göteborg University, Göteborg, Sweden). Uv’s group suspected that chitin may be involved in shaping tracheal tubes after observing that a chitin synthase mutant forms tracheal branches that look like sausages rather than uniform cylin...

We investigate a new class of congestion games, called Totally Unimodular (TU) Congestion Games, where the players’ strategies are binary vectors inside polyhedra defined by totally unimodular constraint matrices. Network congestion games belong to this class. In the symmetric case, when all players have the same strategy set, we design an algorithm that finds an optimal aggregated strategy and...