Riffs & Rotes & A061396
Jon Awbrey
jawbrey at oakland.edu
Sun Jun 24 18:56:28 CEST 2001
¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤
Neil,
I will work on getting you a more organized version
of that "initial illustrations" file. It might be
nice to have the basic pictures up through order 5.
Appended is the current draft of the tables, slightly
better ordered, but give me a few days to tackle that
gang of 73.
Also, I eventually worked out better descriptions
of these combinatorial species, as I worked my way
through the 20-step algorithm for the asymptotics,
and after I learned a bit of formal language theory,
defining them by way of a formal grammar, and also,
I think, after I went to Chambana and took a couple
of courses from John Gray on applying category theory
to lambda and logical calculi, I got a domain equation
type description. But all this is several years in the
future from where I am in my notes right now, and I will
not trust my current impressions until I get to those files.
Just roughly, as best as I can recall, we can think of a space --
I used to call it "Script N", so let's write it here as "$N$" --
that has an ordering on it, I think it was "pre-order" or "poset",
but let's just call it TBD for now. Define the notation "[X -> Y]"
to designate the space of "finite partial functions" from X to Y.
Then we have, I believe, the domain equation $N$ = [$N$ -> $N$],
that is to say, every element of Script N can be analyzed, treated,
or viewed as a finite partial function from Script N to Script N,
just in the way that every natural number n in N, except maybe for
some funny business at the boundary 1, has a primes factorization
that can be read as a finite-domain function from its indices to
its corresponding exponents. Okay, I should not even be speaking
off the cuff this way, but I wanted to give you a better sense of
where I think I might be going with this.
Many Regards,
Jon Awbrey
¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤
Tables for Reference:
o--------------------------------------------------------------------------------
| integer factorization riff r.i.f.f. rote --> in parentheses
| k p's k nodes 2k+1 nodes
o--------------------------------------------------------------------------------
|
| 1 1 blank blank @ blank
|
o--------------------------------------------------------------------------------
|
| o---o
| |
| 2 p_1^1 p @ @ (())
|
o--------------------------------------------------------------------------------
|
| o---o
| |
| o---o
| 3 p_2^1 = |
| p_(p_1)^1 p_p @ @ ((())())
| ^
| \
| o
|
| o---o
| o |
| ^ o---o
| 4 p_1^2 = / |
| p_1^p_1 p^p @ @ (((())))
|
o--------------------------------------------------------------------------------
|
| o---o
| |
| o---o
| |
| 5 p_3 = o---o
| p_(p_2) = |
| p_(p_(p_1)) p_p_p @ @ (((())())())
| ^
| \
| o
| ^
| \
| o
|
| o-o
| /
| o-o o-o
| 6 p_1 p_2 = \ /
| p_1 p_(p_1) p p_p @ @ @ (())((())())
| ^
| \
| o
|
| o---o
| |
| o---o
| |
| 7 p_4 = o---o
| p_(p_1^2) = |
| p_(p_1^p_1) p< @ o @ ((((())))())
| p^p ^ ^
| \ /
| o
|
| o---o
| |
| o---o
| o |
| 8 p_1^3 = ^ ^ o---o
| p_1^p_2 = p_p / \ |
| p_1^p_(p_1) p< @ o @ ((((())())))
|
| o-o o-o
| o | |
| 9 p_2^2 = ^ o---o
| p_(p_1)^2 = p / |
| p_(p_1)^(p_1) p< @ @ ((())((())))
| p ^
| \
| o
|
| o o---o
| ^ |
| / o---o
| o |
| 16 p_1^4 = p ^ o---o
| p_1^(p_1^2) = p< / |
| p_1^(p_1^p_1) p< @ @ (((((())))))
|
o--------------------------------------------------------------------------------
o================================================================================
|
| p
| p< p p_p p
| p< p<_p p< p_p< p p_p p_p_p
| p< p< p< p< p< p<
|
| 2^16 2^9 2^8 2^7 2^6 2^5
| 65536 512 256 128 64 32
|
o--------------------------------------------------------------------------------
|
| p
| p< p p_p p
| p_p< p_p<_p p_p< p_p_p< p< p_p_p_p
| p p_p
|
| p_16 p_9 p_8 p_7 p_6 p_5
| 53 23 19 17 13 11
|
o--------------------------------------------------------------------------------
|
| p^p p_p p p
| p< p< p< p<
| p p p^p p_p
|
| 3^4 3^3 7^2 5^2
| 81 27 49 25
|
o--------------------------------------------------------------------------------
|
| p
| p p< p p< p^p p_p p p_p_p
| p p^p
|
| 18 14 12 10
|
o================================================================================
Triangle in which k-th row lists natural number
values for the collection of riffs with k nodes.
k | natural numbers n such that |riff(n)| = k
--o------------------------------------------------
0 | 1;
1 | 2;
2 | 3, 4;
3 | 5, 6, 7, 8, 9, 16;
4 | 10, 11, 12, 13, 14, 17, 18, 19, 23, 25, 27,
| 32, 49, 53, 64, 81, 128, 256, 512, 65536;
The natural number values for the riffs with
at most 3 pts are as follows (@'s are roots):
| o o o o
| | ^ | ^
| v | v |
| o o o o o o o o o
| | ^ | | | ^ | ^ ^
| v | v v v | v/ |
| Riff: @; @, @; @, @ @, @, @, @, @;
|
| Value: 2; 3, 4; 5, 6 , 7, 8, 9, 16;
---------------------------------------------------
1, 2, 3, 4, 5, 6, 7, 8, 9, 16,
10, 11, 12, 13, 14, 17, 18, 19,
23, 25, 27, 32, 49, 53, 64, 81,
128, 256, 512, 65536,
---------------------------------------------------
1; 2; 3, 4; 5, 6, 7, 8, 9, 16;
10, 11, 12, 13, 14, 17, 18, 19,
23, 25, 27, 32, 49, 53, 64, 81,
128, 256, 512, 65536;
---------------------------------------------------
More information about the SeqFan
mailing list