A note on the Hopf-Stiefel function
The Hopf-Stiefel function \(\circ\), introduced by \textit{H. Hopf} [Comment. Math. Helv. 13, 219--239 (1940/1941; Zbl 0024.36002) and JFM 67.0737.03] and \textit{E. Stiefel} [Comment. Math. Helv. 13, 201--218 (1940/41; Zbl 0024.36001) and JFM 67.0737.02] is defined on variables \(r,s\in\mathbb N\) by \[ r\circ s= \min\Biggl\{T\in \mathbb N\;\bigg|\;\binom{T}{j}\equiv 0\pmod 2\text{ for every }T- s< j< r\Biggr\}. \] It is given a new short elementary proof of the following theorem: \[ r\circ s= \min_{k\in\mathbb N}\, (\lfloor r/2^k\rfloor+ \lfloor s/2^k\rfloor- 1)2^k. \] (See also \textit{A. Plagne}, Enseign. Math. (2) 49, No. 1--2, 109--116 (2003; Zbl 1040.11023); \textit{S.~Eliahou} and \textit{M. Kervaire}, Expo. Math. 23, No. 2, 127--145 (2005; Zbl 1136.11015).)
- Old and new formulas for the Hopf-Stiefel and related functions
- Additive number theory sheds extra light on the Hopf-Stiefel \(\circ\) function.
- Some new results on composition of quadratic forms
- The Hopf condition for bilinear forms over arbitrary fields
- On lower bounds on the size of sums-of-squares formulas
- Optimal strong parity edge-coloring of complete graphs
- Additive number theory sheds extra light on the Hopf-Stiefel \(\circ\) function.
- A step towards Yuzvinsky's conjecture
- Parity and strong parity edge-colorings of graphs
- On the minimum size of restricted sumsets in cyclic groups
- Old and new formulas for the Hopf-Stiefel and related functions
- scientific article; zbMATH DE number 5779174 (Why is no real title available?)
- The minimum size of signed sumsets
- A note on the Formanek Weingarten function
- Strong parity edge-colorings of graphs
- On the minimum size of signed sumsets in elementary abelian groups
This page was built for publication: A note on the Hopf-Stiefel function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852704)