Sciweavers

    EJC
    2008
    120views Information Technology» more  EJC 2008»
    Linked partitions and linked cycles
    13 years 11 months ago
    Linked partitions and linked cycles
    Download  www.billchen.org
    The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [...
    William Y. C. Chen, Susan Y. J. Wu, Catherine H. Y...
    claim paper
    Read More »
    EJC
    2008
    86views Information Technology» more  EJC 2008»
    Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
    13 years 11 months ago
    Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
    Download  iti.mff.cuni.cz
    The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
    Jan Foniok, Jaroslav Nesetril, Claude Tardif
    claim paper
    Read More »
    EJC
    2008
    86views Information Technology» more  EJC 2008»
    Genocchi numbers and f-vectors of simplicial balls
    13 years 11 months ago
    Genocchi numbers and f-vectors of simplicial balls
    Download  www.emis.de
    Sven Herrmann
    claim paper
    Read More »
    EJC
    2008
    161views Information Technology» more  EJC 2008»
    Coloring squares of planar graphs with girth six
    13 years 11 months ago
    Coloring squares of planar graphs with girth six
    Download  www.fmf.uni-lj.si
    Wang and Lih conjectured that for every g 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree M(g) is (+1)-colorable. ...
    Zdenek Dvorak, Daniel Král, Pavel Nejedl&ya...
    claim paper
    Read More »
    EJC
    2008
    95views Information Technology» more  EJC 2008»
    The upper bound on k-tuple domination numbers of graphs
    13 years 11 months ago
    The upper bound on k-tuple domination numbers of graphs
    Download  homepage.ntu.edu.tw
    Gerard J. Chang
    claim paper
    Read More »
    EJC
    2008
    88views Information Technology» more  EJC 2008»
    Partitions and Clifford algebras
    13 years 11 months ago
    Partitions and Clifford algebras
    Download  www.loria.fr
    Given the set [n] = {1, . . . , n} for positive integer n, combinatorial properties of Clifford algebras are exploited to count partitions and nonoverlapping partitions of [n]. Th...
    René Schott, G. Stacey Staples
    claim paper
    Read More »
    EJC
    2008
    79views Information Technology» more  EJC 2008»
    On Postnikov's hook length formula for binary trees
    13 years 11 months ago
    On Postnikov's hook length formula for binary trees
    Download  www.math.ualberta.ca
    We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
    William Y. C. Chen, Laura L. M. Yang
    claim paper
    Read More »
    EJC
    2008
    86views Information Technology» more  EJC 2008»
    Fractional chromatic number of distance graphs generated by two-interval sets
    13 years 11 months ago
    Fractional chromatic number of distance graphs generated by two-interval sets
    Download  www.math.nsysu.edu.tw
    Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z, D), has the set Z of all integers as the vertex Supported in part by the National Science ...
    Daphne Der-Fen Liu, Xuding Zhu
    claim paper
    Read More »
    EJC
    2008
    123views Information Technology» more  EJC 2008»
    Deforming Meyer sets
    13 years 11 months ago
    Deforming Meyer sets
    Download  www.math.ualberta.ca
    A linear deformation of a Meyer set M in Rd is the image of M under a group homomorphism of the group [M] generated by M into Rd . We provide a necessary and sufficient condition f...
    Jeong-Yup Lee, Robert V. Moody
    claim paper
    Read More »
    EJC
    2008
    152views Information Technology» more  EJC 2008»
    Expansion properties of a random regular graph after random vertex deletions
    13 years 11 months ago
    Expansion properties of a random regular graph after random vertex deletions
    Download  web.maths.unsw.edu.au
    We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
    Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...
    claim paper
    Read More »
    « first‹ previous…101112131415161718…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.