Christian Ikenmeyer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Christian Ikenmeyer has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Fulvio Gesmundo
Institut de Mathématiques de Toulouse; UMR5219 – Université de Toulouse; and CNRS – UPS, F-31062 Toulouse Cedex 9, France
2 shared publications - Jesko Hüttenhain
Institute of Mathematics, Technische Universität, Berlin, Germany
2 shared publications - Jonathan D. Hauenstein
University of Notre Dame
2 shared publications - Joseph M. Landsberg
Department of Mathematics, Texas A &M University, College Station, USA
2 shared publications - Peter Bürgisser
Institut für Mathematik Technische Universität Berlin
2 shared publications - Abdelmalek Abdesselam
Department of Mathematics, University of Virginia, Charlottesville, USA
1 shared publication
Latest Publications
- 31 May 2016
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 44 (1) , 31-32
Erratum to: Small Littlewood–Richardson coefficients
- 31 May 2016
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 44 (1) , 31-32
Erratum to: Small Littlewood–Richardson coefficients
- 12 February 2016
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 44 (1) , 1-29
Small Littlewood–Richardson coefficients
- 12 February 2016
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 44 (1) , 1-29
Small Littlewood–Richardson coefficients
- Open Access
Fundamental invariants of orbit closures
For several objects of interest in geometric complexity theory, namely for the determinant, the permanent, the product of variables, the power sum, the unit tensor, and the matrix multiplication tensor, we introduce and study a fundamental SL-invariant function that relates the coordinate ring of the orbit with the coordinate ring of its closure. For the power sums we can write down this fundamental invariant explicitly in most cases. Our constructions generalize the two Aronhold invariants on ternary cubics. For the other objects we identify the invariant function conditional on intriguing combinatorial problems much like the well-known Alon-Tarsi conjecture on Latin squares. We provide computer calculations in small dimensions for these cases. As a main tool for our analysis, we determine the stabilizers, and we establish the polystability of all the mentioned forms and tensors (including the generic ones).
Open AccessFundamental invariants of orbit closures
For several objects of interest in geometric complexity theory, namely for the determinant, the permanent, the product of variables, the power sum, the unit tensor, and the matrix multiplication tensor, we introduce and study a fundamental SL-invariant function that relates the coordinate ring of the orbit with the coordinate ring of its closure. For the power sums we can write down this fundamental invariant explicitly in most cases. Our constructions generalize the two Aronhold invariants on ternary cubics. For the other objects we identify the invariant function conditional on intriguing combinatorial problems much like the well-known Alon-Tarsi conjecture on Latin squares. We provide computer calculations in small dimensions for these cases. As a main tool for our analysis, we determine the stabilizers, and we establish the polystability of all the mentioned forms and tensors (including the generic ones).
- Open Access
Permanent versus determinant: not via saturations
Let Det_n denote the closure of the GL_{n^2}(C)-orbit of the determinant polynomial det_n with respect to linear substitution. The highest weights (partitions) of irreducible GL_{n^2}(C)-representations occurring in the coordinate ring of Det_n form a finitely generated monoid S(Det_n). We prove that the saturation of S(Det_n) contains all partitions lambda with length at most n and size divisible by n. This implies that representation theoretic obstructions for the permanent versus determinant problem must be holes of the monoid S(Det_n).
Open AccessPermanent versus determinant: not via saturations
Let Det_n denote the closure of the GL_{n^2}(C)-orbit of the determinant polynomial det_n with respect to linear substitution. The highest weights (partitions) of irreducible GL_{n^2}(C)-representations occurring in the coordinate ring of Det_n form a finitely generated monoid S(Det_n). We prove that the saturation of S(Det_n) contains all partitions lambda with length at most n and size divisible by n. This implies that representation theoretic obstructions for the permanent versus determinant problem must be holes of the monoid S(Det_n).
- Open Access
The Saxl Conjecture and the Dominance Order
In 2012 Jan Saxl conjectured that all irreducible representations of the symmetric group occur in the decomposition of the tensor square of the irreducible representation corresponding to the staircase partition. We make progress on this conjecture by proving the occurrence of all those irreducibles which correspond to partitions that are comparable to the staircase partition in the dominance order. Moreover, we use our result to show the occurrence of all irreducibles corresponding to hook partitions. This generalizes results by Pak, Panova, and Vallejo from 2013.
Open AccessThe Saxl Conjecture and the Dominance Order
In 2012 Jan Saxl conjectured that all irreducible representations of the symmetric group occur in the decomposition of the tensor square of the irreducible representation corresponding to the staircase partition. We make progress on this conjecture by proving the occurrence of all those irreducibles which correspond to partitions that are comparable to the staircase partition in the dominance order. Moreover, we use our result to show the occurrence of all irreducibles corresponding to hook partitions. This generalizes results by Pak, Panova, and Vallejo from 2013.
- Open Access
16,051 formulas for Ottaviani's invariant of cubic threefolds
We provide explicit combinatorial formulas for Ottaviani's degree 15 invariant which detects cubics in 5 variables that are sums of 7 cubes. Our approach is based on the chromatic properties of certain graphs and relies on computer searches and calculations.
Open Access16,051 formulas for Ottaviani's invariant of cubic threefolds
We provide explicit combinatorial formulas for Ottaviani's degree 15 invariant which detects cubics in 5 variables that are sums of 7 cubes. Our approach is based on the chromatic properties of certain graphs and relies on computer searches and calculations.
- 28 April 2015
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 16 (3) , 599-635
Complexity of Linear Circuits and Geometry
- 28 April 2015
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 16 (3) , 599-635
Complexity of Linear Circuits and Geometry
- Open Access
Complexity of linear circuits and geometry
We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border) rigidity, (ii) compute degrees of varieties associated to rigidity, (iii) describe algebraic varieties associated to families of matrices that are expected to have super-linear rigidity, and (iv) prove results about the ideals and degrees of cones that are of interest in their own right.
Open AccessComplexity of linear circuits and geometry
We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) exhibit many non-obvious equations testing for (border) rigidity, (ii) compute degrees of varieties associated to rigidity, (iii) describe algebraic varieties associated to families of matrices that are expected to have super-linear rigidity, and (iv) prove results about the ideals and degrees of cones that are of interest in their own right.
- Open Access
Binary Determinantal Complexity
We prove that for writing the 3 by 3 permanent polynomial as a determinant of a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7 matrix is required. Our proof is computer based and uses the enumeration of bipartite graphs. Furthermore, we analyze sequences of polynomials that are determinants of polynomially sized matrices consisting only of zeros, ones, and variables. We show that these are exactly the sequences in the complexity class of constant free polynomially sized (weakly) skew circuits.
Open AccessBinary Determinantal Complexity
We prove that for writing the 3 by 3 permanent polynomial as a determinant of a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7 matrix is required. Our proof is computer based and uses the enumeration of bipartite graphs. Furthermore, we analyze sequences of polynomials that are determinants of polynomially sized matrices consisting only of zeros, ones, and variables. We show that these are exactly the sequences in the complexity class of constant free polynomially sized (weakly) skew circuits.