Related papers: Tight Bounds for Consensus Systems Convergence

Given a non-negative $n \times n$ matrix viewed as a set of distances between $n$ points, we consider the property testing problem of deciding if it is a metric. We also consider the same problem for two special classes of metrics, tree…

Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…

In this article we treat two closely related problems: 1) the upper semi continuity property for Almgren minimal sets in regions with regular boundary, which guanrantees that the uniqueness property is well defined; and 2) the Almgren…

We study the isoperimetric problem in product spaces equipped with the uniform distance. Our main result is a characterization of isoperimetric inequalities which, when satisfied on a space, are still valid for the product spaces, up a to a…

This paper studies how to certify the convergence of Lasserre's hierarchy of semidefinite programming relaxations for solving multivariate polynomial optimization. We propose flat truncation as a general certificate for this purpose. Assume…

In this paper we obtain the rates of convergence of the algorithms given in [13] and [14] for an automatic computation of the centered Hausdorff and packing measures of a totally disconnected self-similar set. We evaluate these rates…

Upper bound limit analysis allows one to evaluate directly the ultimate load of structures without performing a cumbersome incremental analysis. In order to numerically apply this method to thin plates in bending, several authors have…

The paper focuses on general properties of parametric minimum contrast estimators. The quality of estimation is measured in terms of the rate function related to the contrast, thus allowing to derive exponential risk bounds invariant with…

We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

Let P be a locally finite disk pattern on the complex plane C whose combinatorics are described by the one-skeleton G of a triangulation of the open topological disk and whose dihedral angles are equal to a function \Theta:E\to [0,\pi/2] on…

Canonical forms are central to the analytical understanding of tensor network states, underpinning key results such as the complete classification of one-dimensional symmetry-protected topological phases within the matrix product state…

We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we…

Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…

Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…

Considered is the multiplicative semigroup of ratios of products of principal minors bounded over all positive definite matrices. A long history of literature identifies various elements of this semigroup, all of which lie in a…

The error bound property for a solution set defined by a set-valued mapping refers to an inequality that bounds the distance between vectors closed to a solution of the given set by a residual function. The error bound property is a…

We study truncation compatible families F = (F_m)_{m>=1} over Q[z] through an inverse limit formalism, and we evaluate them at the punctured cyclotomic cosine points alpha_{k,n} = cos(2 pi k/n) with the specialization z equals n-1. For…

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…

We consider the following problem: given a program, find tight asymptotic bounds on the values of some variables at the end of the computation (or at any given program point) in terms of its input values. We focus on the case of…