2 problems

The exponential lower-bound conjecture for prime 2-ball passing patterns
For a fixed integer $k\geq 1$ , let $P'(2,n,k)$ denote the number of prime 2-ball, $k$ -hand passing patterns of length $n$ . As $n$ tends to infinity, Exponential lower-bound conject…
openasymptotic-enumeration enumerative-combinatorics juggling-patterns
1 response
112
The generating-function conjecture for capacity-two multiplex juggling cards
Generating-function conjecture.
openenumerative-combinatorics generating-functions juggling-patterns
0 responses
04