Sciweavers

    EJC
    2007
    122views Information Technology» more  EJC 2007»
    Deterministic random walks on the integers
    13 years 4 months ago
    Deterministic random walks on the integers
    Download  www.math.sc.edu
    Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
    Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
    claim paper
    Read More »
    EJC
    2007
    81views Information Technology» more  EJC 2007»
    Euler characteristics and chromatic polynomials
    13 years 4 months ago
    Euler characteristics and chromatic polynomials
    Download  homepage.mac.com
    Given a graph we show how to construct a family of manifolds whose Euler characteristics are the values of the chromatic polynomial of the graph at various integers. The manifolds...
    Michael Eastwood, Stephen Huggett
    claim paper
    Read More »
    EJC
    2007
    87views Information Technology» more  EJC 2007»
    An integrality theorem of root systems
    13 years 4 months ago
    An integrality theorem of root systems
    Download  www.math.tifr.res.in
    Let Φ be an irreducible root system and ∆ be a base for Φ; it is well known that any root in Φ is an integral combination of the roots in ∆. In comparison to this fact, we ...
    A. Bhattacharya, G. R. Vijayakumar
    claim paper
    Read More »
    EJC
    2007
    89views Information Technology» more  EJC 2007»
    Labeling planar graphs with a condition at distance two
    13 years 4 months ago
    Labeling planar graphs with a condition at distance two
    Download  www.dmtcs.org
    Peter Bella, Daniel Král, Bojan Mohar, Kata...
    claim paper
    Read More »
    EJC
    2007
    89views Information Technology» more  EJC 2007»
    The structure of 3-connected matroids of path width three
    13 years 4 months ago
    The structure of 3-connected matroids of path width three
    Download  www.math.lsu.edu
    A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . , ek...
    Rhiannon Hall, James G. Oxley, Charles Semple
    claim paper
    Read More »
    EJC
    2007
    88views Information Technology» more  EJC 2007»
    Minimal paths and cycles in set systems
    13 years 4 months ago
    Minimal paths and cycles in set systems
    Download  www.math.uic.edu
    A minimal k-cycle is a family of sets A0, . . . , Ak−1 for which Ai ∩ Aj = ∅ if and only if i = j or i and j are consecutive modulo k. Let fr(n, k) be the maximum size of a ...
    Dhruv Mubayi, Jacques Verstraëte
    claim paper
    Read More »
    EJC
    2007
    95views Information Technology» more  EJC 2007»
    On separating systems
    13 years 4 months ago
    On separating systems
    Download  people.maths.ox.ac.uk
    We sharpen a result of Hansel on separating set systems. We also extend a theorem of Spencer on completely separating systems by proving an analogue of Hansel’s result.
    Béla Bollobás, Alex D. Scott
    claim paper
    Read More »
    EJC
    2007
    87views Information Technology» more  EJC 2007»
    Symmetric functions, generalized blocks, and permutations with restricted cycle structure
    13 years 4 months ago
    Symmetric functions, generalized blocks, and permutations with restricted cycle structure
    Download  www.renyi.hu
    We present various techniques to count proportions of permutations with restricted cycle structure in finite permutation groups. For example, we show how a generalized block theo...
    Attila Maróti
    claim paper
    Read More »
    EJC
    2007
    84views Information Technology» more  EJC 2007»
    The generating rank of the symplectic grassmannians: Hyperbolic and isotropic geometry
    13 years 4 months ago
    The generating rank of the symplectic grassmannians: Hyperbolic and isotropic geometry
    Download  www-math.bgsu.edu
    Rieuwert J. Blok
    claim paper
    Read More »
    EJC
    2007
    103views Information Technology» more  EJC 2007»
    On the number of matchings of a tree
    13 years 4 months ago
    On the number of matchings of a tree
    Download  finanz.math.tu-graz.ac.at
    In a paper of Klazar, several counting examples for rooted plane trees were given, including matchings and maximal matchings. Apart from asymptotical analysis, it was shown how to...
    Stephan G. Wagner
    claim paper
    Read More »
    « first‹ previous123456789…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.