We propose a notion of weak Bernoulli in all dimensions which generalizes the usual definition in dimension 1. The key idea is the concept of a coupling surface. We relate this notion to previously studied properties and discuss a number of possible variants in dimension 1. We also show that the Isi
Weak Monge arrays in higher dimensions
✍ Scribed by Dominique Fortin; Rüdiger Rudolf
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 797 KB
- Volume
- 189
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
An n x n matrix C is called a weak Mange matrix if cii + c,~ GIs + cti for all 1 < i < r, s 6 n.
It is well known that the classical linear assignment problem is optimally solved by the identity permutation if the underlying cost-matrix fulfills the weak Monge property.
In this paper we introduce d-dimensional weak Monge arrays, (d >2), and prove that ddimensional axial assignment problems can be solved efficiently whenever the underlying costarray fulfills the d-dimensional weak Monge property. Moreover, it is shown that all results also carry over into an abstract algebraic framework. Finally, the problem of testing whether or not a given array can be permuted to become a weak Monge array is investigated.
📜 SIMILAR VOLUMES
Let C be an n × m matrix. Then the sequence Sa: = ((il,jl),(i2,j2) ..... (inm,jnm)) of pairs of indices is called a Monge sequence with respect to the given matrix C if and only if, whenever (i,j) precedes both (i, s) and (r,j) in ~, then c[ i, j ] + c [ r, s] <~ c [ i, s] + c [ r, j ]. Monge sequen
In this paper we study global texture in five-dimensional space-time. The self similar solution is obtained in higher dimension and is very similar to the four-dimensional solution. We investigate the gravitational field of the global texture configuration by solving Einstein field equations as well
We show that small blocking sets in PG(n, q) with respect to hyperplanes intersect every hyperplane in 1 modulo p points, where q= p h . The result is then extended to blocking sets with respect to k-dimensional subspaces and, at least when p>2, to intersections with arbitrary subspaces not just hyp