Related papers: Infinitely many standard trisection diagrams for G…

Let $k\geq 3$ be an integer and $G$ be a very well-covered graph with ${\rm odd-girth}(G)\geq 2k+1$. Assume that $I(G)$ is the edge ideal of $G$. We show that for every integer $s$ with $1\leq s\leq k-2$, we have ${\rm…

Distortion maps are a useful tool for pairing based cryptography. Compared with elliptic curves, the case of hyperelliptic curves of genus g > 1 is more complicated since the full torsion subgroup has rank 2g. In this paper we prove that…

For every odd integer $N$ we give an explicit construction of a polynomial curve $\cC(t) = (x(t), y (t))$, where $\deg x = 3$, $\deg y = N + 1 + 2\pent N4$ that has exactly $N$ crossing points $\cC(t_i)= \cC(s_i)$ whose parameters satisfy…

We give a complete characterization of the topological slice status of odd 3-strand pretzel knots, proving that an odd 3-strand pretzel knot is topologically slice if and only if either it is ribbon or has trivial Alexander polynomial. (By…

Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a special kind of simple drawings that we call generalized…

The Pontryagin dual of the twisted Alexander module for a d-component link and GL(N,Z) representation is an algebraic dynamical system with an elementary description in terms of colorings of a diagram. In the case of a knot, its associated…

A normal 5-edge-coloring of a cubic graph is a coloring such that for every edge the number of distinct colors incident to its end-vertices is 3 or 5 (and not 4). The well known Petersen Coloring Conjecture is equivalent to the statement…

In this article it is proven that if a knot, K, bounds an imbedded grope of class n, then the knot is n/2-trivial in the sense of Gusarov and Stanford. That is, all type n/2 invariants vanish on K. We also give a simple way to construct all…

Let $P_4$ denote the path graph on $4$ vertices. The suspension of $P_4$, denoted by $\widehat P_4$, is the graph obtained via adding an extra vertex and joining it to all four vertices of $P_4$. In this note, we demonstrate that for $n\ge…

We present a new family of hook-length formulas for the number of standard increasing tableaux which arise in the study of factorial Grothendieck polynomials. In the case of straight shapes our formulas generalize the classical hook-length…

The generalized Tur\'an number for $H$ of $G$, denoted by $\ex(n,H,G)$, is the maximum number of copies of $H$ in an $n$-vertex $G$-free graph. When $H$ is an edge, $\ex(n,H,G)$ is the classical Tur\'an number $\ex(n,G)$. Let $P_k$ be the…

We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1…

We give a new characterization of symplectic surfaces in CP^2 via bridge trisections. Specifically, a minimal genus surface in CP^2 is smoothly isotopic to a symplectic surface if and only if it is smoothly isotopic to a surface in…

We show that twisted torus knots $T(p,q,3,s)$ are tunnel number one. A short spanning arc connecting two adjacent twisted strands is an unknotting tunnel.

Let $X$ (resp. $Y$) be a curve of genus 1 (resp. 2) over a base field $k$ whose characteristic does not equal 2. We give criteria for the existence of a curve $Z$ over $k$ whose Jacobian is up to twist (2,2,2)-isogenous to the products of…

Tuza (1981) conjectured that the size $\tau(G)$ of a minimum set of edges that intersects every triangle of a graph $G$ is at most twice the size $\nu(G)$ of a maximum set of edge-disjoint triangles of $G$. In this paper we present three…

Given knots K and J, one can ask whether a single smoothing of a crossing in a diagram for K can convert it into a diagram for J. As an interesting example, Zekovic discovered that the torus knot T(2,5) can be converted into T(2,-5) with a…

We develop a technique for gluing relative trisection diagrams of $4$-manifolds with nonempty connected boundary to obtain trisection diagrams for closed $4$-manifolds. As an application, we describe a trisection of any closed $4$-manifold…

We adapt Seifert's algorithm for classical knots and links to the setting of tri-plane diagrams for bridge trisected surfaces in the 4-sphere. Our approach allows for the construction of a Seifert solid that is described by a Heegaard…

We give diagrammatic algorithms for computing the group trisection, homology groups, and intersection form of a closed, orientable, smooth 4-manifold, presented as a branched cover of a bridge-trisected surface in $\mathbb{S}^{4}$. The…