62 citations · 222 across the 34 of their papers we have counts for
4 papers · 1 filter
Equations for GL invariant families of polynomials
Paul Breiding, Christian Ikenmeyer, Mateusz Michałek +1
We provide an algorithm that takes as an input a given parametric family of homogeneous polynomials, which is invariant under the action of the general linear group, and an integer…
Karchmer-Wigderson Games for Hazard-free Computation
Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh
We present a Karchmer-Wigderson game to study the complexity of hazard-free formulas. This new game is both a generalization of the monotone Karchmer-Wigderson game and an analog o…
Young Flattenings in the Schur module basis
Lennart J. Haas, Christian Ikenmeyer
There are several isomorphic constructions for the irreducible polynomial representations of the general linear group in characteristic zero. The two most well-known versions are c…
A note on VNP-completeness and border complexity
Christian Ikenmeyer, Abhiroop Sanyal
In 1979 Valiant introduced the complexity class VNP of p-definable families of polynomials, he defined the reduction notion known as p-projection and he proved that the permanent p…