Establishment of hybrid-derived offspring populations in the Ohomopterus ground beetles through unidirectional hybridization

An approach to deduce the mechanism of stabilization of the hybrid-derived populations in the Ohomopterus ground beetles has been made by comparative studies on the phylogenetic trees of the mitochondrial and nuclear DNA. A phylogenetic tree based on the internal transcribed spacer (ITS) of nuclear ribosomal gene roughly reflects the relations of morphological species group, while mitochondrial NADH dehydrogenase subunit 5 (ND5) gene shows a considerable different topology on the tree; there exist several geographically-linked lineages, most of which consist of more than one species. These results suggest that the replacement of mitochondria has occurred widely in the Ohomopterus species. In most cases, hybridization is unidirectional, i.e., the species A (♂) hybridized with another species B (♀) and not vice versa, with accompanied replacement of mitochondria of A by those of B. The results also suggest that partial or complete occupation of the distribution territory by a hybrid-derived morphological species. The morphological appearance of the resultant hybrid-derivatives are recognized as that of the original species A. Emergence of a morphological new species from a hybrid-derived population has been exemplified.     

Level of nodes in increasing trees revisited

Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size n ≥ j. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that n − j is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

直径不超过4的树的割宽

§ 1　IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th…     

The Hopf Property for Subgroups of Hyperbolic Groups

A group is said to be Hopfian if every surjective endomorphism of the group is injective. We show that finitely generated subgroups of torsion-free hyperbolic groups are Hopfian. Our proof generalizes a theorem of Sela (Topology 35 (2) 1999, 301–321).     

Network reinforcement

We give an algorithm for the following problem: given a graph G=(V,E) with edge-weights and a nonnegative integer k, find a minimum cost set of edges that contains k disjoint spanning trees. This also solves the following reinforcement problem: given a network, a number k and a set of candidate edges, each of them with an associated cost, find a minimum cost set of candidate edges to be added to the network so it contains k disjoint spanning trees. The number k is seen as a measure of the invulnerability of a network. Our algorithm has the same asymptotic complexity as |V| applications of the minimum cut algorithm of Goldberg & Tarjan. Received: April, 2004     

The trees for which maximum multiplicity implies the simplicity of other eigenvalues

Among those real symmetric matrices whose graph is a given tree T, the maximum multiplicity is known to be the path cover number of T. An explicit characterization is given for those trees for which whenever the maximum multiplicity is attained, all other multiplicities are 1.     

Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2^w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way.     

Extending the stochastic programming framework for the modeling of several decision makers: pricing and competition in the telecommunication sector

In a previous paper, Gouveia and Magnanti (2003) found diameter-constrained minimal spanning and Steiner tree problems to be more difficult to solve when the tree diameter D is odd. In this paper, we provide an alternate modeling approach that views problems with odd diameters as the superposition of two problems with even diameters. We show how to tighten the resulting formulation to develop a model with a stronger linear programming relaxation. The linear programming gaps for the tightened model are very small, typically less than 0.5–, and are usually one third to one tenth of the gaps of the best previous model described in Gouveia and Magnanti (2003). Moreover, the new model permits us to solve large Euclidean problem instances that are not solvable by prior approaches. Research funded in part by the Research Projects POCTI-ISFL-1-152,POSI/CPS/41459/2001 and POCTI/MAT/139/94 Research funded in part by the Singapore-MITAlliance(SMA)     

The Uniqueness of the Actions of Certain Branch Groups on Rooted Trees

It is proved that in many cases of interest the actions of groups on rooted trees can be recovered from the structure of the groups. The results apply to most of the groups introduced by the first author and to the Gupta–Sidki groups; they are proved in the wider context of branch groups satisfying two natural conditions.