JCT
2011
12 years 11 months ago
2011
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...
JCT
2011
12 years 11 months ago
2011
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...
JCT
2011
12 years 11 months ago
2011
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...
JCT
2011
12 years 11 months ago
2011
JCT
2011
12 years 11 months ago
2011
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...
JCT
2011
12 years 11 months ago
2011
JCT
2011
12 years 11 months ago
2011
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...
JCT
2011
12 years 11 months ago
2011
JCT
2011
12 years 11 months ago
2011
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.
JCT
2011
12 years 11 months ago
2011
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...