Sciweavers

40 search results - page 3 / 8
» A Note on the Road-Coloring Conjecture
Sort
View
SIGACT
2002
61views more  SIGACT 2002»
13 years 5 months ago
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all ...
Seth Gilbert, Nancy A. Lynch
EJC
2010
13 years 4 months ago
A proof of Bressoud's conjecture related to the Rogers-Ramanujan identities
The Rogers-Ramanujan Identities have many natural and significant generalizations. The generalization presented in this note was first studied by D. Bressoud, by considering the...
Shishuo Fu
COMBINATORICS
1999
75views more  COMBINATORICS 1999»
13 years 5 months ago
On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern
Abstract. Consider, for a permutation Sk, the number F(n, ) of permutations in Sn which avoid as a subpattern. The conjecture of Stanley and Wilf is that for every there is a c...
Richard Arratia
DCC
2004
IEEE
14 years 5 months ago
Some Indecomposable t-Designs
The existence of large sets of 5-(14,6,3) designs is in doubt. There are five simple 5-(14,6,6) designs known in the literature. In this note, by the use of a computer program, we...
Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
DM
2006
68views more  DM 2006»
13 years 5 months ago
A note on maximally repeated sub-patterns of a point set
We answer a question raised by Brass on the number of maximally repeated sub-patterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial,...
Véronique Cortier, Xavier Goaoc, Mira Lee, ...