Related papers: Pseudoknot RNA structures with arc-length $\ge 4$

A package for the Sage computer algebra system is developed for checking feasibility of a given intersection array for a distance-regular graph. We use this tool to show that there is no distance-regular graph with intersection array…

A construction of Alon and Krivelevich gives highly pseudorandom $K_k$-free graphs on $n$ vertices with edge density equal to $\Theta(n^{-1/(k -2)})$. In this short note we improve their result by constructing an infinite family of highly…

We extend the reciprocity method of Jones and Remmel to study generating functions of the form $$\sum_{n \geq 0} \frac{t^n}{n!} \sum_{\sigma \in \mathcal{NM}_n(\Gamma)}x^{\mathrm{LRmin}(\sigma)}y^{1+\mathrm{des}(\sigma)}$$ where $\Gamma$ is…

We give the asymptotic growth of the number of (multi-)arcs of bounded length between boundary components on complete finite-area hyperbolic surfaces with boundary. Specifically, if $S$ has genus $g$, $n$ boundary components and $p$…

We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator…

Given an RNA sequence a, consider the network G = (V;E), where the set V of nodes consists of all secondary structures of a, and whose edge set E consists of all edges connecting two secondary structures whose base pair distance is 1.…

The generalized Kneser graph $K(n,k,t)$ for integers $k>t>0$ and $n>2k-t$ is the graph whose vertices are the $k$-subsets of $\{1,\dots,n\}$ with two vertices adjacent if and only if they share less than $t$ elements. We determine the…

In this paper we use topological tools to investigate the structure of the algebraic K-groups K_4 (Z[i]) and K_4 (Z[rho]), where i := sqrt{-1} and rho := (1+sqrt{-3})/2. We exploit the close connection between homology groups of GL_n(R) for…

Given a tree T on v vertices and an integer k exceeding one. One can define the k-expansion T^k as a k-uniform linear hypergraph by enlarging each edge with a new, distinct set of (k-2) vertices. Then T^k has v+ (v-1)(k-2) vertices. The aim…

The structure tensor of $\mathfrak{sl}_n$, denoted $T_{\mathfrak{sl}_n}$, is the tensor arising from the Lie bracket bilinear operation on the set of traceless $n \times n$ matrices over $\mathbb{C}$. This tensor is intimately related to…

Gallai asked in 1984 if any $k$-critical graph on $n$ vertices contains at least $n$ distinct $(k-1)$-critical subgraphs. The answer is trivial for $k\leq 3$. Improving a result of Stiebitz, Abbott and Zhou proved in 1995 that for all…

Given a graph $G=(V,E)$ and a set $S_0\subseteq V$, an irreversible $k$-threshold conversion process on $G$ is an iterative process wherein, for each $t=1,2,\dots$, $S_t$ is obtained from $S_{t-1}$ by adjoining all vertices that have at…

We study the triangular array defined by the Graham--Knuth--Patashnik recurrence $T(n,k) = (\alpha n + \beta k + \gamma)\, T(n-1,k)+(\alpha' n + \beta' k + \gamma') \, T(n-1,k-1)$ with initial condition $T(0,k) = \delta_{k0}$ and parameters…

We report on new numerical computations of the set of self-contacts in tightly knotted tubes of uniform circular cross-section. Such contact sets have been obtained before for the trefoil and figure eight knots by simulated annealing -- we…

We explain a discontinuous drop in the exponential growth rate for certain multivariate generating functions at a critical parameter value, in even dimensions d at least 4. This result depends on computations in the homology of the…

Let $K_{m}-H$ be the graph obtained from $K_{m}$ by removing the edges set $E(H)$ of the graph $H$ ($H$ is a subgraph of $K_{m}$). We use the symbol $Z_4$ to denote $K_4-P_2.$ A sequence $S$ is potentially $K_{m}-H$-graphical if it has a…

In the \emph{$k$-Diameter-Optimally Augmenting Tree Problem} we are given a tree $T$ of $n$ vertices as input. The tree is embedded in an unknown \emph{metric} space and we have unlimited access to an oracle that, given two distinct…

New results on pentagonal geometries PENT(k,r) with block sizes k = 3 or k = 4 are given. In particular we completely determine the existence spectra for PENT(3,r) systems with the maximum number of opposite line pairs as well as those…

When $k$ is a constant at least $3$, a sequence $S$ of positive integers is called $k$-GP-free if it contains no nontrivial $k$-term geometric progressions. Beiglb\"ok, Bergelson, Hindman and Strauss first studied the existence of a $…

In this paper we analyze the length-spectrum of rainbows in RNA secondary structures. A rainbow in a secondary structure is a maximal arc with respect to the partial order induced by nesting. We show that there is a significant gap in this…