Geodesic
Weierstrass sets on finite graphs
Alessio Borzì1
1University of Warwick
The electronic journal of combinatorics, Tome 29 (2022) no. 1

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl DOI arXiv
We study two possible tropical analogues of Weierstrass semigroups on graphs, called rank and functional Weierstrass sets. We prove that on simple graphs, the first is contained in the second. We completely characterize the subsets of $\mathbb{N}$ arising as a functional Weierstrass set of some graph. Finally, we give a sufficient condition for a subset of $\mathbb{N}$ to be the rank Weierstrass set of some graph, allowing us to construct examples of rank Weierstrass sets that are not semigroups.
DOI : 10.37236/10400
Classification : 14T15, 14H55, 05C90, 20M14

Alessio Borzì  1

1 University of Warwick 
Alessio Borzì. Weierstrass sets on finite graphs. The electronic journal of combinatorics, Tome 29 (2022) no. 1. doi: 10.37236/10400
@article{10_37236_10400,
     author = {Alessio Borz{\`\i}},
     title = {Weierstrass sets on finite graphs},
     journal = {The electronic journal of combinatorics},
     year = {2022},
     volume = {29},
     number = {1},
     doi = {10.37236/10400},
     zbl = {1478.14092},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/10400/}
}
TY  - JOUR
AU  - Alessio Borzì
TI  - Weierstrass sets on finite graphs
JO  - The electronic journal of combinatorics
PY  - 2022
VL  - 29
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/10400/
DO  - 10.37236/10400
ID  - 10_37236_10400
ER  - 
%0 Journal Article
%A Alessio Borzì
%T Weierstrass sets on finite graphs
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/10400/
%R 10.37236/10400
%F 10_37236_10400

Cité par Sources :