A Combinatorial Proof for Stockhausen's Problem

DOI10.1137/S0895480195288741MaRDI QIDQ4377441zbMATH OpenFDO

Authors Lily Yen

Publication date 9 February 1998

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480195288741

zbMATH Keywords

bijectionsGray codessequencessign-reversing involutionStockhausen

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19)

Recommendations

• A combinatorical proof of Kneser's conjecture
• A combinatorial proof of Louck's conjecture
• A combinatorial proof of a theorem of Freund
• A Combinatorial Generalization of a Putnam Problem
• A combinatorial proof of a result of Gessel and Greene
• A combinatorial proof of Rohlin theorem
• A combinatorial proof of a theorem of Katsuura
• scientific article; zbMATH DE number 3995753
• scientific article; zbMATH DE number 2124081
• A combinatorial proof of Frobenius theorem

Cited in

(4)

• Combinatorial problems in the theory of music
• A symmetric functions approach to Stockhausen's problem
• A note on the Stockhausen problem
• A solution of the Steinhaus's combinatorial problem

This page was built for publication: A Combinatorial Proof for Stockhausen's Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377441)