Related papers: Pseudoknot RNA structures with arc-length $\ge 4$
In this paper we consider the problem of RNA folding with pseudoknots. We use a graphical representation in which the secondary structures are described by planar diagrams. Pseudoknots are identified as non-planar diagrams. We analyze the…
We construct an injection from the set of permutations of length $n$ that contain exactly one copy of the decreasing pattern of length $k$ to the set of permutations of length $n+2$ that avoid that pattern. We then prove that the generating…
RNA pseudoknots are a kind of minimal RNA tertiary structural motifs, and their three-dimensional (3D) structures and stability play essential roles in a variety of biological functions. Therefore, to predict 3D structures and stability of…
We study the minimum size $f$ of a feedback vertex set in directed and undirected $n$-vertex graphs of given degeneracy or treewidth. In the undirected setting the bound $\frac{k-1}{k+1}n$ is known to be tight for graphs with bounded…
Counterterms that are not reducible to $\zeta_{n}$ are generated by ${}_3F_2$ hypergeometric series arising from diagrams for which triangle and uniqueness relations furnish insufficient data. Irreducible double sums, corresponding to the…
Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in…
Let $\mathrm{PG}(k-1,q)$ be the $(k-1)$-dimensional projective space over the finite field $\mathbb{F}_q$. An arc in $\mathrm{PG}(k-1,q)$ is a set of points with the property that any $k$ of them span the entire space. The notion of…
Recently, Kostochka and Yancey proved that a conjecture of Ore is asymptotically true by showing that every $k$-critical graph satisfies $|E(G)|\geq\left\lceil\left(\frac{k}{2}-\frac{1}{k-1}\right)|V(G)|-\frac{k(k-3)}{2(k-1)}\right\rceil.$…
To an arc $\mathcal{A}$ of $\mathrm{PG}(k-1,q)$ of size $q+k-1-t$ we associate a tensor in $\langle \nu_{k,t}(\mathcal{A})\rangle^{\otimes k-1}$, where $\nu_{k,t}$ denotes the Veronese map of degree $t$ defined on $\mathrm{PG}(k-1,q)$. As a…
Let $S_{g}$ denote the genus $g$ closed orientable surface. For $k\in \mathbb{N}$, a $k$-system is a collection of pairwise non-homotopic simple closed curves such that no two intersect more than $k$ times. Juvan-Malni\v{c}-Mohar…
We report observation of a narrow peak structure at ~1.54 GeV with a Gaussian width sigma=6 MeV in the missing of K_s in the reaction gamma+p = pK_sK_L. The observed structure may be due to the interference between a strange (or…
Two families $\mathcal{F},\mathcal{G}$ of $k$-subsets of $\{1,2,\ldots,n\}$ are called non-trivial cross $t$-intersecting if $|F\cap G|\geq t$ for all $F\in \mathcal{F}, G\in \mathcal{G}$ and $|\cap \{F\colon F\in \mathcal{F}\}|<t$, $|\cap…
We review the properties of characters of the N=4 SCA in the context of a non-linear sigma model on $K3$, how they are used to span the orbits, and how the orbits produce topological invariants like the elliptic genus. We derive the same…
We study the class L of link-types that admit a K4-minor-free diagram, i.e., they can be projected on the plane so that the resulting graph does not contain any subdivision of K4. We prove that L is the closure of a subclass of torus links…
The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate supersaturation extensions, which in this context ask for the…
A {\em pseudo-arc} in $\mathrm{PG}(3n-1,q)$ is a set of $(n-1)$-spaces such that any three of them span the whole space. A pseudo-arc of size $q^n+1$ is a {\em pseudo-oval}. If a pseudo-oval $\mathcal{O}$ is obtained by applying field…
Let $G=C_n\oplus C_n$ and let $k\in [0,n-1]$. We study the structure of sequences of terms from $G$ with maximal length $|S|=2n-2+k$ that fail to contain a nontrivial zero-sum subsequence of length at most $2n-1-k$. For $k\leq 1$, this is…
Combinatorial analysis of a certain abstract of RNA structures has been studied to investigate their statistics. Our approach regards the backbone of secondary structures as an alternate sequence of paired and unpaired sets of nucleotides,…
We consider the K_4-free process. In this process, the edges of the complete n-vertex graph are traversed in a uniformly random order, and each traversed edge is added to an initially empty evolving graph, unless the addition of the edge…
Let ${\rm ex \,} {\mathcal B}$ be a minor-closed class of graphs with a set ${\mathcal B}$ of minimal excluded minors. We study (a) the asymptotic number of graphs without $k+1$ disjoint minors in ${\mathcal B}$ and (b) the properties of a…