中文
相关论文

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

200 篇论文

The vector Riemann-Hilbert problem is analyzed when the entries of its matrix coefficient are meromorphic and almost periodic functions. Three cases for the meromorphic functions, when they have (i) a finite number of poles and zeros…

数学物理 · 物理学 2016-02-17 Yuri A. Antipov

When $s\ge k\ge 3$ and $n_1,\ldots ,n_k$ are large natural numbers, denote by $A_{s,k}(\mathbf n)$ the number of solutions in non-negative integers $\mathbf x$ to the system \[ x_1^j+\ldots +x_s^j=n_j\quad (1\le j\le k). \] Under…

数论 · 数学 2022-01-11 Trevor D. Wooley

Let $H$ be a fixed undirected graph on $k$ vertices. The $H$-hitting set problem asks for deleting a minimum number of vertices from a given graph $G$ in such a way that the resulting graph has no copies of $H$ as a subgraph. This problem…

数据结构与算法 · 计算机科学 2020-12-01 Noah Brüstle , Tal Elbaz , Hamed Hatami , Onur Kocer , Bingchan Ma

In this paper we deduce a formula for the fractional Laplace operator $(-\Delta)^{s}$ on radially symmetric functions useful for some applications. We give a criterion of subharmonicity associated with $(-\Delta)^{s}$, and apply it to a…

偏微分方程分析 · 数学 2012-03-15 Fausto Ferrari , Igor E. Verbitsky

In this paper, we give the following result: If $D$ is a digraph of order $n$, and if $d_{D}^{+}(u) + d_{D}^{-}(v) \ge n$ for every two distinct vertices $u$ and $v$ with $(u, v) \notin A(D)$, then $D$ has a directed $2$-factor with exactly…

组合数学 · 数学 2017-08-03 Shuya Chiba , Tomoki Yamashita

Riemann-Hilbert problems are jump problems for holomorphic functions along given interfaces. They arise in various contexts, e.g. in the asymptotic study of certain nonlinear partial differential equations and in the asymptotic analysis of…

复变函数 · 数学 2024-04-05 Haakan Hedenmalm

We construct new resolvable decompositions of complete multigraphs and complete equipartite multigraphs into cycles of variable lengths (and a perfect matching if the vertex degrees are odd). We develop two techniques: {\em layering}, which…

组合数学 · 数学 2018-09-26 Amin Bahmanian , Mateja Šajna

A unitary perfect number is a positive integer n satisfying \sigma^*(n)=2n, where \sigma^* sums unitary divisors. Only five examples are known, and no sixth has been found. We revisit the Subbarao-Warren problem by keeping the seed factor…

数论 · 数学 2026-05-26 Tom Maciejewski

Two permutations $s$ and $t$ are $k$-similar if they can be decomposed into subpermutations $s^1, \ldots, s^k$ and $t^1, \ldots, t^k$ such that $s^i$ is order-isomorphic to $t^i$ for all $i$. Recently, Dudek, Grytczuk and Ruci\'nski posed…

Let C be the class of compact 2n-dimensional symplectic manifolds M for which the first or (n-1) Chern class vanish. We point out an integer optimization problem to find a lower bound B(n) on the number of equilibrium points of…

辛几何 · 数学 2013-07-26 Álvaro Pelayo , Silvia Sabatini

We study the Hamilton-Jacobi formulation of effective mechanical actions associated with holographic renormalization group flows when the field theory is put on the sphere and mass terms are turned on. Although the system is supersymmetric…

高能物理 - 理论 · 物理学 2020-10-15 Nakwoo Kim , Se-Jin Kim

We provide explicit counterexamples to the so-called Complement Problem in every dimension $n\geq3$, i.e. pairs of non-isomorphic irreducible hypersurfaces $H_1, H_2\subset\mathbb{C}^{n}$ whose complements $\mathbb{C}^{n}\setminus H_1$ and…

代数几何 · 数学 2017-02-13 Pierre-Marie Poloni

We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…

计算复杂性 · 计算机科学 2011-08-09 Michael Kowalczyk , Jin-Yi Cai

We determine, up to a multiplicative constant, the optimal number of random edges that need to be added to a $k$-graph $H$ with minimum vertex degree $\Omega(n^{k-1})$ to ensure an $F$-factor with high probability, for any $F$ that belongs…

In a recent paper, Oliver Riordan shows that for $r \ge 4$ and $p$ up to and slightly larger than the threshold for a $K_r$-factor, the hypergraph formed by the copies of $K_r$ in $G(n,p)$ contains a copy of the binomial random hypergraph…

组合数学 · 数学 2018-07-23 Annika Heckel

In this paper we obtain a Hadamard type formula for simple eigenvalues and an analog to the Rayleigh-Faber-Krahn inequality for a class of nonlocal eigenvalue problems. Such class of equations include among others, the classical nonlocal…

偏微分方程分析 · 数学 2023-04-19 Rafael D. Benguria , Mariel Sáez , Marcone C. Pereira

In this paper, we are concerned with the critical Hartree equation \begin{equation*} \begin{cases} -\Delta u=\left(\displaystyle{\displaystyle{\int_{\Omega}}}\frac{u^{2^{*}_{\mu}}(y)}{|x-y|^{\mu}}dy\right)u^{2^{*}_{\mu}-1}+\varepsilon…

偏微分方程分析 · 数学 2024-02-21 Kefan Pan , Shixin Wen , Jing Yang

We consider the problem of orienting the edges of the $n$-dimensional hypercube so only two different in-degrees $a$ and $b$ occur. We show that this can be done, for two specified in-degrees, if and only if an obvious necessary condition…

组合数学 · 数学 2010-07-15 Joe Buhler , Steve Butler , Ron Graham , Eric Tressler

It is known that for every spatial complete graph on $n\ge 7$ vertices, the summation of the second coefficients of the Conway polynomials over the Hamiltonian knots is congruent to $r_{n}$ modulo $(n-5)!$, where $r_{n} = (n-5)!/2$ if…

几何拓扑 · 数学 2023-12-12 Ryo Nikkuni

We investigate the existence of holomorphic Hartree-Fock solutions using a revised SCF algorithm. We use this algorithm to study the Hartree-Fock solutions for H$_{2}$ and H$_{4}^{2+}$ and report the emergence of holomorphic solutions at…

化学物理 · 物理学 2015-11-20 Hugh G. A. Burton , Alex J. W. Thom