Publications
Most of my publications can be found at arXiv and Google Scholar.
These are my co-authors:
Karen Aardal, Christine Bachoc, Pieter van den Berg, Aart Blokhuis, Jop Briët,
Harry Buhrman, Fokko van de Bult, Josse van Dobben de Bruyn, Jan Draisma, Jordan Ellenberg,
Vincent Jost, Shanfei Li, John Linderman, Laci Lovász, Hans Mittelmann,
Pieter Moree, Jan van Neerven, Gyula Pap, Maurice Queyranne, Guus Regts,
Lex Schrijver, Neil Sloane, Hajime Tanaka, Frank Vallentin, Allan Wilks
Most recent papers
- J.S. Ellenberg, D. Gijswijt, On large subsets of (Fq)n with no three-term arithmetic progression, Annals of Mathematics, vol 185 (2017), or see [arXiv].
An older version titled: Asymptotic upper bounds on progression-free sets in (Zp)n. - D. Gijswijt, J. van Neerven, On the constant in a transference inequality for the vector-valued Fourier transform, AJMAA 13.1 (2016), or see [arXiv].
- K. Aardal, P. van den Berg, D. Gijswijt, S. Li, Approximation Algorithms for Hard Capacitated k-facility Location Problems, European Journal of Operational Research 242.2 (2015), 358--368. [arXiv].
- D. Gijswijt, Computing divisorial gonality is hard (2015) [arXiv].
- J. van Dobben de Bruyn, D. Gijswijt, Treewidth is a lower bound on graph gonality (2014) [arXiv].
General audience
- A. Blokhuis, D. Gijswijt, Het Cap Set-probleem, Nieuw Archief voor Wiskunde, March 2017 [PDF].
- D. Gijswijt, The card game SET: a mathematical challenge, Machazine, February 2017 [PDF].
- D. Gijswijt, The power of shaking hands, Machazine, April 2016 [PDF].
- D. Gijswijt, Krulgetallen en een heel langzaam stijgende rij, Pythagoras, January 2016 [PDF].
- D. Gijswijt, De Huwelijksstelling van Hall, Pythagoras, Januari 2009 [PDF].
- My other publications in Pythagoras (in Dutch).
Semidefinite programming, Symmetry and Applications
Published
- J. Briët, H. Buhrman, D. Gijswijt, Violating the Shannon capacity of metric graphs with entanglement. PNAS 110.48 (2013), 19227-19232 [arXiv].
- J. Draisma, D. Gijswijt, L. Lovász, G. Regts, A. Schrijver, Characterizing partition functions of the vertex model. Journal of Algebra 350 (2012), 197--206 [arXiv].
- C. Bachoc, D.C. Gijswijt, A. Schrijver, F. Vallentin, Invariant semidefinite programs, in: Handbook on Semidefinite, Conic and Polynomial Optimization (M.F. Anjos, J.B. Lasserre, eds.), Springer, New York, 2012, pp. 219--269. [arXiv].
- D. Gijswijt, H.D. Mittelmann, A. Schrijver, Semidefinite code bounds based on quadruple distances. IEEE Transactions on Information Theory 58 (2012), 2697--2705. [Opt.Online], [arXiv].
- D. Gijswijt, A. Schrijver, H. Tanaka, New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming, Journal of Comb. Theory, Series A 113 (8) (2006), 1719--1731 [PDF].
- D. Gijswijt, Matrix algebras and semidefinite programming techniques for codes, PhD Thesis, University of Amsterdam, September 2005 [PDF], [arXiv]
Additional Propositions or Stellingen (in Dutch).
Preprints
- D. Gijswijt, Block diagonalization for algebras associated with block codes, preprint (2009) [arXiv].
Polyhedral combinatorics, Graphs, Matroids
Published
- K. Aardal, P. van den Berg, D. Gijswijt, S. Li, Approximation Algorithms for Hard Capacitated k-facility Location Problems, European Journal of Operational Research 242.2 (2015), 358--368. [arXiv].
- D. Gijswijt, G. Regts, Polyhedra with the integer Caratheodory property, Journal of Combinatorial Theory, Series B 102 (2012), pp. 62--70. [DOI], or see [arXiv].
- D. Gijswijt, Gy. Pap, An algorithm for weighted fractional matroid matching, Journal of Combinatorial Theory, series B 103 (2013), pp. 509--520. [DOI], [arXiv].
- D. Gijswijt, V. Jost, M. Queyranne, Clique partitioning of interval graphs with submodular costs on the cliques, RAIRO 41 (3) (2007), 275--288. [Link].
- D. Gijswijt, Integer decomposition for polyhedra defined by nearly totally unimodular matrices, SIAM Journal on Discrete Mathematics 19 (2005), no. 3. 798--806 [PDF].
- D. Gijswijt, On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices, Workshop on Graphs and Combinatorial Optimization, 175--178, Electron. Notes Discrete Math., 17, Elsevier, Amsterdam, 2004 [PS].
- D. Gijswijt, A. Schrijver, On the b-stable set polytope of graphs without bad K4, SIAM Journal on Discrete Mathematics 16 (2003), no.3 511--516 [PDF].
Preprints
- D. Gijswijt, Computing divisorial gonality is hard, preprint (2015) [arXiv].
- J. van Dobben de Bruyn, D. Gijswijt, Treewidth is a lower bound on graph gonality, preprint (2014) [arXiv].
- D. Gijswijt, G. Regts, On the Caratheodory rank of polymatroid bases, preprint (2010) [arXiv].
Miscelaneous
- J.S. Ellenberg, D. Gijswijt, On large subsets of (Fq)n with no three-term arithmetic progression [arXiv].
- D. Gijswijt, Asymptotic upper bounds on progression-free sets in (Zp)n.
- D. Gijswijt, J. van Neerven, On the constant in a transference inequality for the vector-valued Fourier transform, to appear in Austral. J. Math. Anal. Appl [arXiv].
- F.J. van de Bult, D. Gijswijt, J.P. Linderman, N.J.A. Sloane, A.R. Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence, Journal of integer sequences 10 (1) (2007) [arXiv].
- D. Gijswijt, P. Moree, A combinatorial identity arising from cobordism theory, Acta Math. Univ. Comenian. (N.S.) 74 (2005), no. 2 199--203 [Link].