相关论文: The Honeymoon Oberwolfach Problem: small cases
The matching problem for a given Jordan curve in the complex plane asks to find two nonconstant functions, one analytic in the bounded complementary component of the curve and the other analytic in the unbounded complementary component of…
The sequence reconstruction problem asks for the recovery of a sequence from multiple noisy copies, where each copy may contain up to $r$ errors. In the case of permutations on \(n\) letters under the Hamming metric, this problem is closely…
Multi-modal multi-objective optimization problems (MMMOPs) have multiple subsets within the Pareto-optimal Set, each independently mapping to the same Pareto-Front. Prevalent multi-objective evolutionary algorithms are not purely designed…
Optimized Pulse Patterns (OPPs) are gaining increasing popularity in the power electronics community over the well-studied pulse width modulation due to their inherent ability to provide the switching instances that optimize current…
We present a complete computational tabulation of all 961,619,972 P-positions in 4xn Chomp for n <= 3000, obtained via a new O(n^4) shadow-array sieve that replaces the O(n^5) hash-set approach of prior work. Three structural results are…
The spectrum-rich millimeter wave (mmWave) frequencies have the potential to alleviate the spectrum crunch that the wireless and cellular operators are already experiencing. However, compared with traditional wireless communication in the…
We study the reconfiguration of odd matchings of combinatorial graphs. Odd matchings are matchings that cover all but one vertex of a graph. A reconfiguration step, or flip, is an operation that matches the isolated vertex and,…
We study the asymptotics as $p\uparrow 2$ of stationary $p$-harmonic maps $u_p\in W^{1,p}(M,S^1)$ from a compact manifold $M^n$ to $S^1$, satisfying the natural energy growth condition $$\int_M|du_p|^p=O(\frac{1}{2-p}).$$ Along a…
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…
We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…
An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be…
The Hamilton-Waterloo problem with uniform cycle sizes asks for a $2-$ factorization of the complete graph $K_v$ (for odd {\em v}) or $K_v$ minus a $1-$factor (for even {\em v}) where $r$ of the factors consist of $n-$cycles and $s$ of the…
We revisit the 't Hooft expansion of 1/2 BPS circular Wilson loop in N=4 SYM studied by Drukker and Gross in hep-th/0010274. We find an interesting recursion relation which relates different number of holes on the worldsheet. We also argue…
It is conjectured that for every pair $(\ell,m)$ of odd integers greater than 2 with $m \equiv 1\; \pmod{\ell}$, there exists a cyclic two-factorization of $K_{\ell m}$ having exactly $(m-1)/2$ factors of type $\ell^m$ and all the others of…
Boolean-width is a recently introduced graph parameter. Many problems are fixed parameter tractable when parametrized by boolean-width, for instance "Minimum Weighted Dominating Set" (MWDS) problem can be solved in $O^*(2^{3k})$ time given…
We study the dynamics of a delayed predator-prey system with Holling type II functional response, focusing on the interplay between time delay and carrying capacity. Using local and global Hopf bifurcation theory, we establish the existence…
This paper gives a complete selfcontained proof of our result announced in hep-th/9909126 showing that renormalization in quantum field theory is a special instance of a general mathematical procedure of extraction of finite values based on…
Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of covering type. In spite of their widespread use, these…
Recently, some hypergraph-based methods have been proposed to deal with the problem of model fitting in computer vision, mainly due to the superior capability of hypergraph to represent the complex relationship between data points. However,…
In this paper we consider the fundamental problem of finding subgraphs in highly dynamic distributed networks - networks which allow an arbitrary number of links to be inserted / deleted per round. We show that the problems of $k$-clique…