中文
相关论文

相关论文: The Hamilton-Waterloo Problem for Triangle-Factors…

200 篇论文

We prove a complexity dichotomy for a class of counting problems expressible as bipartite 3-regular Holant problems. For every problem of the form $\operatorname{Holant}\left(f\mid =_3 \right)$, where $f$ is any integer-valued ternary…

计算复杂性 · 计算机科学 2021-10-05 Jin-Yi Cai , Austen Z. Fan , Yin Liu

We consider the isomorphism problem for hypergraphs taking as input two hypergraphs over the same set of vertices $V$ and a permutation group $\Gamma$ over domain $V$, and asking whether there is a permutation $\gamma \in \Gamma$ that…

数据结构与算法 · 计算机科学 2022-10-26 Daniel Neuen

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

数论 · 数学 2012-04-10 Victor J. W. Guo , Jiang Zeng

A $1$-factorization of the complete multigraph $\lambda K_{2n}$ is said to be indecomposable if it cannot be represented as the union of $1$-factorizations of $\lambda_0 K_{2n}$ and $(\lambda-\lambda_0) K_{2n}$, where $\lambda_0<\lambda$.…

组合数学 · 数学 2016-11-11 Simona Bonvicini , Gloria Rinaldi

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…

数值分析 · 数学 2018-03-14 Mikhail Medvedik , Yury Smirnov , Aleksei Tsupak

We proposed an algorithm that covers some cases of Hamilton Circuit Problem.

数据结构与算法 · 计算机科学 2018-11-01 Hanlin Liu

A new concept of meromorphic $\Sigma$-factorization, for H\"{o}lder continuous functions defined on a contour $\Gamma$ that is the pullback of $\dot{\mathbb{R}}$ (or the unit circle) in a Riemann surface $\Sigma$ of genus 1, is introduced…

复变函数 · 数学 2011-08-03 M. C. Câmara , M. T. Malheiro

For all integers $k$ with $k\geq 2$, if $G$ is a balanced $k$-partite graph on $n\geq 3$ vertices with minimum degree at least \[…

组合数学 · 数学 2020-05-28 Louis DeBiasio , Nicholas Spanier

Solving Einstein's constraint equations for the construction of black hole initial data requires handling the black hole singularity. Typically, this is done either with the excision method, in which the black hole interior is excised from…

广义相对论与量子宇宙学 · 物理学 2015-06-04 Thomas W. Baumgarte

By using a suitable transform related to Sobolev inequality, we investigate the sharp constants and optimizers in radial space for the following weighted Caffarelli-Kohn-Nirenberg-type inequalities: \begin{equation*}…

偏微分方程分析 · 数学 2022-11-03 Shengbing Deng , Xingliang Tian

The paper extends three results regarding the nth root problem by embedding classes of Hilbert-space operators into the class of posinormal operators. For instance, it is shown that (i) for coposinormal operators, if T is paranormal and T^n…

泛函分析 · 数学 2026-01-13 C. S. Kubrusly , H. M Stankovic

The eigenvalue problem of the spherically symmetric oscillator Hamiltonian is revisited in the context of canonical raising and lowering operators. The Hamiltonian is then factorized in terms of two not mutually adjoint factorizing…

量子物理 · 物理学 2009-02-26 Ivan Cabrera-Munguia , Oscar Rosas-Ortiz

A path factor in a graph $G$ is a factor of $G$ in which every component is a path on at least two vertices. Let $T\Box P_n$ be the Cartesian product of a tree $T$ and a path on $n$ vertices. Kao and Weng proved that $T\Box P_n$ is…

In this article we present the hexagon equations for dilogarithms which come from the analytic continuation of the dilogarithm $\mathrm{Li}_2(z)$ to ${\mathbf P}^1 \setminus {0,1,\infty}$. The hexagon equations are equivalent to the…

经典分析与常微分方程 · 数学 2013-03-14 Shu Oi , Kimio Ueno

In order to obtain solutions to problem $$ {{array}{c} -\Delta u=\dfrac{A+h(x)} {|x|^2}u+k(x)u^{2^*-1}, x\in {\mathbb R}^N, u>0 \hbox{in}{\mathbb R}^N, {and}u\in {\mathcal D}^{1,2}({\mathbb R}^N), {array}. $$ $h$ and $k$ must be chosen…

偏微分方程分析 · 数学 2007-05-23 Boumediene Abdellaoui , Veronica Felli , Ireneo Peral

Following Riley's work, for each 2-bridge link $K(r)$ of slope $r\in\QQ$ and an integer or a half-integer $n$ greater than 1, we introduce the {\it Heckoid orbifold $\orbs(r;n)$} and the {\it Heckoid group $\Hecke(r;n)=\pi_1(\orbs(r;n))$ of…

几何拓扑 · 数学 2012-06-20 Donghi Lee , Makoto Sakuma

The Riemann problem is studied in the case when the unknown function has nonisolated singularities, concentrated on the real axis. The problem is used for the factorization of functions, holomorphic outside of the unit circle and the real…

谱理论 · 数学 2007-05-23 Mikhail Kudryavtsev

We study the determination of the second-order normal form for perturbed Hamiltonians $H_{\epsilon}=H_0 +\epsilon H_1 +\frac{\epsilon^2}{2} H_2$, relative to the periodic flow of the unperturbed Hamiltonian $H_0$. The formalism presented…

数学物理 · 物理学 2014-05-06 M. Avendaño-Camacho , J. A. Vallejo , Yu. Vorobjev

In this paper we present short algebraic proofs of the Linear Conway--Gordon--Sachs and the Linear van Kampen--Flores theorems in the spirit of the Radon theorem on convex hulls. {\bf Theorem.} {\it Take any $n+3$ general position points in…

组合数学 · 数学 2015-08-14 Ilya I. Bogdanov , Alexander D. Matushkin

In this paper, we prove that for each $d \geq 2$, the union of a $d$-regular graph with a uniformly random $2$-factor on the same vertex set is Hamiltonian with high probability. This resolves a conjecture by Dragani\'c and Keevash for all…

组合数学 · 数学 2025-08-26 Cicely , Henderson , Sean Longbrake , Dingjia Mao , Patryk Morawski