Related papers: $k$-noncrossing RNA structures with arc-length $\g…

We show that the bridge number of a $t$ bridge knot in $S^3$ with respect to an unknotted genus $t$ surface is bounded below by a function of the distance of the Heegaard splitting induced by the $t$ bridges. It follows that for any natural…

The non-orientable 4-genus of a knot $K$ in $S^{3}$, denoted $\gamma_4(K)$, measures the minimum genus of a non-orientable surface in $B^{4}$ bounded by $K$. We compute bounds for the non-orientable 4-genus of knots $T_{5, q}$ and $T_{6,…

We construct a minimalist model of RNA secondary-structure formation and use it to study the mapping from sequence to structure. There are strong, qualitative differences between two-letter and four or six-letter alphabets. With only two…

In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod…

The tree spanner problem for a graph $G$ is as follows: For a given integer $k$, is there a spanning tree $T$ of $G$ (called a tree $k$-spanner) such that the distance in $T$ between every pair of vertices is at most $k$ times their…

Formation of base pairs between the nucleotides of an RNA sequence gives rise to a complex and often highly branched RNA structure. While numerous studies have demonstrated the functional importance of the high degree of RNA branching --…

In this paper, we use semidefinite programming and representation theory to compute new lower bounds on the crossing number of the complete bipartite graph $K_{m,n}$, extending a method from de Klerk et al. [SIAM J. Discrete Math. 20…

We introduce the notion of \emph{stab number} and \emph{exact stab number} of rectangle intersection graphs, otherwise known as graphs of boxicity at most 2. A graph $G$ is said to be a \emph{$k$-stabbable rectangle intersection graph}, or…

A $k$-spanner of a graph $G$ is a sparse subgraph $H$ whose shortest path distances match those of $G$ up to a multiplicative error $k$. In this paper we study spanners that are resistant to faults. A subgraph $H \subseteq G$ is an $f$…

Consider the network of all secondary structures of a given RNA sequence, where nodes are connected when the corresponding structures have base pair distance one. The expected degree of the network is the average number of neighbors, where…

A graph construction that produces a k-regular graph on n vertices for any choice of k >= 3 and n = m(k+1) for integer m >= 2 is described. The number of Hamiltonian cycles in such graphs can be explicitly determined as a function of n and…

There are two properties shared by all known crossing-minimizing geometric drawings of $K_n$, for $n$ a multiple of 3. First, the underlying $n$-point set of these drawings has exactly $3\binom{k+2}{2}$ $(\le k)$-edges, for all $0\le k <…

We introduce k-crossings and k-nestings of permutations. We show that the crossing number and the nesting number of permutations have a symmetric joint distribution. As a corollary, the number of k-noncrossing permutations is equal to the…

The simultaneous crossing number is a new knot invariant which is defined for strongly invertible knots having diagrams with two orthogonal transvergent axes of strong inversions. Because the composition of the two inversions gives a cyclic…

For Tur\'an's (3, 4)-conjecture, in the case of n = 3k+1 vertices, (.5)6^{k-1} non-isomorphic complexes are constructed that attain the conjecture. In the case of n = 3k+2 vertices, 6^{k-1} non-isomorphic complexes are constructed that…

A family of $k$-element subsets of an $n$-element set is called 3-wise intersecting if any three members in the family have non-empty intersection. We determine the maximum size of such families exactly or asymptotically. One of our results…

We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its…

Non-coding RNA are functional molecules that are not translated into proteins. Their function comes as important regulators of biological function. Because they are not translated, they need not be as stable as other types of RNA. The TKF91…

Let $k\ge d\ge 3$ be fixed. Let $\mathcal{F}$ be a $k$-uniform family on $[n]$. Then $\mathcal{F}$ is $(d,s)$-conditionally intersecting if it does not contain $d$ sets with union of size at most $s$ and empty intersection. Answering a…

A $k$-matching $M$ of a graph $G=(V,E)$ is a subset $M\subseteq E$ such that each connected component in the subgraph $F = (V,M)$ of $G$ is either a single-vertex graph or $k$-regular, i.e., each vertex has degree $k$. In this contribution,…