The following pages link to W. O. J. Moser (Q1077415):
Displayed 40 items.
- The number of subsets without a fixed circular distance (Q1077416) (← links)
- A generalization of Riordan's formula for 3xn latin rectangles (Q1165855) (← links)
- Problems, problems, problems (Q1175791) (← links)
- Almost all trees have tribe number 2 or 3 (Q1897446) (← links)
- A generalization of some results in additive number theory (Q2395230) (← links)
- Arrays with fixed row and column sums (Q2562859) (← links)
- A survey of Sylvester's problem and its generalizations (Q2638534) (← links)
- (Q3138754) (← links)
- Research Problems in Discrete Geometry (Q3156762) (← links)
- (Q3241233) (← links)
- On the Number of Ordinary Lines Determined by n Points (Q3249352) (← links)
- Abstract Definitions for the Mathieu Groups M<sub>11</sub>and M<sub>12</sub> (Q3256247) (← links)
- (Q3310509) (← links)
- (Q3320391) (← links)
- (Q3681482) (← links)
- (Q3688307) (← links)
- A (Modest) Generalization of the Theorems of Wilson and Fermat (Q3803186) (← links)
- An Enumeration of the Five Parallelohedra (Q3846742) (← links)
- (Q3855356) (← links)
- A New Identity and Some Applications (Q3890704) (← links)
- Placing Counters to Illustrate Burnside's Lemma (Q3937407) (← links)
- (Q3947824) (← links)
- More Birthday Surprises (Q4069558) (← links)
- (Q4165395) (← links)
- (Q4309150) (← links)
- (Q4863763) (← links)
- (Q4881125) (← links)
- (Q5343413) (← links)
- Combinations, Successions and the n-Kings Problem (Q5522930) (← links)
- A Note on Combinations (Q5525382) (← links)
- Permutations without Rising or Falling $\omega$-Sequences (Q5532560) (← links)
- The Number of Very Reduced 4 × <i>n</i> Latin Rectangles (Q5537643) (← links)
- Enumeration of combinations with restricted differences and cospan (Q5562004) (← links)
- Generalizations of Terquem's problem (Q5570947) (← links)
- (Q5650865) (← links)
- (Q5678860) (← links)
- Remarks on a Paper by S. Trott (Q5731841) (← links)
- On the Relative Widths of Coverings by Convex Bodies (Q5895754) (← links)
- Optimal crossing-free Hamiltonian circuit drawings of \(K_n\) (Q5904318) (← links)
- Optimal crossing-free Hamiltonian circuit drawings of \(K_n\) (Q5905997) (← links)