 document

Stannat, A.W. (author), Ileri, Can Umut (author), Gijswijt, D.C. (author), Pouwelse, J.A. (author)In a multiagent system where agents provide quantifiable work for each other on a voluntary basis, reputation mechanisms are incorporated to induce cooperation. Hereby agents assign their peers numerical scores based on their reported transaction histories. In such systems, adversaries can launch an attack by creating fake identities called...conference paper 2021
 document

Del Pia, Alberto (author), Gijswijt, D.C. (author), Linderoth, Jeff (author), Zhu, Haoran (author)An integer packing set is a set of nonnegative integer vectors with the property that, if a vector x is in the set, then every nonnegative integer vector y with y≤x is in the set as well. The main result of this paper is that integer packing sets, ordered by inclusion, form a wellquasiordering. This result allows us to answer a recently...journal article 2021
 document

Bodlaender, Hans L. (author), van Dobben de Bruyn, J. (author), Gijswijt, D.C. (author), Smit, Harry (author)In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most k, when an effective divisor of degree k that reaches all vertices is given. We also give a similar result for two related...conference paper 2020
 document

van Dobben de Bruyn, J (author), Gijswijt, D.C. (author)We prove that the (divisorial) gonality of a finite connected graph is lower bounded by its treewidth. Graphs for which equality holds include the grid graphs and the complete multipartite graphs. We prove that the treewidth lower bound also holds for metric graphs (tropical curves) by constructing for any positive rank divisor on a metric...journal article 2020
 document

Gijswijt, D.C. (author), Smit, Harry J. (author), van der Wegen, Marieke (author)There are several notions of gonality for graphs. The divisorial gonality dgon(G) of a graph G is the smallest degree of a divisor of positive rank in the sense of BakerNorine. The stable gonality sgon(G) of a graph G is the minimum degree of a finite harmonic morphism from a refinement of G to a tree, as defined by Cornelissen, Kato and Kool....journal article 2020
 document

Blokhuis, Aart (author), Gijswijt, D.C. (author)Mei vorig jaar zorgde de Nederlandse wiskundige Dion Gijswijt van de TU Delft samen met Jordan Ellenberg (University of Wisconsin) voor een doorbraak in het Cap Setprobleem. In dit artikel bespreken Aart Blokhuis en Dion Gijswijt het probleem en de gevonden oplossing aan de hand van het kaartspel SETjournal article 2017
 document

Ellenberg, Jordan S. (author), Gijswijt, D.C. (author)In this note, we show that the method of Croot, Lev, and Pach can be used to bound the size of a subset of F n q Fqn with no three terms in arithmetic progression by c n cn with c<q c<q . For q=3 q=3 , the problem of finding the largest subset of F n 3 F3n with no three terms in arithmetic progression is called the <i>cap set problem</i...journal article 2017
 document
 Gijswijt, D.C. (author) journal article 2016