Proof of two divisibility properties of binomial coefficients conjectured by Z.-W. Sun (Q405269)

As the author already did on similar [\textit{V. J. W. Guo}, Electron. J. Comb. 20, No. 4, Research Paper P20, 5 p. (2013; Zbl 1295.11021)] and different topics [\textit{V. J. W. Guo} and \textit{J. Zeng}, J. Number Theory 132, No. 8, 1731--1740 (2012; Zbl 1300.11005)], this paper confirms further conjectures of \textit{Z.-W. Sun} [J. Aust. Math. Soc. 93, No. 1--2, 189--201 (2012; Zbl 1336.11020)], [Electron. J. Comb. 20, No. 1, Research Paper P9, 14 p. (2013; Zbl 1266.05004)] by proving that, for all positive integers \(n\), \[ (2n+3){2n\choose n} \left|3{6n\choose 3n}{3n\choose n}\right. \text{and}\;(10n+3){3n\choose n} \left|21{15n\choose 5n}{5n\choose n}.\right. \] The author establishes other divisibility properties and, in particular, that for all positive integers \(m\) and \(n\), the product \(am{am+bm-1\choose am}{an+bn\choose an}\) is divisible by \(m+n\). The \(q\)-analogues of such result are useful to generalize the positivity of those \(q\)-Catalan numbers studied, e.g., by \textit{J. Fürlinger} and \textit{J. Hofbauer} [J. Comb. Theory, Ser. A 40, 248--264 (1985; Zbl 0581.05006)], \textit{A. M. Garsia} and \textit{J. Haglund} [Discrete Math. 256, No. 3, 677--717 (2002; Zbl 1028.05115)], \textit{J. Haglund} [Adv. Math. 175, No. 2, 319--334 (2003; Zbl 1043.05012)], \textit{M. Haiman} [Discrete Math. 193, No. 1--3, 201--224 (1998; Zbl 1061.05509)] and by \textit{G. E. Andrews} [J. Comb. Theory, Ser. A 44, 267--273 (1987; Zbl 0607.05006)], [J. Stat. Plann. Inference 34, No. 1, 19--22 (1993; Zbl 0770.11044)]. Beyond known formulas about the \(q\)-binomial coefficients (illustrated, e.g., in [\textit{R. P. Stanley}, Enumerative combinatorics. Volume 2. Cambridge: Cambridge University Press (1999; Zbl 0928.05001)]), the \(p\)-adic order and the polynomials (cyclotomic, reciprocal, unimodal), in the proof the author employs an algorithm given by \textit{G. E. Andrews} [Unusual applications of number theory. DIMACS. Series in Discrete Mathematics and Theoretical Computer Science 64, 9--15 (2004; Zbl 1079.11055)], a combinatorial interpretation supplied by \textit{I. M. Gessel} [J. Symb. Comput. 14, No. 2--3, 179--194 (1992; Zbl 0754.05002)] and theorems from \textit{J. W. Bober} [J. Lond. Math. Soc., II. Ser. 79, No. 2, 422--444 (2009; Zbl 1195.11025)], \textit{V. Reiner} et al. [J. Comb. Theory, Ser. A 108, No. 1, 17--50 (2004; Zbl 1052.05068)], \textit{R. P. Stanley} [in: Graph theory and its applications: East and West. Proceedings of the first China-USA international conference, held in Jinan, China, June 9- 20, 1986. New York: New York Academy of Sciences. 500--535 (1989; Zbl 0792.05008)], \textit{Q.-H. Yang} [``Proof of a conjecture related to divisibility properties of binomial coefficients'', \url{arXiv:1401.1108}] and still from \textit{G. E. Andrews} [Am. Math. Mon. 82, 830--833 (1975; Zbl 0313.05006)]. A recent achievement of \textit{M. R. Sepanski} [Electron. J. Comb. 21, No. 1, Research Paper P1.32, 7 p. (2014; Zbl 1308.11021)], a personal communication with \textit{Tewodros Amdeberhan} and \textit{Victor H. Moll} and a conjecture proposed by \textit{S. O. Warnaar} and \textit{W. Zudilin} [Aequationes Math. 81, No. 1--2, 177--183 (2011; Zbl 1234.11023)] are also recalled. This paper raises some conjectures too.