MCMihai Ciucu
Mihai Ciucu
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mihai Ciucu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
C Krattenthaler
1 shared publication- Christian Krattenthaler
Institut für Mathematik Universität Wien Strudlhofgasse 4 A-1090 Wien Austria
1 shared publication - Christian Krattenthaler
Institut für Mathematik Universität Wien Strudlhofgasse 4 A-1090 Wien Austria
1 shared publication - D. Zare1 shared publication
- Theresia Eisenkölbl1 shared publication
Latest Publications
- 18 December 2006
- Published by Elsevier in Discrete Mathematics
- Vol. 307 (15) , 1957-1960
A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd order
- 18 December 2006
- Published by Elsevier in Discrete Mathematics
- Vol. 307 (15) , 1957-1960
A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd order
- 1 May 2004
- Published by Elsevier in Advances in Mathematics
Rotational invariance of quadromer correlations on the hexagonal lattice*1
- 1 May 2004
- Published by Elsevier in Advances in Mathematics
Rotational invariance of quadromer correlations on the hexagonal lattice*1
- Open Access
A non-automatic (!) application of Gosper's algorithm evaluates a determinant from tiling enumeration
We evaluate the determinant $\det_{1\leq i,j\leq n}(\binom{x+y+j}{x-i+2j}-\binom{x+y+j}{x+i+2j})$, which gives the number of lozenge tilings of a hexagon with cut off corners. A particularly interesting feature of this evaluation is that it requires the proof of a certain hypergeometric identity which we accomplish by using Gosper's algorithm in a non-automatic fashion.Open AccessA non-automatic (!) application of Gosper's algorithm evaluates a determinant from tiling enumeration
We evaluate the determinant $\det_{1\leq i,j\leq n}(\binom{x+y+j}{x-i+2j}-\binom{x+y+j}{x+i+2j})$, which gives the number of lozenge tilings of a hexagon with cut off corners. A particularly interesting feature of this evaluation is that it requires the proof of a certain hypergeometric identity which we accomplish by using Gosper's algorithm in a non-automatic fashion. - Open Access
Enumeration of lozenge tilings of hexagons with a central triangular hole
We deal with unweighted and weighted enumerations of lozenge tilings of a hexagon with side lengths $a,b+m,c,a+m,b,c+m$, where an equilateral triangle of side length $m$ has been removed from the center. We give closed formulas for the plain enumeration and for a certain $(-1)$-enumeration of these lozenge tilings. In the case that $a=b=c$, we also provide closed formulas for certain weighted enumerations of those lozenge tilings that are cyclically symmetric. For $m=0$, the latter formulas specialize to statements about weighted enumerations of cyclically symmetric plane partitions. One such specialization gives a proof of a conjecture of Stembridge on a certain weighted count of cyclically symmetric plane partitions. The tools employed in our proofs are nonstandard applications of the theory of nonintersecting lattice paths and determinant evaluations. In particular, we evaluate the determinants $\det_{0\le i,j\le n-1}\big(\om \delta_{ij}+\binom {m+i+j}j\big)$, where $\om$ is any 6th root of unity. These determinant evaluations are variations of a famous result due to Andrews (Invent. Math. 53 (1979), 193--225), which corresponds to $\om=1$.Open AccessEnumeration of lozenge tilings of hexagons with a central triangular hole
We deal with unweighted and weighted enumerations of lozenge tilings of a hexagon with side lengths $a,b+m,c,a+m,b,c+m$, where an equilateral triangle of side length $m$ has been removed from the center. We give closed formulas for the plain enumeration and for a certain $(-1)$-enumeration of these lozenge tilings. In the case that $a=b=c$, we also provide closed formulas for certain weighted enumerations of those lozenge tilings that are cyclically symmetric. For $m=0$, the latter formulas specialize to statements about weighted enumerations of cyclically symmetric plane partitions. One such specialization gives a proof of a conjecture of Stembridge on a certain weighted count of cyclically symmetric plane partitions. The tools employed in our proofs are nonstandard applications of the theory of nonintersecting lattice paths and determinant evaluations. In particular, we evaluate the determinants $\det_{0\le i,j\le n-1}\big(\om \delta_{ij}+\binom {m+i+j}j\big)$, where $\om$ is any 6th root of unity. These determinant evaluations are variations of a famous result due to Andrews (Invent. Math. 53 (1979), 193--225), which corresponds to $\om=1$. - 30 April 1999
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 86 (1) , 103-126
The Number of Centered Lozenge Tilings of a Symmetric Hexagon
- 30 April 1999
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 86 (1) , 103-126
The Number of Centered Lozenge Tilings of a Symmetric Hexagon