Related papers: Generating function on epimorphisms between $2$-br…

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…

Given a graph, we can form a spanning forest by first sorting the edges in some order, and then only keep edges incident to a vertex which is not incident to any previous edge. The resulting forest is dependent on the ordering of the edges,…

We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all…

Theory is developed for linear-quadratic at infinity generating families for Legendrian knots in R^3. It is shown that the unknot with maximal Thurston--Bennequin invariant of -1 has a unique linear-quadratic at infinity generating family,…

This paper presents a new methodology to count the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius…

For any knot with genus one and unknotting number one, other than the figure-eight knot, we prove that there is exactly one way to unknot it by means of a crossing change. In the case of the figure-eight knot, we prove that there are…

A procedure is described that makes use of the generating function of characters to obtain a new generating function $H$ giving the multiplicities of each weight in all the representations of a simple Lie algebra. The way to extract from…

We give the first analysis of the computational complexity of {\it coalition structure generation over graphs}. Given an undirected graph $G=(N,E)$ and a valuation function $v:2^N\rightarrow\RR$ over the subsets of nodes, the problem is to…

A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…

The guessing number of a directed graph (digraph), equivalent to the entropy of that digraph, was introduced as a direct criterion on the solvability of a network coding instance. This paper makes two contributions on the guessing number.…

We use Heegaard Floer homology to give obstructions to unknotting a knot with a single crossing change. These restrictions are particularly useful in the case where the knot in question is alternating. As an example, we use them to classify…

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…

We give a closed formula for the volume of a two-bridge knot, more precisely for its Bloch invariant. We obtain this formula without triangulating the complement: instead, we derive it from the Hopf formula for the second homology of the…

A ribbon is a two-dimensional object with one-dimensional properties which is related with geometry, robotics and molecular biology. A folded ribbon structure provides a complex structure through a series of folds. We focus on a folded…

Let $p$ be a prime number and let $K$ be a genus one two-bridge knot. In the spirit of arithmetic topology, we observe that if $p$ divides the size of the 1st homology group of some odd-th cyclic branched cover of the knot $K$, then its…

We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…

For a knot K, let b_n(K) be the minimum length of an n-stranded braid representative of K. Examples of knots exist for which b_n(K) is a non-increasing function. We investigate the behavior of b_n(K). We develop bounds on the function in…

The genus non-increasing totally positive unknotting number is the minimum number of crossing changes that transform a knot into the unknot, such that all the crossing changes are positive-to-negative crossing changes that do not increase…

For a complex surface of general type with a relatively minimal genus 2 fibration, the bounds of the orders of the automorphism group of the fibration, of its abelian subgroups and of its cyclic subgroups are determined as linear functions…

Designing algorithms that generate networks with a given degree sequence while varying both subgraph composition and distribution of subgraphs around nodes is an important but challenging research problem. Current algorithms lack control of…