Related papers: Pseudoknot RNA structures with arc-length $\ge 4$
Let $G$ be a finitely generated group with a finite generating set $S$. For $g\in G$, let $l_S(g)$ be the length of the shortest word over $S$ representing $g$. The growth series of $G$ with respect to $S$ is the series $A(t) =…
Let $ex(n, P)$ be the maximum possible number of ones in any 0-1 matrix of dimensions $n \times n$ that avoids $P$. Matrix $P$ is called minimally non-linear if $ex(n, P) = \omega(n)$ but $ex(n, P') = O(n)$ for every strict subpattern $P'$…
Motivation: Non-coding RNAs (ncRNAs) express their functions by adopting molecular structures. Specifically, RNA secondary structures serve as a relatively stable intermediate step before tertiary structures, offering a reliable signature…
This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…
We extend previous work by using a combination of band surgeries and known bounds to compute $\gamma_4(T_{4n, (2n\pm1)^2 + 4n-2}) = 2n-1$ for all $n \geq 1$. We further generalize this result by showing that $\gamma_4(T_{4n + 2k, n(4n + 2k)…
For a family $\mathcal{F}$ of graphs, $sat(n,\mathcal{F})$ is the minimum number of edges in a graph $G$ on $n$ vertices which does not contain any of the graphs in $\mathcal{F}$ but such that adding any new edge to $G$ creates a graph in…
Superconductors with non-trivial band topology are emerging as one of the best avenues to study quantum anomalies and experimental realization of Majorana Fermions. This article reports the successful crystal growth of superconducting SnAs,…
Computational prediction of RNA structures is an important problem in computational structural biology. Studies of RNA structure formation often assume that the process starts from a fully synthesized sequence. Experimental evidence,…
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,…
In this paper we study the asymptotic behavior of a structure made of curved rods of thickness 2\delta when \delta rightarrow 0. This study is carried on within the frame of linear elasticity by using the unfolding method. It is based on…
We introduce pseudoconformal structures on 4--dimensional manifolds and study their properties. Such structures are arising from two different complex operators which agree in a 2--dimensional subbundle of the tangent bundle; this subbundle…
Two families $\mathcal{F},\mathcal{G}$ of $k$-subsets of $\{1,2,\ldots,n\}$ are called non-trivial cross-intersecting if $F\cap G\neq \emptyset$ for all $F\in \mathcal{F}, G\in \mathcal{G}$ and $\cap \{F\colon F\in…
An equilateral stick number $s_{=}(K)$ of a knot $K$ is defined to be the minimal number of sticks required to construct a polygonal knot of $K$ which consists of equal length sticks. Rawdon and Scharein [12] found upper bounds for the…
The skewfield K(d) of rational pseudodifferential operators over a differential field K is the skewfield of fractions of the algebra of differential operators K[d]. In our previous paper we showed that any H from K(d) has a minimal…
The Kinetoplast DNA (kDNA) is a two-dimensional Olympic-ring-like network of mutually linked 2.5 kb-long DNA minicircles found in certain parasites called Trypanosomes. Understanding the self-assembly and replication of this structure are…
A set system $\mathcal{F}$ is $t$-\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $\mathcal{F}$ is $k$-\textit{Sperner}, if it does not contain a chain of length…
We prove the following results (1) (2) (3) on relations between $n$-links and their components. (1) Let L=(L_1, L_2) be a (4k+1)-link (4k+1\geq 5). Then we have Arf L=Arf L_1+Arf L_2. (2) Let L=(L_1, L_2) be a (4k+3)-link (4k+3\geq3). Then…
We study the asymptotic behavior of cumulants of lacunary trigonometric sums $S_n(\omega) := \sum_{k=1}^n \cos (2 \pi a_k \omega)$, $\omega\in[0,1]$, and show that cumulant growth is highly sensitive to the arithmetic structure of the…
In 1994, Kranakis et al. published a conjecture about the minimum link-length of every rectilinear covering path for the $k$-dimensional grid $P(n,k) := \{0,1, \dots, n-1\} \times \{0,1, \dots, n-1\} \times \cdots \times \{0,1, \dots,…
We say that two graphs $H_1,H_2$ on the same vertex set are $G$-creating ($G$-different in other papers, this difference is explained in the introduction) if the union of the two graphs contains $G$ as a subgraph. Let $H(n,k)$ be the…