Sciweavers

    EJC
    2007
    136views Information Technology» more  EJC 2007»
    Binary codes from rectangular lattice graphs and permutation decoding
    13 years 11 months ago
    Binary codes from rectangular lattice graphs and permutation decoding
    Download  www.ces.clemson.edu
    We examine the binary codes obtained from the row span over the field F2 of an adjacency matrix of the rectangular lattice graphs L2(m, n) for 3 ≤ m < n and show that permut...
    Jennifer D. Key, P. Seneviratne
    claim paper
    Read More »
    EJC
    2007
    87views Information Technology» more  EJC 2007»
    Permutation statistics on involutions
    13 years 11 months ago
    Permutation statistics on involutions
    Download  www.combinatorics.org
    We consider in this work the enumeration of involutions by descent sets, and based on that, by descent numbers. Formulas of the number of involutions with a prescribed descent set...
    W. M. B. Dukes
    claim paper
    Read More »
    EJC
    2007
    159views Information Technology» more  EJC 2007»
    Complexity of cutting words on regular tilings
    13 years 11 months ago
    Complexity of cutting words on regular tilings
    Download  www.cmi.univ-mrs.fr
    : We show that the complexity of a cutting word u in a regular tiling by a polyomino Q is equal to Pn(u) = (p+q−1)n+1 for all n ≥ 0, where Pn(u) counts the number of distinct f...
    Pascal Hubert, Laurent Vuillon
    claim paper
    Read More »
    EJC
    2007
    79views Information Technology» more  EJC 2007»
    Irrational proofs for three theorems of Stanley
    13 years 11 months ago
    Irrational proofs for three theorems of Stanley
    Download  www.math.tamu.edu
    Matthias Beck, Frank Sottile
    claim paper
    Read More »
    EJC
    2007
    81views Information Technology» more  EJC 2007»
    On the number of Tverberg partitions in the prime power case
    13 years 11 months ago
    On the number of Tverberg partitions in the prime power case
    Download  www.math.tu-berlin.de
    We give an extension of the lower bound of [9] for the number of Tverberg partitions from the prime to the prime power case. Our proof is inspired by the Zp-index version of the p...
    Stephan Hell
    claim paper
    Read More »
    EJC
    2006
    99views Information Technology» more  EJC 2006»
    Product representations of polynomials
    13 years 11 months ago
    Product representations of polynomials
    Download  www.math.ucsd.edu
    For a fixed polyomial f Z[X], let k(N) denote the maximum size of a set A {1, 2, . . . , N} such that no product of k distinct elements of A is in the value set of f. In this pap...
    Jacques Verstraëte
    claim paper
    Read More »
    EJC
    2006
    92views Information Technology» more  EJC 2006»
    Matroid tree-width
    13 years 11 months ago
    Matroid tree-width
    Download  www.fi.muni.cz
    Abstract. We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended to matroids. (This...
    Petr Hlinený, Geoff Whittle
    claim paper
    Read More »
    EJC
    2006
    86views Information Technology» more  EJC 2006»
    A construction for non-rank facets of stable set polytopes of webs
    13 years 11 months ago
    A construction for non-rank facets of stable set polytopes of webs
    Download  www.zib.de
    Arnaud Pêcher, Annegret Wagler
    claim paper
    Read More »
    EJC
    2006
    104views Information Technology» more  EJC 2006»
    Perfect matchings in uniform hypergraphs with large minimum degree
    13 years 11 months ago
    Perfect matchings in uniform hypergraphs with large minimum degree
    Download  main2.amu.edu.pl
    A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a p...
    Vojtech Rödl, Andrzej Rucinski, Endre Szemer&...
    claim paper
    Read More »
    EJC
    2006
    78views Information Technology» more  EJC 2006»
    On constructive characterizations of (k, l)-sparse graphs
    13 years 11 months ago
    On constructive characterizations of (k, l)-sparse graphs
    Download  www.cs.elte.hu
    László Szegö
    claim paper
    Read More »
    « first‹ previous…34567891011…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.