Related papers: Maximal distance minimizers for a rectangle

This paper discusses minimum distance estimation method in the linear regression model with dependent errors which are strongly mixing. The regression parameters are estimated through the minimum distance estimation method, and asymptotic…

We propose here a proof of existence of a minimizer of a segmentation functional based on a priori information on target shapes, and formulated with level sets. The existence of a minimizer is very important, because it guarantees the…

In this paper we determine the unique graph with minimum distance spectral radius among all connected graphs of fixed order and given edge connectivity.

A subset of a normed space $X$ is called equilateral if the distance between any two points is the same. Let $m(X)$ be the smallest possible size of an equilateral subset of $X$ maximal with respect to inclusion. We first observe that…

For given $\epsilon>0$ and $b\in\mathbb{R}^m$, we say that a real $m\times n$ matrix $A$ is $\epsilon$-badly approximable for the target $b$ if $$\liminf_{q\in\mathbb{Z}^n, \|q\|\to\infty} \|q\|^n \langle Aq-b \rangle^m \geq \epsilon,$$…

In this paper we find, for any arbitrary finite topological type, a compact Riemann surface $\mathcal{M},$ an open domain $M\subset\mathcal{M}$ with the fixed topological type, and a conformal complete minimal immersion $X:M\to\R^3$ which…

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

We determine the optimal structure of couplings for the \emph{Martingale transport problem} between radially symmetric initial and terminal laws $\mu, \nu$ on $\R^d$ and show the uniqueness of optimizer. Here optimality means that such…

We consider the minimization problem for an integral functional $J$, possibly non-convex and non-coercive in $W^{1,1}_0(\Omega)$, where $\Omega\subset\R^n$ is a bounded smooth set. We prove sufficient conditions in order to guarantee that a…

We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a…

If $E \subset \mathbb{R}^2$ is a compact set of Hausdorff dimension greater than $5/4$, we prove that there is a point $x \in E$ so that the set of distances $\{ |x-y| \}_{y \in E}$ has positive Lebesgue measure.

We show existence of minimizers for the Hardy-Sobolev-Maz'ya inequality in $R^{m+n}\setminus\R^n$ for $m=1$ and $n>2$ or for $m>2$ and $n>0$.

A metric space $\mathrm{M}=(M,\de)$ is {\em indivisible} if for every colouring $\chi: M\to 2$ there exists $i\in 2$ and a copy $\mathrm{N}=(N, \de)$ of $\mathrm{M}$ in $\mathrm{M}$ so that $\chi(x)=i$ for all $x\in N$. The metric space…

We look for minimizers of the buckling load problem with perimeter constraint in any dimension. In dimension 2, we show that the minimizing plates are convex; in higher dimension, by passing through a weaker formulation of the problem, we…

We provide a simple proof of the radial symmetry of any nonnegative minimizer for a general class of quasi-linear minimization problems.

We give an alternative proof of the formula for the minimum distance of a projective Reed-Muller code of an arbitrary order. It leads to a complete characterization of the minimum weight codewords of a projective Reed-Muller code. This is…

A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension $\mu(\Gamma)$ is the smallest size…

The constrained minimization (respectively maximization) of directed distances and of related generalized entropies is a fundamental task in information theory as well as in the adjacent fields of statistics, machine learning, artificial…

The set of points in a metric space is called an $s$-distance set if pairwise distances between these points admit only $s$ distinct values. Two-distance spherical sets with the set of scalar products $\{\alpha, -\alpha\}$,…

We study the distance set problem for pairs of compact sets $A, B\subset \mathbb{R}^n$, $n\geq 2$. We show that if $B$ is contained in a hyperplane and \begin{align*} \dim_{H} A+\dim_{H} B>n, \end{align*} then the distance set $…