Related papers: Resolution of the Oberwolfach problem

We show that every n-by-n matrix is generically a product of [n/2] + 1 Toeplitz matrices and always a product of at most 2n+5 Toeplitz matrices. The same result holds true if the word "Toeplitz" is replaced by "Hankel", and the generic…

A fundamental theorem of Whitney from 1933 asserts that 2-connected graphs G and H are 2-isomorphic, or equivalently, their cycle matroids are isomorphic, if and only if G can be transformed into H by a series of operations called Whitney…

We study the copolynomials of $n$ variables, i.e. $K$-linear mappings from the ring of polynomials $K[x_1,...,x_n]$ into the commutative ring $K$. We prove an existence and uniqueness theorem for a linear differential equation of infinite…

This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…

Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…

In 1963, Anton Kotzig conjectured that for each $n \geq 2$ the complete graph $K_{2n}$ has a perfect one-factorisation (i.e., a decomposition into perfect matchings such that each pair of perfect matchings of the decomposition induces a…

In this paper we present an overview of recent progress on the development and analysis of domain decomposition preconditioners for discretised Helmholtz problems, where the preconditioner is constructed from the corresponding problem with…

The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm. It is randomized and takes $\widetilde{O}(n^{3/2}\log q + n…

We consider two decomposition problems in directed graphs. We say that a digraph is $k$-bounded for some $k \in \mathbb{Z}_{\geq 1}$ if each of its connected components contains at most $k$ arcs. For the first problem, a directed linear…

Analogous to the famous Euler angle parametrization in three-dimensional Euclidean space, a reflection-free Lorentz transformation in (2+1)-dimensional Minkowski space can be decomposed into three simple parts. Applying this decomposition…

In 2014, Keevash proved the existence of $(n,q,r)$-Steiner systems (equivalently $K_q^r$-decompositions of $K_n^r$) for all large enough $n$ satisfying the necessary divisibility conditions. In 2021, Glock, K\"uhn, and Osthus proposed a…

Erd\H{o}s and Hajnal proposed a problem that: is it true that every $(2n+1)$-vertex graph with $n^2+n+1$ edges contains two vertices of equal degree connected by a path of length three? The edge bound is sharp by the complete bipartite…

Polynomial algorithms are given for the following two problems: given a graph with $n$ vertices and $m$ edges, where $m \ge 3 n^{3/2}$, find a complete balanced bipartite subgraph with parts about $\ln n/(\ln (n^2/m))$, given a graph with…

In this paper, we revisit Radlow's highly original attempt at a double Wiener-Hopf solution to the canonical problem of wave diffraction by a quarter-plane. Using a constructive approach, we reduce the problem to two equations, one…

Here we chronologically summarize briefly the developments of the Levi (Hartogs' Inverse) Problem together with the notion of coherence and its solution, shedding light on some records which have not been discussed in the past references.…

We give an algorithm with complexity $O(f(R)^{k^2} k^3 n)$ for the integer multiflow problem on instances $(G,H,r,c)$ with $G$ an acyclic planar digraph and $r+c$ Eulerian. Here, $f$ is a polynomial function, $n = |V(G)|$, $k = |E(H)|$ and…

In 1946, Garrett Birkhoff proved that the $n\times n$ doubly stochastic matrices comprise the convex hull of the $n\times n$ permutation matrices, which in turn make up the extreme points of this polytope. He proposed his problem 111, which…

In [18], fundamental solutions for the generalized bi-axially symmetric Helmholtz equation were constructed in $R_2^ + = \left\{ {\left( {x,y} \right):x > 0,y > 0} \right\}.$ They contain Kummer's confluent hypergeometric functions in three…

In this paper we consider a twofold Ellis-Gohberg type inverse problem in an abstract *-algebraic setting. Under natural assumptions, necessary and sufficient conditions for the existence of a solution are obtained, and it is shown that in…

Given an positive integer $k$, let $n:=\binom{k+1}{2}$. In 2012, during a talk at UCLA, Jan Saxl conjectured that all irreducible representations of the symmetric group $S_n$ occur in the decomposition of the tensor square of the…