中文
相关论文

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

200 篇论文

Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\bf \#P}-complete even if the graph is known to be planar \cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric…

组合数学 · 数学 2017-07-17 Hazim Michman Trao

Given a critical quantum spin chain described by a conformal field theory (CFT) at long distances, it is crucial to understand the universal conformal data. One most important ingredient is the operator product expansion (OPE) coefficients,…

强关联电子 · 物理学 2023-04-26 Yuhan Liu , Yijian Zou , Shinsei Ryu

Given $K$ arbitrary poles, which are neither necessarily distinct nor bounded, on the extended real line, a corresponding ordered base of rational functions orthogonal with respect to varying exponential weights is constructed: this gives…

经典分析与常微分方程 · 数学 2019-12-03 A. Vartanian , X. Zhou

J. H. C. Whitehead gave an elegant integral formula for the Hopf invariant H(p) of a smooth map p from the 3-sphere to the 2-sphere. Given an open book structure b on the 3-sphere (or, essentially equivalently, an isolated critical point of…

几何拓扑 · 数学 2009-12-31 Lee Rudolph

The stable marriage and stable roommates problems have been extensively studied due to their high applicability in various real-world scenarios. However, it might happen that no stable solution exists, or stable solutions do not meet…

计算机科学与博弈论 · 计算机科学 2022-04-29 Kristóf Bérczi , Gergely Csáji , Tamás Király

Algorithmic solutions to the conjugacy problem in the braid groups B_n were given by Elrifai-Morton in 1994 and by the authors in 1998. Both solutions yield two conjugacy class invariants which are known as `inf' and `sup'. A problem which…

几何拓扑 · 数学 2007-05-23 Joan S. Birman , Ki Hyoung Ko , Sang Jin Lee

The stable allocation problem is a many-to-many generalization of the well-known stable marriage problem, where we seek a bipartite assignment between, say, jobs (of varying sizes) and machines (of varying capacities) that is "stable" based…

数据结构与算法 · 计算机科学 2014-11-26 Ágnes Cseh , Brian C. Dean

Let $M$ be a closed orientable $(n-1)$-connected $(2n+2)$-manifold, $n\geq 2$. In this paper we combine the Postnikov tower of spheres and the homotopy decomposition of the reduced suspension space $\Sigma M$ to investigate the cohomotopy…

代数拓扑 · 数学 2025-05-07 Pengcheng Li , Jianzhong Pan , Jie Wu

The present paper introduces the concept of monotone Hopf-harmonics in $2D$ as an alternative to harmonic homeomorphisms. It opens a new area of study in Geometric Function Theory (GFT). Much of the foregoing is motivated by the principle…

复变函数 · 数学 2018-12-10 Tadeusz Iwaniec , Jani Onninen

A mixed graph $\widetilde{G}$ is obtained by orienting some edges of a graph $G$, where $G$ is the underlying graph of $\widetilde{G}$. Let $r(\widetilde{G})$ be the $H$-rank of $\widetilde{G}$. Denote by $r(G)$, $\kappa(G)$, $m(G)$ and…

组合数学 · 数学 2025-07-08 Qi Wu , Yong Lu

This paper studies the number of limit cycles, known as the Smale-Pugh problem, for the generalized Abel equation \begin{align*} \frac{dx}{d\theta}=A(\theta)x^p+B(\theta)x^q, \end{align*} where $A$ and $B$ are are piecewise trigonometrical…

经典分析与常微分方程 · 数学 2026-03-27 Haihua Liang , Jianfeng Huang

We consider the problem of existence of perfect $2$-colorings in the Doob graphs $D(m,n)$ and $4$-ary Hamming graphs $H(n,4)$. We characterize all parameters for which multifold $1$-perfect code in $D(m,n)$ exists. Also, we prove that for…

组合数学 · 数学 2023-12-13 Evgeny Bespalov

In this work, we present a constant-round algorithm for the $2$-ruling set problem in the Congested Clique model. As a direct consequence, we obtain a constant round algorithm in the MPC model with linear space-per-machine and optimal total…

数据结构与算法 · 计算机科学 2023-10-11 Mélanie Cambus , Fabian Kuhn , Shreyas Pai , Jara Uitto

The well-known middle levels problem is to find a Hammiltonian cycle in the graph induced from the binary Hamming graph $\cH_2(2k+1)$ by the words of weight $k$ or $k+1$. In this paper we define the $q$-analog of the middle levels problem.…

组合数学 · 数学 2014-03-13 Tuvi Etzion

We study the supersaturation problems of oddtown and eventown. Given a family $\mathcal A$ of subsets of an $n$ element set, let $op(\mathcal A)$ denote the number of distinct pairs $A,B\in \mathcal A$ for which $|A \cap B|$ is odd. We show…

组合数学 · 数学 2023-07-18 Xin Wei , Yuhao Zhao , Xiande Zhang , Gennian Ge

In the rendezvous problem, two computing entities (called \emph{agents}) located at different vertices in a graph have to meet at the same vertex. In this paper, we consider the synchronous \emph{neighborhood rendezvous problem}, where the…

分布式、并行与集群计算 · 计算机科学 2022-03-14 Ryota Eguchi , Naoki Kitamura , Taisuke Izumi

We use Richter's $2$-primary proof of Gray's conjecture to give a homotopy decomposition of the fibre $\Omega^3S^{17}\{2\}$ of the $H$-space squaring map on the triple loop space of the $17$-sphere. This induces a splitting of the mod-$2$…

代数拓扑 · 数学 2019-08-16 Steven Amelotte

The Wiener-Hopf equations are a Toeplitz system of linear equations that naturally arise in several applications in time series. These include the update and prediction step of the stationary Kalman filter equations and the prediction of…

统计理论 · 数学 2022-01-19 Suhasini Subba Rao , Junho Yang

In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…

离散数学 · 计算机科学 2010-07-29 Zan Pan

Nonresonant Hopf-Hopf singularity in neutral functional differential equation (NFDE) is considered. An algorithm for calculating the third-order normal form is established by using the formal adjoint theory, center manifold theorem and the…

动力系统 · 数学 2014-02-04 Ben Niu , Weihua Jiang