Related papers: Quasi-triangle inequality for absolute correlation…
Similarity search is a fundamental problem for many data analysis techniques. Many efficient search techniques rely on the triangle inequality of metrics, which allows pruning parts of the search space based on transitive bounds on…
We derived an asymptotic bound the accuracy of the estimation when we use the quantum correlation in the measuring apparatus. It is also proved that this bound can be achieved in any model in the quantum two-level system. Moreover, we show…
The P\'al inequality is a classical result which asserts that among all planar convex sets of given width the equilateral triangle is the one of minimal area. In this paper we prove three quantitative versions of this inequality, by…
We obtain lower bound for the maximum distance between any three distinct points in an affine lattice which are close to a helix with small curvature and torsion.
The minimum co-degree threshold for a perfect matching in a $k$-graph with $n$ vertices was determined by R\"odl, Ruci\'nski and Szemer\'edi for the case when $n\equiv 0\pmod k$. Recently, Han resolved the remaining cases when $n \not\equiv…
We study the approximate range searching for three variants of the clustering problem with a set $P$ of $n$ points in $d$-dimensional Euclidean space and axis-parallel rectangular range queries: the $k$-median, $k$-means, and $k$-center…
We establish a sharp inequality between the blocks of positive partitioned matrices and conjecture a triangle type inequality for contractions: Given three contactions A,B,C, we conjecture that the constant c=3/4 is sharp in the triangle…
The corner polyhedron is described by minimal valid inequalities from maximal lattice-free convex sets. For the Relaxed Corner Polyhedron (RCP) with two free integer variables and any number of non-negative continuous variables, it is known…
Given positive integers k and r where 4 divides k and k/2 \leq r \leq k-1, we give a minimum r-degree condition that ensures a perfect matching in a k-uniform hypergraph. This condition is best possible and improves on work of Pikhurko who…
A flag is a sequence of nested subspaces of a given ambient space F_q^n over a finite field F_q. In network coding, a flag code is a set of flags, all of them with the same sequence of dimensions, the type vector. In this paper, we…
The paper is to prove the Gaussian correlation conjecture stating that, under the standard Gaussian measure, the measure of the intersection of any two symmetric convex sets is greater than or equal to the product of their measures.…
An edge of a quasi $k$-connected graph is said to be quasi $k$-contractible if the contraction of the edge results in a quasi $k$-connected graph. We show that every 5-connected graph contains a quasi 5-contractible edge. Furthermore, we…
A triangle $T'$ is $\varepsilon$-similar to another triangle $T$ if their angles pairwise differ by at most $\varepsilon$. Given a triangle $T$, $\varepsilon>0$ and $n\in\mathbb{N}$, B\'ar\'any and F\"uredi asked to determine the maximum…
We study the proximity of the optimal value of the m-dimensional knapsack problem to the optimal value of that problem with the additional restriction that only one type of items is allowed to include in the solution. We derive exact and…
We prove an adelic descent result for localizing invariants: for each Noetherian scheme $X$ of finite Krull dimension and any localizing invariant $E$, e.g., algebraic K-theory of Bass-Thomason, there is an equivalence $E(X)\simeq \lim…
Clustering is a classic topic in optimization with $k$-means being one of the most fundamental such problems. In the absence of any restrictions on the input, the best known algorithm for $k$-means with a provable guarantee is a simple…
In the conformal class of the standard metric on the $3$-sphere, we prove a quantitative refinement of the Andrews-De Lellis-Topping inequality in terms of a two-term distance to the set of minimizing conformal factors. This inequality is…
We present approximation algorithms for the following NP-hard optimization problems related to bottleneck spanning trees in metric spaces. 1. The disjoint bottleneck spanning tree problem: Given $n$ pairs of points in a metric space, find…
The upper estimates for the optimal constants of the multilinear Bohnenblust--Hille inequality obtained in [J. Funct. Anal. 264 (2013), 429--463] are here improved to: {0.1cm} {enumerate} For real scalars:…
Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi-isometric to graphs of…