Dowry in the absence of the legal protection of women’s inheritance rights

Review of Economics of the Household - The practice of dowry is often thought to be the root cause of the unequal treatment of girls in India, as represented by sex-selective abortion and female...     

Dispersion distance of queens from natal sites in the two haplometrotic paper waspsPolistes riparius andP. snelleni (Hymenoptera: Vespidae)

Summary Dispersion capabilities of new queens were studied in the two haplometrotic paper waspsPolistes riparius andP. snelleni. New queens were marked on the nests in the late summer and located in the next spring. Dispersion distances greatly varied among queens: although a large part of recovered queens nested in close proximity to their natal sites, some did disperse over 100–300 m. This suggests that queens' emigration from and immigration into the censused areas occurred to a substantial extent. On the whole, these species exhibited a weaker “philopatric” tendency than those so far studied for dispersion distance, and seem to have the potential for a long-distance dispersion.     

Japanese Fathers of Preschoolers and Their Involvement in Child Care

We examine how relative resources, time availability, gender ideology, living arrangement, child‐care demand, and job satisfaction are associated with the levels of younger Japanese fathers’ involvement in child care for preschoolers. A theoretical model that includes these factors is tested using 1994 data collected from Japanese fathers and mothers with preschool children (N = 442 couples). We find that practical considerations such as fathers’ shorter work hours, mothers’ full‐time employment, fewer adults and more children in households, and younger ages of children are associated with higher levels of paternal involvement. Implications of these findings are discussed in light of attention to ways to encourage Japanese men's sharing of child‐care responsibilities with their wives.     

On the readability of monotone Boolean formulae

Golumbic et al. (Discrete Appl. Math. 154:1465–1477, 2006) defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ∧−∨-formula equivalent to f in which each variable appears at most k times. They asked whether there exists a polynomial-time algorithm, which given a monotone Boolean function f, in CNF or DNF form, checks whether f is a read-k function, for a fixed k. In this paper, we partially answer this question already for k=2 by showing that it is NP-hard to decide if a given monotone formula represents a read-twice function. It follows also from our reduction that it is NP-hard to approximate the readability of a given monotone Boolean function f:{0,1} ⁿ →{0,1} within a factor of O(n)\mathcal{O}(n) . We also give tight sublinear upper bounds on the readability of a monotone Boolean function given in CNF (or DNF) form, parameterized by the number of terms in the CNF and the maximum size in each term, or more generally the maximum number of variables in the intersection of any constant number of terms. When the variables of the DNF can be ordered so that each term consists of a set of consecutive variables, we give much tighter logarithmic bounds on the readability.