Jan Draisma

Orcid: 0000-0001-7248-8250

According to our database1, Jan Draisma authored at least 22 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Border subrank via a generalised Hilbert-Mumford criterion.
CoRR, 2024

2022
Countably many asymptotic tensor ranks.
CoRR, 2022

2021
Catalan-many tropical morphisms to trees; Part I: Constructions.
J. Symb. Comput., 2021

2020
The monic rank.
Math. Comput., 2020

2018
On metric graphs with prescribed gonality.
J. Comb. Theory, Ser. A, 2018

Markov random fields and iterated toric fibre products.
Adv. Appl. Math., 2018

2017
Uniform Determinantal Representations.
SIAM J. Appl. Algebra Geom., 2017

Foreword.
J. Symb. Comput., 2017

2016
On the Existence of Identifiable Reparametrizations for Linear Compartment Models.
SIAM J. Appl. Math., 2016

The Euclidean Distance Degree of an Algebraic Variety.
Found. Comput. Math., 2016

2015
Special issue on effective methods in algebraic computation.
J. Symb. Comput., 2015

Lossy Gossip and Composition of Metrics.
Discret. Comput. Geom., 2015

2014
The euclidean distance degree.
Proceedings of the Symbolic-Numeric Computation 2014, 2014

2013
Energy Minimization of Repelling Particles on a Toric Grid.
SIAM J. Discret. Math., 2013

Positivity for Gaussian graphical models.
Adv. Appl. Math., 2013

2012
Lattice-Width Directions and Minkowski's 3<sup>d</sup>-Theorem.
SIAM J. Discret. Math., 2012

2011
Partition arguments in multiparty communication complexity.
Theor. Comput. Sci., 2011

Equivariant Gröbner bases and the Gaussian two-factor model.
Math. Comput., 2011

2009
Efficient quantum algorithm for identifying hidden polynomials.
Quantum Inf. Comput., 2009

2007
Secant Dimensions of Minimal Orbits: Computations and Conjectures.
Exp. Math., 2007

2005
Representation theory on the open Bruhat cell.
J. Symb. Comput., 2005

2003
Constructing Lie algebras of first order differential operators.
J. Symb. Comput., 2003


  Loading...