arXiv Analytics

Sign in

arXiv:2104.07121 [math.CO]AbstractReferencesReviewsResources

Weierstrass sets on finite graphs

Alessio Borzì

Published 2021-04-14Version 1

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 N arising as a functional Weierstrass set of some graph. Finally, we give a sufficient condition for a subset of N to be the rank Weierstrass set of some graph, allowing us to construct examples of rank Weierstrass sets that are not semigroups.

Categories: math.CO
Subjects: 14T15, 14H55, 05C99, 20M14
Related articles: Most relevant | Search more
arXiv:1305.4668 [math.CO] (Published 2013-05-20, updated 2014-04-24)
Canonical tree-decompositions of finite graphs I. Existence and algorithms
arXiv:1409.7587 [math.CO] (Published 2014-09-26)
On the structure of graphs which are locally indistinguishable from a lattice
arXiv:1903.00407 [math.CO] (Published 2019-03-01)
On Cayley representations of finite graphs over abelian p-groups

Links

Toolbox