Skip to main content
Russ Woodroofe's user avatar
Russ Woodroofe's user avatar
Russ Woodroofe's user avatar
Russ Woodroofe
  • Member for 13 years
  • Last seen this week
comment
Factor subsets of a finite group
A mildly useful keyword might be Zappa-Szép product -- this is the case where $A$ and $B$ are both taken to be subgroups. See Wikipedia: en.wikipedia.org/wiki/Zappa–Szép_product (MathOverflow breaks the link at the -, so copy and paste into your browser unless you're interested in Frank, rather than Guido, Zappa.)
comment
awarded
revised
A group-theoretic perspective on Frankl's union closed problem
Greatly expanded answer to cover "most" finite groups.
Loading…
revised
A group-theoretic perspective on Frankl's union closed problem
Was missing the important word "normal" in the remark at near the end.
Loading…
revised
A group-theoretic perspective on Frankl's union closed problem
Improved argument to cover all finite solvable groups; deleted now-irrelevant discussion of supersolvable complements.
Loading…
Loading…
answered
Loading…
comment
Cohen-Macaulay versus shellable simplicial complexes
If $S_V$ acts transitively on $\Delta$, then I suppose $\Delta$ is some skeleton of a simplex, hence shellable. But that's almost surely not what you have in mind.
awarded
comment
Mobius function of consecutive numbers
I'll comment that for the special case of the identity polynomial, this is the Mertens function. See en.wikipedia.org/wiki/Mertens_function .
comment
Why do wedges of spheres often appear in combinatorics?
Indeed, one could view algebraic shifting as saying that any simplicial complex can be slightly perturbed (for a particular algebraic, complicated notion of 'perturbed') to become a bouquet of spheres.
comment
How many ways can a given permutation be obtained as a product of k 2-cycles?
The number of ways of decomposing an n-cycle into n-1 transpositions is the same as the number of spanning trees of a complete graph on n vertices. Indeed, given a such a decomposition of an n-cycle, one can build a spanning tree by putting an edge {i,j} iff the transposition (i,j) is present. (Verifying that this correspondence is invertible seems to take a little more work.)
comment
Simplicial chain complex with ordered simplices
Indeed, the positive answer is strongly hinted at by the fact that degenerate mappings are allowed in the definition of singular homology. (Hatcher even says that the name "singular" came about because singularities are allowed in the mapping.)
awarded
comment
Counting graphs up to isomorphism
Have you tried OEIS? It is the usual first place to look for sequences like this.
comment
Overlapping sets
Ah! I missed that F_x was a count, rather than itself a set. Thanks.
comment
Overlapping sets
What does 2F'_x mean? It looks like maybe you're assuming some kind of structure on I?
comment
Morse matching with 0-cells and (n-1)-cells
From what I can see, Kozlov defines an acyclic matching on a poset (which he calls a discrete Morse matching by analogy with later interest) and gives some structure theorems about such matchings. You don't get any of the nice homotopy theory consequences -- indeed, he seems to save any discussion of consequences for 11.2, where he links with topology of CW-complexes. So yes, technically, he calls something discrete Morse theory for posets; but it's interesting mainly/only for face lattices.
1
8 9
10
11 12
14