Related papers: Quasi-triangle inequality for absolute correlation…
We prove an almost constant lower bound of the isoperimetric coefficient in the KLS conjecture. The lower bound has the dimension dependency $d^{-o_d(1)}$. When the dimension is large enough, our lower bound is tighter than the previous…
The optimality of the integral inequality $\int\limits_\gamma\sqrt{k_1^2+k_2^2+k_3^2}ds>2\pi$ for closed curves with non-vanishing curvatures in $\mathbb R^4$ is discussed. We prove that an arbitrary closed curve of constant positive…
A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we focus on commutative quasi-thin weakly distance-regular digraphs, and classify such digraphs with valency more than 3.…
In this paper we propose an algorithm for the approximate k-Nearest-Neighbors problem. According to the existing researches, there are two kinds of approximation criterion. One is the distance criteria, and the other is the recall criteria.…
We introduce a notion of "quasi-right-veering" for closed braids, which plays an analogous role to "right-veering" for open books. We show that a transverse link $K$ in a contact 3-manifold $(M,\xi)$ is non-loose if and only if every braid…
We consider an analogue of the Lieb-Thirring inequality for quantum systems with homogeneous repulsive interaction potentials, but without the antisymmetry assumption on the wave functions. We show that in the strong-coupling limit, the…
A space-discretization for the elastic flow of inextensible curves is devised and quasi-optimal convergence of the corresponding semi-discrete problem is proved for a suitable discretization of the nonlinear inextensibility constraint.…
After the optimal parameters of additive quaternary codes of dimension $k\le 3$ have been determined there is some recent activity to settle the next case of dimension $k=3.5$. Here we complete dimension $k=3.5$ and $k=4$. We also solve the…
Denote by $T_k$ the generalised triangle, a $k$-uniform hypergraph on vertex set $\{1,2,\dots,2k-1\}$ with three edges $\{1,\dots,k-1,k\}$,$\{1,\dots,k-1,k+1\}$ and $\{k,k+1,\dots,2k-1\}$. Recently, Bowtell, Kathapurkar, Morrison and…
An anisotropic elasticity tensor can be approximated by the closest tensor belonging to a higher symmetry class. The closeness of tensors depends on the choice of a criterion. We compare the closest isotropic tensors obtained using four…
We prove the optimality of a criterion of Koksma (1953) in Khinchin's conjecture, settling a long standing open problem in analysis. Using this result, we also give a near optimal condition for the a.e.\ convergence of series…
This paper establishes quantitative correlation inequalities between monotone events and structured threshold objects in both the discrete cube and Gaussian space. We prove that for any increasing balanced family, there exists a linear…
We prove a conditional decoupling inequality for the model of random interlacements in dimension $d\geq 3$: the conditional law of random interlacements on a box (or a ball) $A_1$ given the (not very "bad") configuration on a "distant" set…
We present combinatorial approximation algorithms for the weighted correlation clustering problem. In this problem, we have a set of vertices and two weight values for each pair of vertices, denoting their difference and similarity. The…
In 2013, Adams introduced the $n$-crossing number of a knot $K$, denoted by $c_n(K)$. Inequalities between the $2$-, $3$-, $4$-, and $5$-crossing numbers have been previously established. We prove $c_9(K)\leq c_3(K)-2$ for all knots $K$…
We give an alternative proof of the Michael-Simon-Sobolev inequality using techniques from optimal transport. The inequality is sharp for submanifolds of codimension $2$.
We study the medial axis of a set $K$ in Euclidean space (the set of points in space with more than one closest point in $K$) from a "coarse" and "quantitative" perspective. We show that on "most" balls $B(x,r)$ in the complement of $K$,…
We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an $n$-vertex graph $G$ with sublinear independence number. In this setting, we show that if $\delta(G) \ge n/3 + o(n)$ then…
In the Euclidean $k$-Means problem we are given a collection of $n$ points $D$ in an Euclidean space and a positive integer $k$. Our goal is to identify a collection of $k$ points in the same space (centers) so as to minimize the sum of the…
We provide an upper bound on the quasi-relative entropy in terms of the trace distance. The bound is derived for two cases: 1) any operator monotone decreasing function and full rank mixed qubit or classical states; 2) a large class of…