Sciweavers

86 search results - page 3 / 18
» Combinatorics of generalized q-Euler numbers
Sort
View
MFCS
2004
Springer
13 years 11 months ago
A Generalization of Repetition Threshold
Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number α such that there exists an infinite word over a k-letter alphabet t...
Lucian Ilie, Pascal Ochem, Jeffrey Shallit
COMBINATORICS
1999
85views more  COMBINATORICS 1999»
13 years 5 months ago
Permutation Patterns and Continued Fractions
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to ext...
Aaron Robertson, Herbert S. Wilf, Doron Zeilberger
COMBINATORICS
2004
121views more  COMBINATORICS 2004»
13 years 5 months ago
Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number o...
Peter Danziger, Brett Stevens
COMPGEOM
2004
ACM
13 years 11 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...
COMBINATORICS
1999
83views more  COMBINATORICS 1999»
13 years 5 months ago
New Lower Bounds for Some Multicolored Ramsey Numbers
In this article we use two different methods to find new lower bounds for some multicolored Ramsey numbers. In the first part we use the finite field method used by Greenwood and ...
Aaron Robertson