Extending the Coordination of Cognitive and Social Perspectives

Cognitive analyses are typically used to study individuals, whereas social analyses are typically used to study groups. In this article, I make a distinction between what one is looking with?one’s theoretical lens?and what one is looking at?e.g., an individual or a group?. By emphasizing the former, I discuss social analyses of individuals and cognitive analyses of groups, additional analyses that can enhance mathematics education research. I give examples of each and raise questions about the appropriateness of such analyses

Complexity of triangulations of the projective space

It is known that any two triangulations of a compact 3-manifold are related by finite sequences of certain local transformations. We prove here an upper bound for the length of a shortest transformation sequence relating any two triangulations of the 3-dimensional projective space, in terms of the number of tetrahedra.Comment: 10 pages, 3 figures. Revised version, to appear in Top. App

How to make a triangulation of S^3 polytopal

We introduce a numerical isomorphism invariant p(T) for any triangulation T of S^3. Although its definition is purely topological (inspired by the bridge number of knots), p(T) reflects the geometric properties of T. Specifically, if T is polytopal or shellable then p(T) is `small' in the sense that we obtain a linear upper bound for p(T) in the number n=n(T) of tetrahedra of T. Conversely, if p(T) is `small' then T is `almost' polytopal, since we show how to transform T into a polytopal triangulation by O((p(T))^2) local subdivisions. The minimal number of local subdivisions needed to transform T into a polytopal triangulation is at least $\frac{p(T)}{3n}-n-2$. Using our previous results [math.GT/0007032], we obtain a general upper bound for p(T) exponential in n^2. We prove here by explicit constructions that there is no general subexponential upper bound for p(T) in n. Thus, we obtain triangulations that are `very far' from being polytopal. Our results yield a recognition algorithm for S^3 that is conceptually simpler, though somewhat slower, as the famous Rubinstein-Thompson algorithm.Comment: 24 pages, 17 figures. Final versio

Evolutionary comparison between viral lysis rate and latent period

Marine viruses shape the structure of the microbial community. They are, thus, a key determinant of the most important biogeochemical cycles in the planet. Therefore, a correct description of the ecological and evolutionary behavior of these viruses is essential to make reliable predictions about their role in marine ecosystems. The infection cycle, for example, is indistinctly modeled in two very different ways. In one representation, the process is described including explicitly a fixed delay between infection and offspring release. In the other, the offspring are released at exponentially distributed times according to a fixed release rate. By considering obvious quantitative differences pointed out in the past, the latter description is widely used as a simplification of the former. However, it is still unclear how the dichotomy "delay versus rate description" affects long-term predictions of host-virus interaction models. Here, we study the ecological and evolutionary implications of using one or the other approaches, applied to marine microbes. To this end, we use mathematical and eco-evolutionary computational analysis. We show that the rate model exhibits improved competitive abilities from both ecological and evolutionary perspectives in steady environments. However, rate-based descriptions can fail to describe properly long-term microbe-virus interactions. Moreover, additional information about trade-offs between life-history traits is needed in order to choose the most reliable representation for oceanic bacteriophage dynamics. This result affects deeply most of the marine ecosystem models that include viruses, especially when used to answer evolutionary questions.Comment: to appear in J. Theor. Bio