中文
相关论文

相关论文: Virial Expansion Bounds Through Tree Partition Sch…

200 篇论文

We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by Koenemann et al. [Math. Programming, 2009]. Specifically, we are interested in proving upper bounds on the…

离散数学 · 计算机科学 2015-05-14 Deeparnab Chakrabarty , Jochen Koenemann , David Pritchard

We investigate the general Porous Medium Equations with drift and source terms that model tumor growth. Incompressible limit of such models has been well-studied in the literature, where convergence of the density and pressure variables are…

偏微分方程分析 · 数学 2024-03-12 Jiajun Tong , Yuming Paul Zhang

Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…

概率论 · 数学 2011-06-30 Richard W. Kenyon , David B. Wilson

We use Hartnell's model for virus spread on a graph, also known as firefighting. For rooted trees, we propose an Unburning Algorithm, a type of greedy algorithm starting from the leaves and working back towards the root. We show that the…

We present some upper and lower bounds for the numerical radius of a bounded linear operator defined on complex Hilbert space, which improves on the existing upper and lower bounds. We also present an upper bound for the spectral radius of…

泛函分析 · 数学 2024-08-13 Pintu Bhunia , Santanu Bag , Kallol Paul

We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…

组合数学 · 数学 2019-03-14 Felix Joos , Jaehoon Kim , Daniela Kühn , Deryk Osthus

The Loop Vertex Expansion (LVE) is a quantum field theory (QFT) method which explicitly computes the Borel sum of Feynman perturbation series. This LVE relies in a crucial way on symmetric tree weights which define a measure on the set of…

数学物理 · 物理学 2014-04-24 Vincent Rivasseau , Adrian Tanasa

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

代数几何 · 数学 2021-07-20 Alexander J. Sutherland

We prove that for a general $N$-component model on a $d$-dimensional lattice $\bZ^d$ with pairwise nearest-neighbor coupling and general local interaction obeying a stability bound the linked cluster expansion has a finite radius of…

高能物理 - 格点 · 物理学 2007-05-23 A. Pordt

Performance of optimization on quadratic problems sensitively depends on the low-lying part of the spectrum. For large (effectively infinite-dimensional) problems, this part of the spectrum can often be naturally represented or approximated…

最优化与控制 · 数学 2024-03-26 Maksim Velikanov , Dmitry Yarotsky

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

最优化与控制 · 数学 2024-06-17 Martin Plávala , Laurens T. Ligthart , David Gross

Semantic segmentation with fine-grained pixel-level accuracy is a fundamental component of a variety of computer vision applications. However, despite the large improvements provided by recent advances in the architectures of convolutional…

计算机视觉与模式识别 · 计算机科学 2020-05-13 Philipe A. Dias , Henry Medeiros

Let $X \hookrightarrow \mathbb{P}^r$ be a smooth projective variety defined by homogeneous polynomials of degree $\leq d$. We give explicit upper bounds on the order of the torsion subgroup $(\mathrm{NS} \, X)_{\mathrm{tor}}$ of the…

代数几何 · 数学 2019-11-25 Hyuk Jun Kweon

We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…

度量几何 · 数学 2014-09-26 David de Laat , Fernando Mario de Oliveira Filho , Frank Vallentin

The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine in general, linear-time algorithms exist for trees.…

数据结构与算法 · 计算机科学 2021-05-26 Svein Høgemo , Benjamin Bergougnoux , Ulrik Brandes , Christophe Paul , Jan Arne Telle

In this paper, we provide extended convolution bounds for the Fr\'{e}chet problem and discuss related implications in quantitative risk management. First, we establish a new form of inequality for the Range-Value-at-Risk (RVaR). Based on…

风险管理 · 定量金融 2025-12-01 Peng Liu , Yang Liu , Houhan Teng

We study physics on $\rho(770)$ and $\omega(782)$ in framework of chiral constituent quark model. The effective action is derived by proper vertex method, which can capture all order information of chiral expansion. The $N_c^{-1}$ expansion…

高能物理 - 唯象学 · 物理学 2007-05-23 Xiao-Jun Wang , Mu-Lin Yan

In this paper, we study the boundedness of a class of fractional integrals and derivatives associated with Laguerre polynomial expansions on Laguerre Lipschitz spaces. The consideration of such operators is motivated by the study of…

偏微分方程分析 · 数学 2024-08-20 He Wang , Jizheng Huang , Yu Liu

Consider a homogeneous Poisson point process in a compact convex set in $d$-dimensional Euclidean space which has interior points and contains the origin. The radial spanning tree is constructed by connecting each point of the Poisson point…

概率论 · 数学 2017-11-06 Matthias Schulte , Christoph Thaele

We consider the unconstrained optimization of multivariate trigonometric polynomials by the sum-of-squares hierarchy of lower bounds. We first show a convergence rate of $O(1/s^2)$ for the relaxation with degree $s$ without any assumption…

最优化与控制 · 数学 2023-04-19 Francis Bach , Alessandro Rudi