Related papers: Virial Expansion Bounds Through Tree Partition Sch…
Tree search algorithms, such as branch-and-bound, are the most widely used tools for solving combinatorial and nonconvex problems. For example, they are the foremost method for solving (mixed) integer programs and constraint satisfaction…
We propose a new method for the numerical computation of the cut locus of a compact submanifold of $\mathbb{R}^3$ without boundary. This method is based on a convex variational problem with conic constraints, with proven convergence. We…
We consider a diffuse interface model for tumor growth recently proposed in [Y. Chen, S.M. Wise, V.B. Shenoy, J.S. Lowengrub, A stable scheme for a nonlinear, multiphase tumor growth model with an elastic membrane, Int. J. Numer. Methods…
We consider a natural generalization of the Partial Vertex Cover problem. Here an instance consists of a graph G = (V,E), a positive cost function c: V-> Z^{+}, a partition $P_1,..., P_r$ of the edge set $E$, and a parameter $k_i$ for each…
Starting from determinants at finite temperature obeying an intermediate boundary condition between the periodic (bosonic) and antiperiodic (fermionic) cases, we find results which can be mapped onto the ones obtained from anyons for the…
We present a novel segmentation algorithm based on a hierarchical representation of images. The main contribution of this work is to explore the capabilities of the A Contrario reasoning when applied to the segmentation problem, and to…
We consider a variant of treewidth that we call clique-partitioned treewidth in which each bag is partitioned into cliques. This is motivated by the recent development of FPT-algorithms based on similar parameters for various problems. With…
Coboundary expansion is a high dimensional generalization of the Cheeger constant to simplicial complexes. Originally, this notion was motivated by the fact that it implies topological expansion, but nowadays a significant part of the…
We present an approach over arbitrary fields to bound the degree of intersection of families of varieties in terms of how these concentrate on algebraic sets of smaller codimension. This provides in particular a substantial extension of the…
Exploiting Virasoro constraints on the effective finite-volume partition function, we derive generalized Leutwyler-Smilga spectral sum rules of the Dirac operator to high order. By introducing $N_v$ fermion species of equal masses, we next…
We prove tight bounds on the site percolation threshold for $k$-uniform hypergraphs of maximum degree $\Delta$ and for $k$-uniform hypergraphs of maximum degree $\Delta$ in which any pair of edges overlaps in at most $r$ vertices. The…
We analyse the convergence of the proximal gradient algorithm for convex composite problems in the presence of gradient and proximal computational inaccuracies. We derive new tighter deterministic and probabilistic bounds that we use to…
We consider Gibbs distributions on finite random plane trees with bounded branching. We show that as the order of the tree grows to infinity, the distribution of any finite neighborhood of the root of the tree converges to a limit. We…
A degree sequence is a sequence ${\bf s}=(N_i,i\geq 0)$ of non-negative integers satisfying $1+\sum_i iN_i=\sum_i N_i<\infty$. We are interested in the uniform distribution $\mathbb{P}_{{\bf s}}$ on rooted plane trees whose degree sequence…
We generalize Horrocks' criterion for the splitting of vector bundles on projective space. We establish an analogous splitting criterion for vector bundles on a class of smooth complex projective varieties of dimension at least four, over…
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the…
In this work we prove formulas of quasi-additivity for the capacity associated to kernels of radial type in the setting of the boundary of a tree structure and in the setting of compact Ahlfors-regular spaces. We also define a notion of…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the main diagonal. This work focuses on investigating novel…
We prove the existence of continuous boundary extensions (Cannon-Thurston maps) for the inclusion of a vertex space into a tree of (strongly) relatively hyperbolic spaces satisfying the qi-embedded condition. This implies the same result…