4,716 research outputs found

    Simultaneous Representation of Proper and Unit Interval Graphs

    Get PDF
    In a confluence of combinatorics and geometry, simultaneous representations provide a way to realize combinatorial objects that share common structure. A standard case in the study of simultaneous representations is the sunflower case where all objects share the same common structure. While the recognition problem for general simultaneous interval graphs - the simultaneous version of arguably one of the most well-studied graph classes - is NP-complete, the complexity of the sunflower case for three or more simultaneous interval graphs is currently open. In this work we settle this question for proper interval graphs. We give an algorithm to recognize simultaneous proper interval graphs in linear time in the sunflower case where we allow any number of simultaneous graphs. Simultaneous unit interval graphs are much more "rigid" and therefore have less freedom in their representation. We show they can be recognized in time O(|V|*|E|) for any number of simultaneous graphs in the sunflower case where G=(V,E) is the union of the simultaneous graphs. We further show that both recognition problems are in general NP-complete if the number of simultaneous graphs is not fixed. The restriction to the sunflower case is in this sense necessary

    Statistics of self-avoiding walks on randomly diluted lattice

    Full text link
    A comprehensive numerical study of self-avoiding walks (SAW's) on randomly diluted lattices in two and three dimensions is carried out. The critical exponents ν\nu and χ\chi are calculated for various different occupation probabilities, disorder configuration ensembles, and walk weighting schemes. These results are analyzed and compared with those previously available. Various subtleties in the calculation and definition of these exponents are discussed. Precise numerical values are given for these exponents in most cases, and many new properties are recognized for them.Comment: 34 pages (+ 12 figures), REVTEX 3.

    Elaborating Inductive Definitions

    Full text link
    We present an elaboration of inductive definitions down to a universe of datatypes. The universe of datatypes is an internal presentation of strictly positive families within type theory. By elaborating an inductive definition -- a syntactic artifact -- to its code -- its semantics -- we obtain an internalized account of inductives inside the type theory itself: we claim that reasoning about inductive definitions could be carried in the type theory, not in the meta-theory as it is usually the case. Besides, we give a formal specification of that elaboration process. It is therefore amenable to formal reasoning too. We prove the soundness of our translation and hint at its correctness with respect to Coq's Inductive definitions. The practical benefits of this approach are numerous. For the type theorist, this is a small step toward bootstrapping, ie. implementing the inductive fragment in the type theory itself. For the programmer, this means better support for generic programming: we shall present a lightweight deriving mechanism, entirely definable by the programmer and therefore not requiring any extension to the type theory.Comment: 32 pages, technical repor

    The Pfaffian solution of a dimer-monomer problem: Single monomer on the boundary

    Full text link
    We consider the dimer-monomer problem for the rectangular lattice. By mapping the problem into one of close-packed dimers on an extended lattice, we rederive the Tzeng-Wu solution for a single monomer on the boundary by evaluating a Pfaffian. We also clarify the mathematical content of the Tzeng-Wu solution by identifying it as the product of the nonzero eigenvalues of the Kasteleyn matrix.Comment: 4 Pages to appear in the Physical Review E (2006

    Pseudorandom Number Generators and the Square Site Percolation Threshold

    Full text link
    A select collection of pseudorandom number generators is applied to a Monte Carlo study of the two dimensional square site percolation model. A generator suitable for high precision calculations is identified from an application specific test of randomness. After extended computation and analysis, an ostensibly reliable value of pc = 0.59274598(4) is obtained for the percolation threshold.Comment: 11 pages, 6 figure

    Is the Melting Pot Still Hot? Explaining the Resurgence of Immigrant Segregation

    Get PDF
    This paper uses decennial Census data to examine trends in immigrant segregation in the United States between 1910 and 2000. Immigrant segregation declined in the first half of the century, but has been rising steadily over the past three decades. Analysis of restricted access 1990 Census microdata suggests that this rise would be even more striking if the native-born children of immigrants could be consistently excluded from the analysis. We analyze panel and cross-sectional variation in immigrant segregation, as well as housing price patterns across metropolitan areas, to test four hypotheses of immigrant segregation. Immigration itself has surged in recent decades, but the tendency for newly arrived immigrants to be younger and of lower socioeconomic status explains very little of the recent rise in immigrant segregation. We also find little evidence of increased nativism in the housing market. Evidence instead points to changes in urban form, manifested in particular as native-driven suburbanization and the decline of public transit as a transportation mode, as a central explanation for the new immigrant segregation.

    Coalescent histories for lodgepole species trees

    Full text link
    Coalescent histories are combinatorial structures that describe for a given gene tree and species tree the possible lists of branches of the species tree on which the gene tree coalescences take place. Properties of the number of coalescent histories for gene trees and species trees affect a variety of probabilistic calculations in mathematical phylogenetics. Exact and asymptotic evaluations of the number of coalescent histories, however, are known only in a limited number of cases. Here we introduce a particular family of species trees, the \emph{lodgepole} species trees (λn)n0(\lambda_n)_{n\geq 0}, in which tree λn\lambda_n has m=2n+1m=2n+1 taxa. We determine the number of coalescent histories for the lodgepole species trees, in the case that the gene tree matches the species tree, showing that this number grows with m!!m!! in the number of taxa mm. This computation demonstrates the existence of tree families in which the growth in the number of coalescent histories is faster than exponential. Further, it provides a substantial improvement on the lower bound for the ratio of the largest number of matching coalescent histories to the smallest number of matching coalescent histories for trees with mm taxa, increasing a previous bound of (π/32)[(5m12)/(4m6)]mm(\sqrt{\pi} / 32)[(5m-12)/(4m-6)] m \sqrt{m} to [m1/(4e)]m[ \sqrt{m-1}/(4 \sqrt{e}) ]^{m}. We discuss the implications of our enumerative results for phylogenetic computations
    corecore