Related papers: Weierstrass sets on finite graphs

We prove an analog of the Tits alternative for rational functions. In particular, we show that if $S$ is a finitely generated semigroup of rational functions over the complex numbers, then either $S$ has polynomially bounded growth or $S$…

The note contains a few results related to separation axioms and automatic continuity of operations in compact-like semitopological groups. In particular, is presented a semiregular semitopological group $G$ which is not $T_3$. We show that…

This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…

We prove that a semiring isomorphism between the rational function semifields of two tropical curves induces an expansive map between those tropical curves. This semiring isomorphism and the expansive map respect zeros and poles of rational…

The $r$th gonality of a graph is the smallest degree of a divisor on the graph with rank $r$. The gonality sequence of a graph is a tropical analogue of the gonality sequence of an algebraic curve. We show that the set of truncated gonality…

We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…

Given a divisor on a tropical curve, we associate to each point of the curve a Weierstrass gap sequence. We investigate structural properties of these gap sequences and explore their relationship with the Weierstrass gap sequences of line…

We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of…

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.

For applications in algebraic geometric codes, an explicit description of bases of Riemann-Roch spaces of divisors on function fields over finite fields is needed. We investigate the third function field $ F^{(3)} $ in a tower of…

The aim of this paper is to review the main techniques in the computation of Weierstra\ss semigroup at several points of curves defined over perfect fields, with special emphasis on the case of two points. Some hints about the usage of some…

The aim of this paper is to introduce and investigate the Poincar\'e series associated with the Weierstra{\ss} semigroup of one and two rational points at a (not necessarily irreducible) non-singular projective algebraic curve defined over…

Beck et. al. characterized the grid graphs whose perfect matching polytopes are Gorenstein and they also showed that for some parameters, perfect matching polytopes of torus graphs are Gorenstein. In this paper, we complement their result,…

We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…

We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…

Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…

We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on…

Let $T$ be a tree and $e$ an edge in $T$. If $C$ is a component of $T\setminus e$ and both $C$ and its complement are infinite we say that $C$ is a half-tree. The main result of this paper is that if $G$ is a closed subgroup of the…

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

In [S. Basu, A. Gabrielov, N. Vorobjov, Semi-monotone sets. arXiv:1004.5047v2 (2011)] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals, and having connected intersections with all…