Talk:Combinatorial species/Archive 1

It would help to know in what areas the term is used. It's linked to from Species - is "combinatorial species" a biological term also? Mathematical? Or both? Tannin

Actually, it didn't occur to me that I had not made that clear by using the word "combinatorial". But now I've made it more explicit. (For now, it's still only a stub article.) -- Mike Hardy

The description of the cycle index series seems slightly ambiguous. Namely, where is the dependence of $\left(\sum _{\sigma \in S_{A}}|\mathrm {Fix} (F[\sigma ])|x_{1}^{\sigma _{1}}x_{2}^{\sigma _{2}}\cdots \right)$ on n? - Gauge 02:15, 10 January 2006 (UTC)

PS. It would be nice to indicate if the theory of combinatorial species has solved some interesting new problems. Thanks. CW 16 February 2006

---

This article refers to diagrams which are not present on the page. —Preceding unsigned comment added by 24.22.98.131 (talk) 07:41, 28 November 2007 (UTC)

Under "Basic Operations" the text refers to graphics which aren't there...? — Preceding unsigned comment added by 141.89.53.115 (talk) 08:25, 12 July 2012 (UTC)

For whatever reason, it was commented out with a completely unrelated edit summary: [1]. Now all images are shown again. --Daniel5Ko (talk) 09:16, 12 July 2012 (UTC)

Note on the differentiation of virtual species

Start with two atomic species,

e.g. let P₅ be the Frobenius group acting on 5 elements (or the field F5), and K₄ the Klein group acting on itself.

P₅ - K₄, as virtual species, is nothing else than the class (P₅ + A, K₄ + same A), where A is any species.

By differentiating, one gets (Cyc₄ + A', X.X.X + same A').

The trouble here is that A' is no more any species, but only those species that are derivatives.

For differentiation to be well defined, one should have Any' = Any. The completion comes by Cancellation property. And this put me "out of bussines"; nothing to differentiate. There are virtual cycle indices that have no x₁ terms.

That is why I am trying to rotate the labels. A (-X) given by a Group ring of variables/labels would allow me to differentiate like in good old times.Nicolae-boicu (talk) 13:56, 4 August 2012 (UTC)

This comment is completely wrong. Differentiation is defined on virtual species as follows; in your example;

P₅ - K₄ is nothing else than the class (P₅ + A, K₄ + same A), where A is any species.

The derivative of (Cyc₄ + A', X.X.X + same A'), which are all examples of (Cyc₄ + A, X.X.X + same A), so it's equal to Cyc₄ − X.X.X . — Arthur Rubin (talk) 02:03, 7 August 2012 (UTC)

Let me verify...

(F + A) - (G + A) ~ F - G ~ (F + B) - (G + B) is clear since A and B are given,

(F'+ A') - (G' + A') ~ F' - G' ~ (F' + B') - (G' + B') is also clear and differentiation is compatible with ~.

This would avoid (F + all species) for the sake of "completion". (Neither the set of al sets is not complete; it does not contain all its elements) Why not ? Good ideea, thanks ! Nicolae-boicu (talk) 14:58, 7 August 2012 (UTC)

Note on the Lin species

The combinatorial species Lin does not necessarily stands for a Linear Order, in the very same way that Ens does not stands for a Boolean Algebra.

A word xyzt has the very same combinatorial structure as { βx, 3y, Az, Πt } where β, 3, A, Π are specific "slots". Nicolae-boicu (talk) 20:21, 4 August 2012 (UTC)

Example of concrete use of a cyc

I have an example of actually using a cyc.

McKay's proof of Cauchy's theorem (1959, AMM) uses a p-tuples of elements of G

( x₁, x₂,....,x_p ) and x₁.x₂......x_p = 1

Well, this is a cyc ! (cyclic order does not matter) as usual, when species are present it turns spectaculary.Nicolae-boicu (talk) 05:54, 5 August 2012 (UTC)

Note on integration

In terms of permutation groups, primitives of molecular species are called transitive extensions. This does not close the issue, since (UV)'= U'V+UV'Nicolae-boicu (talk) 21:44, 5 August 2012 (UTC)

The spectrum of species

Every single sequence in OEIS has a species correspondent. Take a_n.Ens[n] instead of a_n, make the sum for all n and here is the species. Why then a new list ? Who decides that one sequence is more important then other to place it in a sublist ?

There are sequences in OEIS that have simple e.g.f.-s. An exercised eye simply extracts the species just looking to formula. It is some kind a reverse engineering here.

Me, I am waiting for the TBS, the third book on species, the dictionary, that would contain 100 ? 200 ? species. (no book, no article)

1	sets
2	taquins
n	elements
n(n-1)	pairs
Bn	partitions
(n-5)!, (n-4)!	sporadic Mathieu-s
(n-7/2)!	projective planes
(n-3)!	projective lines, Mobius fields
(n-5/2)!	affine planes
(n-2)!	lines, fields (same thing !)
(n-3/2)!	Frobenius', rings
(n-1)!	groups, vectorial spaces with translations
n!	permutations, linear orders
nn	trees
x	in this area e.g.f is no more convergent

Nicolae-boicu (talk) 12:36, 7 August 2012 (UTC)

Applies to almost any power series of enumeration, which is a more basic concept than this one. Even so, I don't think the table adds anything. There are three examples above (sets, permutations, pairs), which seem adequate.

gee Arthur, like always your intervention is encouraging. So I do not have to wait for TBS, but for FBS, the first book on species !Nicolae-boicu (talk) 19:36, 10 August 2012 (UTC)

Note on the transport of structures

Since three basic operations are defined by splitting the set A with n elements like n = (n-1) + 1 (differentiation), n = m₁ + m₂ (product) or n = m₁ + m₂ +...+ m_k (partitional composition) one should understand the transport of structure as a transport of partitional stuctures. Nicolae-boicu (talk) 17:37, 15 August 2012 (UTC)

Note on pointing

Pointing is about introducing coordinates. One cannot do too much math with non-coordinated structures. In a combinatorial set, all elements are 'total' conjugates without any other determination. For example, if |A|=3 and |B|=5, all we can write about A and B inside Species Theory may be expressed as 5 ' ' = 3 (Sym₅ is a two point extension of Sym₃).

To define a (mathematical) function on the (mathematical) set A, first one must point three times A toward •••A, thus obtaining an X.X.X; and then define the function on X.X.X, only after the elements of A got their own identity and they become distinct within respect to any conjugation.

X.X.X...X may be seen as a 'solid' structure, a 'zero-entropy' structure, with no possibility to make confusions between conjugate elements.

In Geometry, the coordination is implicitly introduced when choosing points or quadrangles or whatever. After choosing two points, all other points of an affine line are well determined (modulo the Galois conjugation)(unlike sets, the geometrical structures are efficiently coordinated with less pointing operations; after several pointing operations they became X.X.X...X's). In the corresponding algebraic structures, 0 and 1 are technologically introduced by the very first axioms, and all other numbers become well determined : one element-one sign, without confusions.

The pointing verb, the key to coordination, is 'let it be' (French 'soit'). For example, to totally coordinate the complex field and to eliminate the Galois confusion, one must point the i : let i be such that i.i = 1. Nicolae-boicu (talk) 12:00, 15 January 2013 (UTC)

note on sum and product rules

based on a Wikipedia tabel. I apologize, I still search a scholastic example.

1) US Drone Strike Statistics estimate according to the New America Foundation.

(As of 17 April 2013)

Year	Number of Attacks	Number Killed
		Min.	Max.
2004	1	5	8
2005	3	12	13
2006	2	90	102
2007	4	48	77
2008	36	219	344
2009	54	350	721
2010	122	608	1,028
2011	72	366	599
2012	48	222	349
2013	12	62	73
Total	354	1,982	3,314

Let X be the sort of attacks, Y be the sort of casualties. Each line will be encoded in one species e.g. Line₂₀₀₇(X,Y). On has

Line₂₀₀₄ ( X, Y ) = X × [ Ens₅ ( Y ) + Ens₆ ( Y ) + Ens₇ ( Y ) + Ens₈ ( Y ) ]

Line₂₀₀₅ ( X, Y ) = Ens₃ ( X ) × [ Ens₁₂ ( Y ) + Ens₁₃ ( Y ) ]

...

Line₂₀₁₃ ( X, Y ) = Ens₁₂ ( X ) × [ Ens₆₂ ( Y ) +...+ Ens₇₃ ( Y ) ]

The unknown number between min and max entered the machinery as a sum of possibilities.

The whole table may be encoded in species terms as a product of its lines:

Table ( X, Y ) = Line₂₀₀₄ ( X, Y ) × Line₂₀₀₅ ( X, Y ) ×...× Line₂₀₁₃ ( X, Y ) /Nicolae-boicu (talk) 10:02, 14 July 2013 (UTC)

note on electrical interpretation

Electrical interpretation

By interrupting one of L1 and L2 signals the output COM gets L2 or L1.

Nicolae-boicu (talk) 12:20, 16 February 2014 (UTC)

note on Cuantum Mechanics interpretation

Schrödinger's cat: a cat, a flask of poison, and a radioactive source are placed in a sealed box. If an internal monitor detects radioactivity (i.e. a single atom decaying), the flask is shattered, releasing the poison that kills the cat. The Copenhagen interpretation of quantum mechanics implies that after a while, the cat is simultaneously alive and dead. Yet, when one looks in the box, one sees the cat either alive or dead, not both alive and dead. This poses the question of when exactly quantum superposition ends and reality collapses into one possibility or the other.

Let's take the Schrödinger's cat. Then one has :

( alive and dead )' = dead or alive

the and/or conjunction

the And/or conjunction fits to the combinatorial multisorting. "He will eat cake, pie, and/or brownies" easily becomes cake + pie + brownies, Plate(X+Y+Z) Nicolae-boicu (talk) 09:30, 8 February 2015 (UTC)

the generalized differentiation

In one word, the generalized differentiation means sampling. Let's say that John has 3 chickens and 2 ducks and he wants to remove 2 birds.

${C.C.C.D.D \over 2(C+D)}={C.C.C.D.D \over {2(C)+C.D+2(D)}}$

$={C.C.C.D.D \over {2(C)}}+{C.C.C.D.D \over {C.D}}+{C.C.C.D.D \over {2(D)}}$

$={3 \choose 2}.C.D.D+3.2.C.C.D+{2 \choose 2}.C.C.C$

$=3.C.D.D+6.C.C.D+1.C.C.C$

One may conclude, for example, that the probability for John to remove two birds of different kind is 6/10.

in the above I have noted the differentiation by a ratio line and a set of 3 chickens by 3(C).

Eventually, we have reached in our research the formula of binomial coefficient.

${X.X.....X.X \over \{X,X,...,X\}}={X^{n} \over k(X)}={n \choose k}.X^{n-k}$ Undersum (talk) 00:59, 8 July 2016 (UTC)

External links modified

Hello fellow Wikipedians,

I have just modified 2 external links on Combinatorial species. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

• Added archive https://web.archive.org/web/20040829145322/http://bergeron.math.uqam.ca/Especes_trans.pdf to http://bergeron.math.uqam.ca/Especes_trans.pdf
• Added archive https://web.archive.org/web/20100622164549/http://www.math.tamu.edu/~maguiar/a.pdf to http://www.math.tamu.edu/~maguiar/a.pdf

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 18 January 2022).

• If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
• If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 04:18, 11 August 2017 (UTC)

Note on the "transport of structures"

Introduction

The "transport of structures"is introduced in the very first page of the very first article on species.

An example of transport is given using endofunctions. Let A be a set of three elements. Then there are 27 endofunctions of A, grouped in seven types:

27 = 1 + 2 + 3 + 6 + 6 + 6 + 3

The associated species is:

3.X³ + 2.X·E₂ + C₃ + E₃

and the cycle index for 3-endofunctins is

(27.x₁³ + 9.x₁.x₂ + 6.x₃ )/6

The question

If we look at the above species formula we can read ( in the 2.X·E₂ term) that bijections like:

a	b	c
a	c	b

may be transported in functions like:

a	b	c
a	a	a

because they have the very same subjacent species, namely X·E₂. The question is: What the transport of structures is transporting if the endofunctions are NOT transported ?

The answer

Normally bijections transport cardinality. A chain of bijections A->B->C-> ... ensures that all A, B, C,... have the same cardinality.

If the chain eventually hits back the set A like A->B->C->...->A, the chain of bijections act as a permutation on A. This permutation on A is then copied on every other set B, C, ...

The "transport of structure" transports permutations and nothing else.

Note on generalized differentiation

Suppose we have to investigate claims like the ones in Fano plane article :

• There are 7 lines, and 24 symmetries fixing any line.
• There are 28 triangles, which correspond one-for-one with the 28 bitangents of a quartic (Manivel 2006). For each triangle there are six symmetries fixing it, one for each permutation of the points within the triangle.

There are two ways of doing this; one is to use the generalized differentiation of a Fano species within respect to Ens₃, by applying to Z_Fano the differentiator

${d_{1}.d_{1}.d_{1} \over 6}+d_{1}.d_{2}+d_{3}$ that comes from $Z_{E}ns3(d_{1},2.d_{2},...,i.d_{1},...)$

The result is

${Fano \over {\{X,X,X\}}}={1 \over 24}(a_{1}^{4}+3a_{2}^{2}+6a_{1}^{2}a_{2}+8a_{1}a_{3}+6a_{4})+a_{1}.{1 \over 6}(a_{1}^{3}+3a_{1}a_{2}+2a_{3})=Ens_{4}+X.Ens_{3}$

A faster way is to use directly the cycle index definition. We consider the action of Fano group on 3-sets and we slightly modify the definition by taking the Fano group insted of S_n

${1 \over |Fano|}\sum _{\sigma inFano}fix(\sigma ).a^{\sigma }$ then we evaluate fix(σ) for each type; the result is the very same.

type of σ	fixes 3-sets	total	difference
$a_{1}^{7}$	35	35	$35.a_{1}^{4}$
$a_{1}a_{1}a_{1}a_{2}a_{2}$	1 + 3.2 = 7	21×7	$21.a_{2}^{2}+126.a_{1}^{2}a_{2}$
$a_{1}a_{2}a_{4}$	1	42	$42.a_{4}$
$a_{1}a_{3}a_{3}$	2	56×2	$112.a_{1}a_{3}$
$a_{7}$	-	-	-
		336

Nboyku (talk) 20:49, 31 May 2018 (UTC)