Two special cases of the assignment problem

The assignment problem may be stated as follows: Given finite sets of points S and T, with|S| ? |T|, and given a “metric” which assigns a distance d(x, y) to each pair (x, y) such that x ∈ T and y ∈ S find a 1?1 function Q: T→ S which minimizes Σ_x∈Td(x, Q(x)) We consider the two special cases in which the points lie (1) on a line segment and (2) on a circle, and the metric is the distance along the line segment or circle, respectively. In each case, we show that the optimal assignment Q can be computed in a number of steps (additions and comparisons) proportional to the number of points. The problem arose in connection with the efficient rearrangement of desks located in offices along a corridor which encircles one floor of a building.     

Convexity in finite metric spaces

A subsetS of a metric space (X,d) is calledd-convex if for any pair of pointsx,y S each pointz X withd(x,z) +d(z,y) =d(x,y) belongs toS. We give some results and open questions concerning isometric and convexity-preserving embeddings of finite metric spaces into standard spaces and the number ofd-convex sets of a finite metric space.     

Forward and inverse scattering on manifolds with asymptotically cylindrical ends

We study an inverse problem for a non-compact Riemannian manifold whose ends have the following properties: On each end, the Riemannian metric is assumed to be a short-range perturbation of the metric of the form ²(dy)+h(x,dx), h(x,dx) being the metric of some compact manifold of codimension 1. Moreover one end is exactly cylindrical, i.e. the metric is equal to ²(dy)+h(x,dx). Given two such manifolds having the same scattering matrix on that exactly cylindrical end for all energies, we show that these two manifolds are isometric.     

Applications of utility functions defined on quasi-metric spaces

A quasi-metric space (X,d) is called sup-separable if (X,d^s) is a separable metric space, where d^s(x,y)=max{d(x,y),d(y,x)} for all x,y∈X. We characterize those preferences, defined on a sup-separable quasi-metric space, for which there is a semi-Lipschitz utility function. We deduce from our results that several interesting examples of quasi-metric spaces which appear in different fields of theoretical computer science admit semi-Lipschitz utility functions. We also apply our methods to the study of certain kinds of dynamical systems defined on quasi-metric spaces.     

Characterization of projective graphs

We denote the distance between vertices x and y of a graph by d(x, y), and p_ij(x, y) = ∥ {z : d(x, z) = i, d(y, z) = j} ∥. The (s, q, d)-projective graph is the graph having the s-dimensional subspaces of a d-dimensional vector space over GF(q) as vertex set, and two vertices x, y adjacent iff $\text{dim}\text{(x ? y) = s ? 1}$. These graphs are regular graphs. Also, there exist integers λ and μ > 4 so that μ is a perfect square, p₁₁(x, y) = λ whenever d(x, y) = 1, and p₁₁(x, y) = μ whenever d(x, y) = 2. The (s, q, d)-projective graphs where $\text{2d}\text{3}\text{≤ s < d ? 2}$ and $\text{(s, q, d) ≠ (}\text{2d}\text{3}\text{, 2, d)}$, are characterized by the above conditions together with the property that there exists an integer r satisfying certain inequalities.     

Diophantine inequality involving binary forms

Let d ? 3 be an integer, and set r = 2^d?1 + 1 for 3 ? d ? 4, \(\tfrac{{17}}{{32}} \cdot 2^d + 1\) for 5 ? d ? 6, r = d²+d+1 for 7 ? d ? 8, and r = d²+d+2 for d ? 9, respectively. Suppose that Φ _i (x, y) ∈ ?[x, y] (1 ? i ? r) are homogeneous and nondegenerate binary forms of degree d. Suppose further that λ₁, λ₂,..., λ _r are nonzero real numbers with λ₁/λ₂ irrational, and λ₁Φ₁(x₁, y₁) + λ₂Φ₂(x₂, y₂) + · · · + λ _r Φ _r (x _r , y _r ) is indefinite. Then for any given real η and σ with 0 < σ < 2^2?d, it is proved that the inequality

$$\left| {\sum\limits_{i = 1}^r {{\lambda _i}\Phi {}_i\left( {{x_i},{y_i}} \right) + \eta } } \right| < {\left( {\mathop {\max \left\{ {\left| {{x_i}} \right|,\left| {{y_i}} \right|} \right\}}\limits_{1 \leqslant i \leqslant r} } \right)^{ - \sigma }}$$

has infinitely many solutions in integers x₁, x₂,..., x _r , y₁, y₂,..., y _r . This result constitutes an improvement upon that of B. Q. Xue.

     

Sphere coverings and identifying codes

In any connected, undirected graph G = (V, E), the distance d(x, y) between two vertices x and y of G is the minimum number of edges in a path linking x to y in G. A sphere in G is a set of the form S _r (x) = {y ∈ V : d(x, y) = r}, where x is a vertex and r is a nonnegative integer called the radius of the sphere. We first address in this paper the following question: What is the minimum number of spheres with fixed radius r ≥ 0 required to cover all the vertices of a finite, connected, undirected graph G? We then turn our attention to the Hamming Hypercube of dimension n, and we show that the minimum number of spheres with any radii required to cover this graph is either n or n + 1, depending on the parity of n. We also relate the two above problems to other questions in combinatorics, in particular to identifying codes.     

Group actions and Helly's theorem

We describe a connection between the combinatorics of generators for certain groups and the combinatorics of Helly's 1913 theorem on convex sets. We use this connection to prove fixed point theorems for actions of these groups on nonpositively curved metric spaces. These results are encoded in a property that we introduce called “property FAr”, which reduces to Serre's property FA when r=1. The method applies to S-arithmetic groups in higher Q-rank, to simplex reflection groups (including some nonarithmetic ones), and to higher rank Chevalley groups over polynomial and other rings (for example SLn(Z[x₁,…,xd]), n>2).     

Positive Cubature Formulas and Marcinkiewicz–Zygmund Inequalities on Spherical Caps

Let Π _n ^d denote the space of all spherical polynomials of degree at most n on the unit sphere $\mathbb{S}^{d}Let Π _n ^d denote the space of all spherical polynomials of degree at most n on the unit sphere \mathbbS^d\mathbb{S}^{d} of ℝ ^d+1, and let d(x,y) denote the geodesic distance arccos x⋅y between x,y ? \mathbbS^dx,y\in\mathbb{S}^{d} . Given a spherical cap

B(e,a)={x ? \mathbbSd:d(x,e) ￡ a}    (e ? \mathbbSd, a ? (0,p) is bounded awayfrom p),B(e,\alpha)=\big\{x\in\mathbb{S}^{d}:d(x,e)\leq\alpha\big\}\quad \bigl(e\in\mathbb{S}^{d},\ \alpha\in(0,\pi)\ \mbox{is bounded awayfrom}\ \pi\bigr),      10. Coupled fixed point theorems for a generalized Meir-Keeler contraction in partially ordered metric spaces      Bessem Samet 《Nonlinear Analysis: Theory, Methods & Applications》2010,72(12):4508-4517 Let X be a non-empty set and F:X×X→X be a given mapping. An element (x,y)∈X×X is said to be a coupled fixed point of the mapping F if F(x,y)=x and F(y,x)=y. In this paper, we consider the case when X is a complete metric space endowed with a partial order. We define generalized Meir-Keeler type functions and we prove some coupled fixed point theorems under a generalized Meir-Keeler contractive condition. Some applications of our obtained results are given. The presented theorems extend and complement the recent fixed point theorems due to Bhaskar and Lakshmikantham [T. Gnana Bhaskar, V. Lakshmikantham, Fixed point theorems in partially ordered metric spaces and applications, Nonlinear Anal. 65 (2006) 1379-1393].      11. Best proximity point theorems: unriddling a special nonlinear programming problem      S. Sadiq Basha 《TOP》2014,22(2):543-553 This paper addresses the non-linear programming problem of globally minimizing the real valued function x?d(x,Sx) where S is a generalized proximal contraction in the setting of a metric space. Eventually, one can obtain optimal approximate solutions to some fixed-point equations in the event that they have no solution.      12. Properties of functions with monotone graphs      Michael Hrušák  Tamás Mátrai  Aleš Nekvinda  Václav Vlasák  Ondřej Zindulka 《Acta Mathematica Hungarica》2014,142(1):1-30 A metric space (X,d) is monotone if there is a linear order < on X and a constant c>0 such that d(x,y)≦cd(x,z) for all x<y<z∈X. Properties of continuous functions with monotone graph (considered as a planar set) are investigated. It is shown, for example, that such a function can be almost nowhere differentiable, but must be differentiable at a dense set, and that the Hausdorff dimension of the graph of such a function is 1.      13. Graph diameter in long‐range percolation      Marek Biskup 《Random Structures and Algorithms》2011,39(2):210-227 We study the asymptotic growth of the diameter of a graph obtained by adding sparse “long” edges to a square box in ${\mathbb Z}^dWe study the asymptotic growth of the diameter of a graph obtained by adding sparse “long” edges to a square box in ${\mathbb Z}^d$. We focus on the cases when an edge between x and y is added with probability decaying with the Euclidean distance as |x ? y|?s+o(1) when |x ? y| → ∞. For s ∈ (d, 2d) we show that the graph diameter for the graph reduced to a box of side L scales like (log L)Δ+o(1) where Δ?1 := log2(2d/s). In particular, the diameter grows about as fast as the typical graph distance between two vertices at distance L. We also show that a ball of radius r in the intrinsic metric on the (infinite) graph will roughly coincide with a ball of radius exp{r1/Δ+o(1)} in the Euclidean metric. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 39, 210‐227, 2011      14. Fixed points of asymptotic contractions      W.A. Kirk 《Journal of Mathematical Analysis and Applications》2003,277(2):645-650 Let be a contractive gauge function in the sense that φ is continuous, φ(s)<s for s>0, and if f:M→M satisfies d(f(x),f(y))?φ(d(x,y)) for all x,y in a complete metric space (M,d), then f always has a unique fixed point. It is proved that if T:M→M satisfies       15. Best constants for metric space inversion inequalities      Stephen M. Buckley  Safia Hamza 《Central European Journal of Mathematics》2013,11(5):865-875 For every metric space (X, d) and origin o ∈ X, we show the inequality I o (x, y) ≤ 2d o (x, y), where I o (x, y) = d(x, y)/d(x, o)d(y, o) is the metric space inversion semimetric, d o is a metric subordinate to I o , and x, y ∈ X \ {o} The constant 2 is best possible.      16. The Geodesic Problem in Quasimetric Spaces      Qinglan Xia 《Journal of Geometric Analysis》2009,19(2):452-479 In this article, we study the geodesic problem in a generalized metric space, in which the distance function satisfies a relaxed triangle inequality d(x,y)≤σ(d(x,z)+d(z,y)) for some constant σ≥1, rather than the usual triangle inequality. Such a space is called a quasimetric space. We show that many well-known results in metric spaces (e.g. Ascoli-Arzelà theorem) still hold in quasimetric spaces. Moreover, we explore conditions under which a quasimetric will induce an intrinsic metric. As an example, we introduce a family of quasimetrics on the space of atomic probability measures. The associated intrinsic metrics induced by these quasimetrics coincide with the d α metric studied early in the study of branching structures arisen in ramified optimal transportation. An optimal transport path between two atomic probability measures typically has a “tree shaped” branching structure. Here, we show that these optimal transport paths turn out to be geodesics in these intrinsic metric spaces. This work is supported by an NSF grant DMS-0710714.      17. Riesz extremal measures on the sphere for axis-supported external fields      J.S. Brauchart  P.D. Dragnev 《Journal of Mathematical Analysis and Applications》2009,356(2):769-792 We investigate the minimal Riesz s-energy problem for positive measures on the d-dimensional unit sphere Sd in the presence of an external field induced by a point charge, and more generally by a line charge. The model interaction is that of Riesz potentials |x−y|−s with d−2?s<d. For a given axis-supported external field, the support and the density of the corresponding extremal measure on Sd is determined. The special case s=d−2 yields interesting phenomena, which we investigate in detail. A weak∗ asymptotic analysis is provided as s→+(d−2).      18. On the Möbius function of the locally finite poset associated with a numerical semigroup      Jonathan Chappelon  Jorge Luis Ramírez Alfonsín 《Semigroup Forum》2013,87(2):313-330 Let S be a numerical semigroup and let (?,≤ S ) be the (locally finite) poset induced by S on the set of integers ? defined by x≤ S y if and only if y?x∈S for all integers x and y. In this paper, we investigate the Möbius function associated to (?,≤ S ) when S is an arithmetic semigroup.      19. Divisibility theory in commutative rings: Bezout monoids      P. N. ánh  L. Márki  P. Vámos 《Journal of Mathematical Sciences》2012,186(5):694-700 A ubiquitous class of lattice ordered semigroups introduced by Bosbach, which we call Bezout monoids, seems to be the appropriate structure for the study of divisibility in various classical rings like GCD domains (including UFD??s), rings of low dimension (including semi-hereditary rings), as well as certain subdirect products of such rings and certain factors of such subdirect products. A Bezout monoid is a commutative monoid S with 0 such that under the natural partial order (for a, b ?? S, a ?? b ?? S ? bS ? aS), S is a distributive lattice, multiplication is distributive over both meets and joins, and for any x, y ?? S, if d = x ?? y and dx 1 = x then there is a y 1 ?? S with dy 1 = y and x 1 ?? y 1 = 1. We investigate Bezout monoids by using filters and m-prime filters, and describe all homorphisms between them. We also prove analogues of the Pierce and the Grothendieck sheaf representations of rings for Bezout monoids. The question whether Bezout monoids describe divisibility in Bezout rings (rings whose finitely generated ideals are principal) is still open.      20. Boundedly connected sets and the distance to the intersection of two sets      Juan-Enrique Martínez-Legaz  Antonio Martinón 《Journal of Mathematical Analysis and Applications》2007,332(1):400-406 We prove that if (X,d) is a metric space, C is a closed subset of X and x∈X, then the distance of x to R∩S agrees with the maximum of the distances of x to R and S, for every closed subsets R,S⊂C such that C=R∪S, if and only if C is x-boundedly connected.

Coupled fixed point theorems for a generalized Meir-Keeler contraction in partially ordered metric spaces

Let X be a non-empty set and F:X×X→X be a given mapping. An element (x,y)∈X×X is said to be a coupled fixed point of the mapping F if F(x,y)=x and F(y,x)=y. In this paper, we consider the case when X is a complete metric space endowed with a partial order. We define generalized Meir-Keeler type functions and we prove some coupled fixed point theorems under a generalized Meir-Keeler contractive condition. Some applications of our obtained results are given. The presented theorems extend and complement the recent fixed point theorems due to Bhaskar and Lakshmikantham [T. Gnana Bhaskar, V. Lakshmikantham, Fixed point theorems in partially ordered metric spaces and applications, Nonlinear Anal. 65 (2006) 1379-1393].     

Best proximity point theorems: unriddling a special nonlinear programming problem

This paper addresses the non-linear programming problem of globally minimizing the real valued function x?d(x,Sx) where S is a generalized proximal contraction in the setting of a metric space. Eventually, one can obtain optimal approximate solutions to some fixed-point equations in the event that they have no solution.     

Properties of functions with monotone graphs

A metric space (X,d) is monotone if there is a linear order < on X and a constant c>0 such that d(x,y)≦cd(x,z) for all x<y<z∈X. Properties of continuous functions with monotone graph (considered as a planar set) are investigated. It is shown, for example, that such a function can be almost nowhere differentiable, but must be differentiable at a dense set, and that the Hausdorff dimension of the graph of such a function is 1.     

Graph diameter in long‐range percolation

We study the asymptotic growth of the diameter of a graph obtained by adding sparse “long” edges to a square box in ${\mathbb Z}^dWe study the asymptotic growth of the diameter of a graph obtained by adding sparse “long” edges to a square box in ${\mathbb Z}^d$. We focus on the cases when an edge between x and y is added with probability decaying with the Euclidean distance as |x ? y|^?s+o(1) when |x ? y| → ∞. For s ∈ (d, 2d) we show that the graph diameter for the graph reduced to a box of side L scales like (log L)^Δ+o(1) where Δ^?1 := log₂(2d/s). In particular, the diameter grows about as fast as the typical graph distance between two vertices at distance L. We also show that a ball of radius r in the intrinsic metric on the (infinite) graph will roughly coincide with a ball of radius exp{r^1/Δ+o(1)} in the Euclidean metric. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 39, 210‐227, 2011     

Fixed points of asymptotic contractions

Let be a contractive gauge function in the sense that φ is continuous, φ(s)<s for s>0, and if f:M→M satisfies d(f(x),f(y))?φ(d(x,y)) for all x,y in a complete metric space (M,d), then f always has a unique fixed point. It is proved that if T:M→M satisfies

     

Best constants for metric space inversion inequalities

For every metric space (X, d) and origin o ∈ X, we show the inequality I _o (x, y) ≤ 2d _o (x, y), where I _o (x, y) = d(x, y)/d(x, o)d(y, o) is the metric space inversion semimetric, d _o is a metric subordinate to I _o , and x, y ∈ X \ {o} The constant 2 is best possible.     

The Geodesic Problem in Quasimetric Spaces

In this article, we study the geodesic problem in a generalized metric space, in which the distance function satisfies a relaxed triangle inequality d(x,y)≤σ(d(x,z)+d(z,y)) for some constant σ≥1, rather than the usual triangle inequality. Such a space is called a quasimetric space. We show that many well-known results in metric spaces (e.g. Ascoli-Arzelà theorem) still hold in quasimetric spaces. Moreover, we explore conditions under which a quasimetric will induce an intrinsic metric. As an example, we introduce a family of quasimetrics on the space of atomic probability measures. The associated intrinsic metrics induced by these quasimetrics coincide with the d _α metric studied early in the study of branching structures arisen in ramified optimal transportation. An optimal transport path between two atomic probability measures typically has a “tree shaped” branching structure. Here, we show that these optimal transport paths turn out to be geodesics in these intrinsic metric spaces. This work is supported by an NSF grant DMS-0710714.     

Riesz extremal measures on the sphere for axis-supported external fields

We investigate the minimal Riesz s-energy problem for positive measures on the d-dimensional unit sphere Sd in the presence of an external field induced by a point charge, and more generally by a line charge. The model interaction is that of Riesz potentials |x−y|^−s with d−2?s<d. For a given axis-supported external field, the support and the density of the corresponding extremal measure on Sd is determined. The special case s=d−2 yields interesting phenomena, which we investigate in detail. A weak^∗ asymptotic analysis is provided as s→⁺(d−2).     

On the Möbius function of the locally finite poset associated with a numerical semigroup

Let S be a numerical semigroup and let (?,≤ _S ) be the (locally finite) poset induced by S on the set of integers ? defined by x≤ _S y if and only if y?x∈S for all integers x and y. In this paper, we investigate the Möbius function associated to (?,≤ _S ) when S is an arithmetic semigroup.     

Divisibility theory in commutative rings: Bezout monoids

A ubiquitous class of lattice ordered semigroups introduced by Bosbach, which we call Bezout monoids, seems to be the appropriate structure for the study of divisibility in various classical rings like GCD domains (including UFD??s), rings of low dimension (including semi-hereditary rings), as well as certain subdirect products of such rings and certain factors of such subdirect products. A Bezout monoid is a commutative monoid S with 0 such that under the natural partial order (for a, b ?? S, a ?? b ?? S ? bS ? aS), S is a distributive lattice, multiplication is distributive over both meets and joins, and for any x, y ?? S, if d = x ?? y and dx ₁ = x then there is a y ₁ ?? S with dy ₁ = y and x ₁ ?? y ₁ = 1. We investigate Bezout monoids by using filters and m-prime filters, and describe all homorphisms between them. We also prove analogues of the Pierce and the Grothendieck sheaf representations of rings for Bezout monoids. The question whether Bezout monoids describe divisibility in Bezout rings (rings whose finitely generated ideals are principal) is still open.     

Boundedly connected sets and the distance to the intersection of two sets

We prove that if (X,d) is a metric space, C is a closed subset of X and x∈X, then the distance of x to R∩S agrees with the maximum of the distances of x to R and S, for every closed subsets R,S⊂C such that C=R∪S, if and only if C is x-boundedly connected.