Theorems, Problems and Conjectures

These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly on the latter. The new additions include items on Frobenius theorem and multi-core partitions; most recently, some problems on (what we call) colored overpartitions. Formulas analogues to or in the spirit of works by Han, Nekrasov-Okounkov and Stanley are distributed throughout. Concluding remarks are provided at the end in hopes of directing the interested researcher, properly.Comment: 14 page