Related papers: Weierstrass sets on finite graphs
Let $G=\Gamma(S)$ be a semigroup graph, i.e., a zero-divisor graph of a semigroup $S$ with zero element 0. For any adjacent vertices $x, y$ in $G$, denote $C(x,y)={z\in V(G) | N(z)={x,y}}$. Assume that in $G$ there exist two adjacent…
In this article we explicitly determine the structure of the Weierstrass semigroups $H(P)$ for any point $P$ of the Giulietti-Korchm\'aros curve $\mathcal{X}$. We show that as the point varies, exactly three possibilities arise: One for the…
We show that on a metric graph of genus $g$, a divisor of degree $n$ generically has $g(n-g+1)$ Weierstrass points. For a sequence of generic divisors on a metric graph whose degrees grow to infinity, we show that the associated Weierstrass…
We begin the study of a new class of operator algebras that arise from higher rank graphs. Every higher rank graph generates a Fock space Hilbert space and creation operators which are partial isometries acting on the space. We call the…
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
We present the operator semigroups approach to first- and second-order dynamical systems taking place on metric graphs. We briefly survey the existing results and focus on the well-posedness of the problems with standard vertex conditions.…
In this paper, we study tropical Weierstrass points. These are the analogues for tropical curves of ramification points of line bundles on algebraic curves. For a divisor on a tropical curve, we associate intrinsic weights to the connected…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
We formulate an alternative approach to describing Ehresmann semigroups by means of left and right \'etale actions of a meet semilattice on a category. We also characterize the Ehresmann semigroups that arise as the set of all subsets of a…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
We reinterpret the Rhodes semilattices $R_n(\mathfrak{G})$ of a group $\mathfrak{G}$ in terms of gain graphs and generalize them to all gain graphs, both as sets of partition-potential pairs and as sets of subgraphs, and for the latter,…
Let $k \geq 1$. A graph $G$ is $\mathbf{W_k}$ if for any $k$ pairwise disjoint independent vertex subsets $A_1, \dots, A_k$ in $G$, there exist $k$ pairwise disjoint maximum independent sets $S_1, \dots, S_k$ in $G$ such that $A_i \subseteq…
We detect topological semigroups that are topological paragroups, i.e., are isomorphic to a Rees product of a topological group over topological spaces with a continuous sandwich function. We prove that a simple topological semigroup $S$ is…
We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by…
The notion of "Weierstrass Section", comes from Weierstrass canonical form for elliptic curves. In celebrated work [B. Kostant, Lie group representations on polynomial rings, Amer. J. Math. 85 (1963), 327-404] constructed such a section for…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
We prove two characterisations of accessibility of locally finite quasi-transitive connected graphs. First, we prove that any such graph $G$ is accessible if and only if its set of separations of finite order is an ${\rm Aut}(G)$-finitely…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
In this paper we develop the theory of train track maps on graphs of groups. Expanding a definition of Bass, we define a notion of a map of a graph of groups, and of a homotopy equivalence. We prove that under one of two technical…