[No answers from stackexchange](https://math.stackexchange.com/questions/846395/combinatorics-and-symmetric-functions), so I'll try this here:


(The actual questions in this posting are at the bottom.)


Occasionally someone asks on stackexchange how to show that every nonempty finite set has just as many subsets of odd cardinality as of even cardinality (the empty set is the unique exception). When the set has an odd number of members, a correspondence between complements does it, but generally, one picks a distinguished element. Every set containing the distinguished element corresponds to one not containing it, and that's the bijection.


Now let's take it a step further and say one adds a new element to the set, which will be "distinguished" until the next new one gets added.


$$
\begin{array}{c|c}
\text{odd} & \text{even} \\
\hline
a & \text{---} \\
b & ab \\
c & ac \\
abc & bc
\end{array}
$$
Now add the new element $d$:
$$
\begin{array}{c|c}
\text{odd} & \text{even} \\
\hline
a & \text{---} \\
b & ab \\
c & ac \\
abc &bc \\
\hline
d & ad \\
abd & bd \\
acd& cd \\
bcd& abcd
\end{array}
$$
Those listed on the odd side get re-listed on the even side and vice-versa, and the new element is added to both.


Suppose that as above we let multiplication denoted by juxtaposition represent a set of ur-elements, and addition represent a set of sets, so the first table above has $a+b+c+abc$ as its left column and $1+ab+ac+ad$ as its second column, the $1$ being the product of members of the empty set. If, further, we represent the whole table as a fraction with the odd column as the numerator and the even column as the denominator, then the operation of adding the new element is this:
$$
\frac{\frac{a+b+c+abc}{1+ab+ac+bc}+d}{1+\frac{a+b+c+abc}{1+ab+ac+bc}d}
= \frac{a+b+c+d+abc+abd+acd+bcd}{1+ab+ac+ad+bc+bd+cd+abcd}.
$$
So we're working with a binary operation: $a\,\diamondsuit\, b=\dfrac{a+b}{1+ab}$. When the set we start with is empty, the the numerator is the sum of $0$ terms and is $0$ and the denominator is the product of $0$ terms and $\text{is }1$. (And of course $\tanh(x+y)=(\tanh x)\,\diamondsuit\,(\tanh y)$, and there's also an application to something more like ordinary trigonometric functions.)


**QUESTIONS:**


* Does this algebraic way of looking at this shed light on the combinatorics, or vice-versa?
* What is the combinatorial meaning of the fact that the binary operation is associative?
* I tried this with the even terms in the numerator and odd in the denominator: $a\,\spadesuit\, b$. We get $(a\,\spadesuit\,b)\,\spadesuit\,c =a\,\diamondsuit\,b\,\diamondsuit\,c$; and $(a\_1\,\diamondsuit\,\cdots\,\diamondsuit\,a\_n)\,\spadesuit\, a\_{n+1} = 1/(a\_1\,\diamondsuit\,\cdots\,\diamondsuit\,a\_{n+1})$ --- So if you apply the $\spadesuit$ operation instead of $\diamondsuit$ each time a new element is added, then you *alternate* between odd-in-the-numerator-and-even-in-the-denominator and even-in-the-numerator-and-odd-in-the-denominator. Does the alternation have some combinatorial significance?



Combinatorics and symmetric functions
The algebraic significance of the operation $\diamond$ is that $(a+b)/(1+ab)$ is a formal group law. See *Enumerative Combinatorics*, vol. 1, 2nd ed., Exercise 1.163. As for $a\_1\diamond\cdots\diamond a\_n$, when $n\to \infty$ we get the symmetric function $(e\_1+e\_3+e\_5+\cdots)/(1+e\_2+e\_4+\cdots)$. Writing this as a power series $e\_1+(e\_3-e\_2e\_1)+\cdots$, the terms of even degree are 0, and the term of degree $2n+1$ is (up to sign) the skew Schur function $s\_{\tau\_n}$, where $\tau\_n$ is the "staircase border strip" of *Enumerative Combinatorics*, vol. 2, Exercise 7.64. There is a lot of interesting combinatorics, started by Foulkes, connected with this symmetric function. See also <http://math.mit.edu/~rstan/papers/altenum.pdf>.


