28 citations · 336 across the 38 of their papers we have counts for
41 papers
Trinomial containment in polynomial ideals is undecidable
Tobias Boege, Anna Hofer, Thomas Kahle
We prove that deciding whether an ideal in a polynomial ring contains a trinomial is impossible on a Turing machine. More precisely, from an integer polynomial we compute gener…
Optimal designs for discrete choice models via graph Laplacians
Frank Röttger, Thomas Kahle, Rainer Schwabe
In discrete choice experiments, the information matrix depends on the model parameters. Therefore designing optimally informative experiments for arbitrary initial parameters often…
Extreme Values of Permutation Statistics
Philip Dörr, Thomas Kahle
We investigate extreme values of Mahonian and Eulerian distributions arising from counting inversions and descents of random elements of finite Coxeter groups. To this end, we cons…
No short polynomials vanish on bounded rank matrices
Jan Draisma, Thomas Kahle, Finn Wiersig
We show that the shortest nonzero polynomials vanishing on bounded-rank matrices and skew-symmetric matrices are the determinants and Pfaffians characterising the rank. Algebraical…
Short polynomials in determinantal ideals
Thomas Kahle, Finn Wiersig
We show that a determinantal ideal generated by -minors does not contain any nonzero polynomials with or fewer terms. Geometrically this means that any nonzero polynomial…
The geometry of Gaussian double Markovian distributions
Tobias Boege, Thomas Kahle, Andreas Kretschmer +1
Gaussian double Markovian models consist of covariance matrices constrained by a pair of graphs specifying zeros simultaneously in the covariance matrix and its inverse. We study t…