Ehemalige Mitarbeiter

Peter Bürgisser and Christian Ikenmeyer and Greta Panova (2019). No occurence obstructions in geometric complexity theory. Journal of the American Mathematical Society, 163–193.

Peter Bürgisser and Christian Ikenmeyer (2017). Fundamental invariants of orbit closures. Journal of Algebra, 390–434.

Peter Bürgisser and Christian Ikenmeyer and Jesko Hüttenhain (2016). Permanent Versus Determinant: Not Via Saturations. Proc. AMS, 1247-1258.

Jesko Hüttenhain and Christian Ikenmeyer (2016). Binary determinantal complexity. Linear Algebra and its Applications, 559 - 573.

Peter Bürgisser and Christian Ikenmeyer and Greta Panova (2016). No occurrence obstructions in geometric complexity theory. Proceedings 57th Annual IEEE Symposium on Foundations of Computer Science, 386–395.

Christian Ikenmeyer (2016). Small Littlewood-Richardson coefficients. Journal of Algebraic Combinatorics, 1–29.

Jonathan David Hauenstein and Christian Ikenmeyer and Joseph Montague Landsberg (2013). Equations for lower bounds on border rank. Experimental Mathematics, 372–383.

Peter Bürgisser and Christian Ikenmeyer (2013). Explicit Lower Bounds via Geometric Complexity Theory. Proceedings 45th ACM Symposium on Theory of Computing, 141-150.

Peter Bürgisser and Christian Ikenmeyer (2013). Deciding Positivity of Littlewood-Richardson coefficients. SIAM J. Discrete Math., 1639-1681.

Christian Ikenmeyer (2012). Geometric Complexity Theory, Tensor Rank, and Littlewood-Richardson Coefficients. Universität Paderborn

Peter Bürgisser and Christian Ikenmeyer (2011). Geometric Complexity Theory and Tensor Rank. Proceedings 43rd Annual ACM Symposium on Theory of Computing 2011, 509-518.

Peter Bürgisser and Matthias Christandl and Christian Ikenmeyer (2011). Even partitions in plethysms. Journal of Algebra, 322-329.

Peter Bürgisser and Matthias Christandl and Christian Ikenmeyer (2011). Nonvanishing of Kronecker coefficients for rectangular shapes. Advances in Mathematics, 2082-2091.

Peter Bürgisser and Christian Ikenmeyer (2009). A max-flow algorithm for positivity of Littlewood-Richardson coefficients. FPSAC 2009, 267-278.

Peter Bürgisser and Christian Ikenmeyer (2008). The Complexity of Computing Kronecker Coefficients. FPSAC 2008, 357-368.