EJC 2007 | Sciweavers

32

EJC
2007

136views Information Technology» more EJC 2007»

Binary codes from rectangular lattice graphs and permutation decoding

13 years 10 months ago

We examine the binary codes obtained from the row span over the ﬁeld 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 »

17

click to vote

EJC
2007

87views Information Technology» more EJC 2007»

Permutation statistics on involutions

13 years 10 months ago

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 »

27

click to vote

EJC
2007

159views Information Technology» more EJC 2007»

Complexity of cutting words on regular tilings

13 years 10 months ago

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 »

12

click to vote

EJC
2007

79views Information Technology» more EJC 2007»

Irrational proofs for three theorems of Stanley

13 years 10 months ago

Download www.math.tamu.edu

Matthias Beck, Frank Sottile

claim paper

Read More »

22

click to vote

EJC
2007

81views Information Technology» more EJC 2007»

On the number of Tverberg partitions in the prime power case

13 years 10 months ago

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 »

29

click to vote

EJC
2006

99views Information Technology» more EJC 2006»

Product representations of polynomials

13 years 10 months ago

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 »

28

click to vote

EJC
2006

92views Information Technology» more EJC 2006»

Matroid tree-width

13 years 10 months ago

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 »

27

click to vote

EJC
2006

86views Information Technology» more EJC 2006»

A construction for non-rank facets of stable set polytopes of webs

13 years 10 months ago

Download www.zib.de

Arnaud Pêcher, Annegret Wagler

claim paper

Read More »

25

click to vote

EJC
2006

104views Information Technology» more EJC 2006»

Perfect matchings in uniform hypergraphs with large minimum degree

13 years 10 months ago

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 »

24

click to vote

EJC
2006

78views Information Technology» more EJC 2006»

On constructive characterizations of (k, l)-sparse graphs

13 years 10 months ago