20.500.12556/RUL-121270 Dokazi formule o kljukah magistrsko delo Proofs of hook-length formula V delu predstavimo problem števila standardnih Youngovih tabel ter formulo o kljukah, ki podaja odgovor. Obravnavamo tudi poševne tabele. Zberemo in povzamemo zgodovino različnih dokazov te formule ter pregledamo skice posameznih dokazov. Podrobno predstavimo štiri dokaze: 1) Frame, Robinson in Thrall (izvirni); 2) Greene, Nijenhuis in Wilf (verjetnostni); 3) Novelli, Pak in Stoyanovskii (z bijekcijo); 4) Konvalinka (z bijekcijo). In this thesis we present the problem of the number of standard Young tableux and the hook-length formula, which supplies the result. We also touch on skew-shape tableux. We collect and summarize the history of proofs of this formula and review sketches of individual proofs. We present four proofs in detail: 1) Frame, Robinson and Thrall (original); 2) Greene, Nijenhuis and Wilf (probabilistic); 3)Novelli, Pak and Stoyanovskii (bijective); 4) Konvalinka (bijective). formula o kljukah dokazi preštevalna kombinatorika hook-length formula proofs enumerative combinatorics true false false Slovenski jezik Angleški jezik Magistrsko delo/naloga 2020-10-02 08:15:39 2020-10-02 08:15:41 2024-05-29 13:09:23 0000-00-00 00:00:00 2020 0 0 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 113271 33064195 1440.pdf 1440.pdf 1 0F6D07C21E1E6AB9873C78AED9D5A8BD 43c4f5e0740e47ffdfc3c64d0a7f8432ad34a125c18e361b92416102fbe5b787 4727d64b-a1ba-11eb-a523-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=136177 Fakulteta za matematiko in fiziko Fakulteta za računalništvo in informatiko 0 0 0