Related papers: Quasi-triangle inequality for absolute correlation…

A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we show that the valency of any commutative quasi-thin weakly distance-regular digraph is at most 6.

We derive two coupled non-linear evolution equations corresponding to the truncation of the Balitsky infinite hierarchy of saturation equations after inclusion of dipole-dipole correlations, i.e. one step beyond the Balitsky-Kovchegov (BK)…

Certain quasi-exactly solvable systems exhibit an energy reflection property that relates the energy levels of a potential or of a pair of potentials. We investigate two sister potentials and show the existence of this energy reflection…

In this paper, we show that for all triangles in the plane, the equilateral triangle maximizes the ratio of the first two Dirichlet-Laplacian eigenvalues. This is an extension of work by Siudeja, who proved the inequality in the case of…

Given a centered convex body $K\subseteq\mathbb{R}^n$, we study the optimal value of the constant $\tilde{\Lambda}(K)$ such that there exists an orthonormal basis $\{w_i\}_{i=1}^n$ for which the following reverse dual Loomis-Whitney…

We consider the chance-constrained binary knapsack problem (CKP), where the item weights are independent and normally distributed. We introduce a continuous relaxation for the CKP, represented as a non-convex optimization problem, which we…

We investigate the extreme values of a sparse and equicorrelated Gaussian field on a triangle: the correlations on every vertical or horizontal line are all equal to a parameter $r \in [0,1/2]$ and are zero everywhere else. This problem is…

The $k$-center problem is a canonical and long-studied facility location and clustering problem with many applications in both its symmetric and asymmetric forms. Both versions of the problem have tight approximation factors on worst case…

This short note gives a proof of the triangle inequality based on the Kantorovich duality formula for the Wasserstein distances of exponent $p\in[1,+\infty)$ in the case of a general Polish space. In particular it avoids the "glueing of…

We show that the sharp constant in the classical $n$-dimensional Hardy-Leray inequality can be improved for axisymmetric divergence-free fields, and find its optimal value. The same result is obtained for $n=2$ without the axisymmetry…

Let $M$ be a perfect matching on a set of points in the plane where every edge is a line segment between two points. We say that $M$ is globally maximum if it is a maximum-length matching on all points. We say that $M$ is $k$-local maximum…

In this paper, we consider the constraint set $K$ of inequalities with nonsmooth nonconvex constraint functions. We show that under Abadie's constraint qualification the "perturbation property" of the best approximation to any $x$ in $\R^n$…

An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.

This paper has two aims, first one is to introduce special kind of proximal contractions guaranteeing a finite number of best proximity points, and second one is to derive best proximity point results for perimetric contractions. To meet…

Let d > 1 and 0 < k < d. The k-plane transform satisies some Lp to Lq dilation-invariant inequality. In this case the best constant and the extremizers are explicitly known. We give a quantitative form of the inequality with respect to…

We give a characterization of all three points in $\mathbb R^4$ with integer coordinates which are at the same Euclidean distance apart. In three dimension the problem is characterized in terms of solutions of the Diophantine equations…

We prove the equivalence of two Kakeya conjectures: 1.The Kakeya maximal operator conjecture 2.The disjoint trilinear dual form of the Kakeya maximal operator conjecture

We consider a differential quasivariational inequality for which we state and prove the continuous dependence of the solution with respect to the data. This convergence result allows us to prove the existence of at least one optimal pair…

We prove that every quasi-complete intersection ideal is obtained from a pair of nested complete intersection ideals by way of a flat base change. As a by-product we establish a rigidity statement for the minimal two-step Tate complex…

It is known that the flip distance between two triangulations of a convex polygon is related to the minimum number of tetrahedra in the triangulation of some polyhedron. It is interesting to know whether these two numbers are the same. In…