Related papers: Resolution of the Oberwolfach problem

In this article, we approach the Arnold corank problem, posed by Arnold in 1975, which asks whether the corank of holomorphic functions is an ambient topological invariant. Here, we obtain a complete positive answer to the metric Arnold…

Witten- Helffer-Sj\"ostrand theory is a considerable addition to the De Rham- Hodge theory for Riemannian manifolds and can serve as a general tool to prove results about comparison of numerical invariants associated to compact manifolds…

In 1967, Schmidt wrote a seminal paper [10] on heights of subspaces of R n or C n defined over a number field K, and diophantine approximation problems. The going-down Theorem -- one of the main theorems he proved in his paper -- remains…

We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \eps in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If…

We give an algebraic, determinant-based algorithm for the K-Cycle problem, i.e., the problem of finding a cycle through a set of specified elements. Our approach gives a simple FPT algorithm for the problem, matching the $O^*(2^{|K|})$…

We provide a deterministic polynomial-time algorithm that, for a given $k$-uniform hypergraph $H$ with $n$ vertices and edge density $d$, finds a complete $k$-partite subgraph of $H$ with parts of size at least ${c(d, k)(\log…

We solve a physically significant extension of a classic problem in the theory of diffusion, namely the Ornstein-Uhlenbeck process [G. E. Ornstein and L. S. Uhlenbeck, Phys. Rev. 36, 823, (1930)]. Our generalised Ornstein-Uhlenbeck systems…

The oscillatory waves require sufficient degrees of freedom to resolve. That restriction usually applies also to coarse problems for Schwarz methods. The resulting coarse problem is then too large. To address the issue, a new form of…

In this paper, we apply the Dirichlet convolution method to \begin{equation*} T_{k}(x)=\sum_{n \leq x} d_{k}(n), \end{equation*} for $k\ge 3$, where $d_{k}(n)$ is the number of ways to represent $n$ as a product of $k$ positive integer…

We develop a Helmholtz-like theorem for differential forms in Euclidean space $E_{n}$ using a uniqueness theorem similar to the one for vector fields. We then apply it to Riemannian manifolds, $R_{n}$, which, by virtue of the…

The problem of reconstruction of an unknown refractive index $k(x)$ of an inhomogeneous solid $P$ is considered. The refractive index is assumed to be a piecewise-H\"{o}lder function The original boundary value problem for the Helmholtz…

In 1996, in his last paper, Erd\H{o}s asked the following question that he formulated together with Faudree: is there a positive $c$ such that any $(n+1)$-regular graph $G$ on $2n$ vertices contains at least $c 2^{2n}$ distinct…

We consider the relation of the multi-component 2D Toda hierarchy with matrix orthogonal and biorthogonal polynomials. The multi-graded Hankel reduction of this hierarchy is considered and the corresponding generalized matrix orthogonal…

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

A hierarchy of integrable hamiltonian nonlinear ODEs is associated with any decomposition of the Lie algebra of Laurent series with coefficients being elements of a semi-simple Lie algebra into a sum of the subalgebra consisting of the…

Kim, K\"uhn, Osthus and Tyomkyn (Trans. Amer. Math. Soc. 371 (2019), 4655--4742) greatly extended the well-known blow-up lemma of Koml\'os, S\'ark\"ozy and Szemer\'edi by proving a `blow-up lemma for approximate decompositions' which states…

In this paper, we obtain a sharp upper bound for the sum of the first $k$-th eigenvalues for this Dirichlet problem of poly-Laplacian with any order, which is viewed as an extension of the result due to Cheng and Wei (Journal of…

We consider the algorithmic problem of generating each subset of $[n]:=\{1,2,\ldots,n\}$ whose size is in some interval $[k,l]$, $0\leq k\leq l\leq n$, exactly once (cyclically) by repeatedly adding or removing a single element, or by…

This paper concerns a long-standing problem raised by Beurling and Wintner on completeness of the dilation system $\{\varphi(kx):k=1,2,\cdots\}$ generated by the odd periodic extension on $\mathbb{R}$ of any $\varphi\in L^2[0,1]$. Up to now…

The $k$-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed $k$ when restricted to the class of planar…