相关论文: The Honeymoon Oberwolfach Problem: small cases

For each n greater than 7 we explicitly construct a sequence of Stein manifolds diffeomorphic to complex affine space of dimension n so that there is no algorithm to tell us in general whether a given such Stein manifold is symplectomorphic…

We consider a Two-Bar Charts Packing Problem (2-BCPP), in which it is necessary to pack two-bar charts (2-BCs) in a unit-height strip of minimum length. The problem is a generalization of the Bin Packing Problem (BPP). Earlier, we proposed…

We first review our previous work arxiv:1503.02993 [math-ph] where we considered a model for topological recursion based on the Hopf Algebra of planar binary trees of Loday and Ronco and showed that extending this Hopf Algebra by…

A classical diffusion model of Ehrenfest which consists of $2$-urns and $n$-balls is realized by a finite Gelfand pair $(H_{n},S_{n})$, where $H_{n}$ is the hyperoctahedral group and $S_{n}$ is the symmetric group. This fact can be…

We present an approximate method for solving nonlinear control problems over long time horizons, in which the full nonlinear model is preserved over an initial part of the horizon, while the remainder of the horizon is modeled using a…

We consider the problem of constructing a cyclic listing of all bitstrings of length $2n+1$ with Hamming weights in the interval $[n+1-\ell,n+\ell]$, where $1\leq \ell\leq n+1$, by flipping a single bit in each step. This is a far-ranging…

Microresonator frequency combs, essential for future integrated optical systems, rely on dissipative Kerr solitons generated in a single microresonator to achieve coherent frequency comb generation. Recent advances in the nanofabrication of…

We consider the model of economic growth with time delayed investment function. Assuming the investment is time distributed we can use the linear chain trick technique to transform delay differential equation system to equivalent system of…

In this article, the phenomenon of delayed Hopf bifurcations (DHB) in reaction-diffusion PDEs is analyzed in the cubic Complex Ginzburg-Landau equation with a slowly-varying parameter. We use the classical asymptotic methods of stationary…

In this paper we analyze a simple mathematical model which describes the interaction between the proteins p53 and Mdm2. For the stationary state we discuss the local stability and the existence of the Hopf bifurcation. Choosing the delay as…

We study a mathematical model describing the dynamics of a pluripotent stem cell population involved in the blood production process in the bone marrow. This model is a differential equation with a time delay. The delay describes the cell…

Rotating waves are periodic solutions in SO(2) equivariant dynamical systems. Their precession frequency changes with parameters and it may change sign, passing through zero. When this happens, the dynamical system is very sensitive to…

This paper introduces and solves the Generalized Heron-Waist Problem (GHWP), that integrates the classical Heron problem of optimal hub location and the waist problem of minimal-perimeter configuration. The GHWP seeks an optimal closed…

Let $G: S^{4n-1} \rightarrow S^{2n}$ be a map with nonzero Hopf Invariant. Using the generalized Hopf invariant introduced by Haj\l{}asz, Schikorra and Tyson, we show that any null-homotopy $F: B^{4n} \rightarrow B^{2n+1}$ of $G$ with small…

An unweighted, undirected graph $G$ on $n$ nodes is said to have \emph{bandwidth} at most $k$ if its nodes can be labelled from $0$ to $n - 1$ such that no two adjacent nodes have labels that differ by more than $k$. It is known that one…

A fundamental problem in shape matching and geometric similarity is computing the maximum area overlap between two polygons under translation. For general simple polygons, the best-known algorithm runs in $O((nm)^2 \log(nm))$ time [Mount,…

Given two maps between smooth manifolds, the obstruction to removing their coincidences (via homotopies) is measured by minimum numbers. In order to determine them we introduce and study an infinite hierarchy of Nielsen numbers N_i, i = 0,…

The SetCover problem has been extensively studied in many different models of computation, including parallel and distributed settings. From an approximation point of view, there are two standard guarantees: an $O(\log…

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the…

Let $p_t(a,b;n)$ denote the number of partitions of $n$ such that the number of $t$ hooks is congruent to $a \bmod{b}$. For $t\in \{2, 3\}$, arithmetic progressions $r_1 \bmod{m_1}$ and $r_2 \bmod{m_2}$ on which $p_t(r_1,m_1; m_2 n + r_2)$…