Related papers: Determining Genus From Sandpile Torsor Algorithms
In this paper, motivated by a $\tau$-tilting version of the Brauer-Thrall Conjectures, we study general properties of band modules and their endomorphisms in the module category of a finite dimensional algebra. As an application we describe…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…
We give an algorithm to calculate the minimal and maximal genus of the orientable closed surface where a graph $G$ can be embedded. For this, we construct some special branched coverings of the 2-sphere. We apply this algorithm to calculate…
In the paper arXiv:0810.4291 we have shown, in the context of type II superstring theory, the classification of the allowed B-field and A-field configurations in the presence of anomaly-free D-branes, the mathematical framework being…
In this article we discuss a connection between two famous constructions in mathematics: a Cayley graph of a group and a (rational) billiard surface. For each rational billiard surface, there is a natural way to draw a Cayley graph of a…
In this paper we elaborate on the structure of the semigroup tree and the regularities on the number of descendants of each node observed earlier. These regularites admit two different types of behavior and in this work we investigate which…
For every group $G$, we show that either $G$ has a topologically transitive action on the line $\mathbb R$ by orientation-preserving homeomorphisms, or every orientation-preserving action of $G$ on $\mathbb R$ has a wandering interval.…
We determine the pairs of torus knots that have a genus one cobordism between them, with one notable exception. This is done by combining obstructions using $\nu^+$ from the Heegaard Floer knot complex and explicit constructions of…
A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chv\'atal conjectured that this theorem extends to metric spaces, with an appropriated definition of…
In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…
A ribbon is a double structure on P^1. The geometry of a ribbon is closely related to that of a smooth curve. In this note we consider linear series on ribbons. Our main result is an explicit determinantal description for the locus…
We define a turning of a rank-$2k$ vector bundle $E \to B$ to be a homotopy of bundle automorphisms $\psi_t$ from $\mathbb{Id}_E$, the identity of $E$, to $-\mathbb{Id}_E$, minus the identity, and call a pair $(E, \psi_t)$ a turned bundle.…
In this note, we give a so-called representative classification for the strata by automorphism group of smooth $\bar{k}$-plane curves of genus $6$, where $\bar{k}$ is a fixed separable closure of a field $k$ of characteristic $p = 0$ or $p…
The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…
A torti-rational knot, denoted by K(2a,b|r), is a knot obtained from the 2-bridge link B(2a,b) by applying Dehn twists an arbitrary number of times, r, along one component of B(2a,b). We determine the genus of K(2a,b|r) and solve a question…
It is well known that all torsors under an affine algebraic group over an algebraically closed field are trivial. We note that under suitable conditions this also holds if the the group is not necessarily of finite type. This has an…
We consider a statistical model for the problem of finding subgraphs with specified topology in an otherwise random graph. This task plays an important role in the analysis of social and biological networks. In these types of networks,…
A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…
We study the length of short cycles on uniformly random metric maps (also known as ribbon graphs) of large genus using a Teichm\"uller theory approach. We establish that, as the genus tends to infinity, the length spectrum converges to a…
The objective of this paper is to investigate graph-theoretic conditions for structural herdability of an LTI system. In particular, we are interested in the structural sign (SS) herdability of a system wherein the underlying digraph…