REDUCING THE CLOCKWISE-ALGORITHM TO k LENGTH CLASSES

In the present paper, we consider an optimization problem related to the extension in k-dimensions of the well known 3x3 points problem by Sam Loyd. In particular, thanks to a variation of the so called “clockwise-algorithm”, we show how it is possible to visit all the 3^k points of the k-dimensional grid given by the Cartesian product of (0, 1, 2) using covering trails formed by h(k)=(3^k-1)/2 links who belong to k (Euclidean) length classes. We can do this under the additional constraint of allowing only turning points which belong to the set B(k):={(0, 3) x (0, 3) x ... x (0, 3)}.

Shortest paths in arbitrary plane domains

Let $\Omega $ be a connected open set in the plane and $\gamma : [0,1] \to \overline {\Omega }$ a path such that $\gamma ((0,1)) \subset \Omega $ . We show that the path $\gamma $ can be “pulled tight” to a unique shortest path which is homotopic to $\gamma $ , via a homotopy h with endpoints fixed whose intermediate paths $h_t$ , for $t \in [0,1)$ , satisfy $h_t((0,1)) \subset \Omega $ . We prove this result even in the case when there is no path of finite Euclidean length homotopic to $\gamma $ under such a homotopy. For this purpose, we offer three other natural, equivalent notions of a “shortest” path. This work generalizes previous results for simply connected domains with simple closed curve boundaries.

Second-order L∞ variational problems and the ∞-polylaplacian

In this paper we initiate the study of second-order variational problems in {L^{\infty}}, seeking to minimise the {L^{\infty}} norm of a function of the hessian. We also derive and study the respective PDE arising as the analogue of the Euler–Lagrange equation. Given {\mathrm{H}\in C^{1}(\mathbb{R}^{n\times n}_{s})}, for the functional\mathrm{E}_{\infty}(u,\mathcal{O})=\|\mathrm{H}(\mathrm{D}^{2}u)\|_{L^{\infty}% (\mathcal{O})},\quad u\in W^{2,\infty}(\Omega),\mathcal{O}\subseteq\Omega,{}the associated equation is the fully nonlinear third-order PDE\mathrm{A}^{2}_{\infty}u:=(\mathrm{H}_{X}(\mathrm{D}^{2}u))^{\otimes 3}:(% \mathrm{D}^{3}u)^{\otimes 2}=0.{}Special cases arise when {\mathrm{H}} is the Euclidean length of either the full hessian or of the Laplacian, leading to the {\infty}-polylaplacian and the {\infty}-bilaplacian respectively. We establish several results for (1) and (2), including existence of minimisers, of absolute minimisers and of “critical point” generalised solutions, proving also variational characterisations and uniqueness. We also construct explicit generalised solutions and perform numerical experiments.

How To Count Citations If You Must

Citation indices are regularly used to inform critical decisions about promotion, tenure, and the allocation of billions of research dollars. Nevertheless, most indices (e.g., the h-index) are motivated by intuition and rules of thumb, resulting in undesirable conclusions. In contrast, five natural properties lead us to a unique new index, the Euclidean index, that avoids several shortcomings of the h-index and its successors. The Euclidean index is simply the Euclidean length of an individual's citation list. Two empirical tests suggest that the Euclidean index outperforms the h-index in practice. (JEL A14, C43)

On the relative distances of six points in a plane convex body

Let C be a convex body in the Euclidean plane. By the relative distance of points p and q we mean the ratio of the Euclidean distance of p and q to the half of the Euclidean length of a longest chord of C parallel to pq. In this note we find the least upper bound of the minimum pairwise relative distance of six points in a plane convex body.

On the relative lengths of sides of convex polygons

Let C be a convex body. By the relative distance of points p and q we mean the ratio of the Euclidean distance of p and q to the half of the Euclidean length of a longest chord of C parallel to pq. The aim of the paper is to find upper bounds for the minimum of the relative lengths of the sides of convex hexagons and heptagons.

Steinhardt's inequality in the Minkowski plane

In a Minkowski plane with unit circle E, the product of the positive circumference of a plane convex body K and that of its polar dual is greater than or equal to the square of the Euclidean length of the polar dual of E. Equality holds if and only if K is a Euclidean unit circle.