Sciweavers

    COMBINATORICS
    2004
    63views more  COMBINATORICS 2004»
    On the Livingstone-Wagner Theorem
    13 years 4 months ago
    On the Livingstone-Wagner Theorem
    Download  www.emis.de
    Valery B. Mnukhin, Johannes Siemons
    claim paper
    Read More »
    COMBINATORICS
    2004
    99views more  COMBINATORICS 2004»
    A Scaling Result for Explosive Processes
    13 years 4 months ago
    A Scaling Result for Explosive Processes
    Download  www.cs.nyu.edu
    We consider the asymptotic behavior of the following model: balls are sequentially thrown into bins so that the probability that a bin with n balls obtains the next ball is propor...
    Michael Mitzenmacher, Roberto Imbuzeiro Oliveira, ...
    claim paper
    Read More »
    COMBINATORICS
    2004
    108views more  COMBINATORICS 2004»
    On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane
    13 years 4 months ago
    On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane
    Download  www.combinatorics.org
    Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
    Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nak...
    claim paper
    Read More »
    COMBINATORICS
    2004
    94views more  COMBINATORICS 2004»
    Short Cycles in Random Regular Graphs
    13 years 4 months ago
    Short Cycles in Random Regular Graphs
    Download  www.emis.de
    Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
    Brendan D. McKay, Nicholas C. Wormald, Beata Wysoc...
    claim paper
    Read More »
    COMBINATORICS
    2004
    129views more  COMBINATORICS 2004»
    Operations on Well-Covered Graphs and the Roller-Coaster Conjecture
    13 years 4 months ago
    Operations on Well-Covered Graphs and the Roller-Coaster Conjecture
    Download  www.emis.de
    A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
    Philip Matchett
    claim paper
    Read More »
    COMBINATORICS
    2004
    62views more  COMBINATORICS 2004»
    Equilateral Triangles in Finite Metric Spaces
    13 years 4 months ago
    Equilateral Triangles in Finite Metric Spaces
    Download  www.combinatorics.org
    Vania Mascioni
    claim paper
    Read More »
    COMBINATORICS
    2004
    55views more  COMBINATORICS 2004»
    On the Generation and Enumeration of some Classes of Convex Polyominoes
    13 years 4 months ago
    On the Generation and Enumeration of some Classes of Convex Polyominoes
    Download  www.univie.ac.at
    Alberto Del Lungo, Enrica Duchi, Andrea Frosini, S...
    claim paper
    Read More »
    COMBINATORICS
    2004
    96views more  COMBINATORICS 2004»
    Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules
    13 years 4 months ago
    Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules
    Download  www.combinatorics.org
    Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert series of the Garsia-Haiman diagonal harmonics modules. These formulas involve weigh...
    Nicholas A. Loehr, Jeffrey B. Remmel
    claim paper
    Read More »
    COMBINATORICS
    2004
    72views more  COMBINATORICS 2004»
    Ground State Incongruence in 2D Spin Glasses Revisited
    13 years 4 months ago
    Ground State Incongruence in 2D Spin Glasses Revisited
    Download  www.combinatorics.org
    A construction supporting a conjecture that different ground state pairs exist in the 2-dimensional Edwards-Anderson Ising spin glass is presented.
    Martin Loebl
    claim paper
    Read More »
    COMBINATORICS
    2004
    93views more  COMBINATORICS 2004»
    On the Combinatorial Structure of Arrangements of Oriented Pseudocircles
    13 years 4 months ago
    On the Combinatorial Structure of Arrangements of Oriented Pseudocircles
    Download  www.combinatorics.org
    We introduce intersection schemes (a generalization of uniform oriented matroids of rank 3) to describe the combinatorial properties of arrangements of pseudocircles in the plane ...
    Johann Linhart, Ronald Ortner
    claim paper
    Read More »
    « first‹ previous12345678next ›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.