Sciweavers

Share
JCT
2011
106views more  JCT 2011»
9 years 4 months ago
Bounds for separating hash families
This paper aims to present a new upper bound on the size of separating hash families. This bound improves previously known bounds for separating hash families of general type. Key...
Marjan Bazrafshan, Tran van Trung
JCT
2011
74views more  JCT 2011»
9 years 4 months ago
Basis theorems for continuous n-colorings
This article is devoted to the study of continuous colorings of the n-element subsets of a Polish space. The homogeneity number hm(c) of an n-coloring c : [X]n → 2 is the least s...
Stefanie Frick, Stefan Geschke
JCT
2011
56views more  JCT 2011»
9 years 4 months ago
On the structure of 3-nets embedded in a projective plane
We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three clas...
Aart Blokhuis, Gábor Korchmáros, Fra...
JCT
2011
62views more  JCT 2011»
9 years 4 months ago
Anti-lecture hall compositions and overpartitions
We show that the number of anti-lecture hall compositions of n with the first entry not exceeding k − 2 equals the number of overpartitions of n with non-overlined parts not con...
William Y. C. Chen, Doris D. M. Sang, Diane Y. H. ...
JCT
2011
85views more  JCT 2011»
9 years 4 months ago
Relatively prime polynomials and nonsingular Hankel matrices over finite fields
Mario García-Armas, Sudhir R. Ghorpade, Sam...
JCT
2011
100views more  JCT 2011»
9 years 4 months ago
On polynomial integrals over the orthogonal group
We consider integrals of type On ua1 11 . . . uan 1nub1 21 . . . ubn 2n du, with respect to the Haar measure on the orthogonal group. We establish several remarkable invariance pro...
Teodor Banica, Benoit Collins, Jean-Marc Schlenker
JCT
2011
60views more  JCT 2011»
9 years 4 months ago
A well-quasi-order for tournaments
Maria Chudnovsky, Paul D. Seymour
JCT
2011
56views more  JCT 2011»
9 years 4 months ago
Twins of rayless graphs
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
Anthony Bonato, Henning Bruhn, Reinhard Diestel, P...
JCT
2011
78views more  JCT 2011»
9 years 4 months ago
The Max-Flow Min-Cut theorem for countable networks
We prove a strong version of the the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to e...
Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Am...
books