COMPLETE METRIC ABSOLUTE NEIGHBORHOOD RETRACTS 1
... to a cover U, provided Q contains all the vertices of P and for each simplex σ of P , ϕ[Q ∩ σ] ≺ U. If Q = P then ϕ is a full realization relative to U. Dugundji-Lefschetz’ theorem says that a metrizable space Y is an ANR if and only if every open cover U of Y has an open refinement S(U) such that f ...
... to a cover U, provided Q contains all the vertices of P and for each simplex σ of P , ϕ[Q ∩ σ] ≺ U. If Q = P then ϕ is a full realization relative to U. Dugundji-Lefschetz’ theorem says that a metrizable space Y is an ANR if and only if every open cover U of Y has an open refinement S(U) such that f ...
On the expected number of commutations in reduced words
... 3π n n From this we can compute the asymptotic behavior of the expected number of consecutive pairs of noncommuting symbols in a reduced word for w0 ∈ Sn : ...
... 3π n n From this we can compute the asymptotic behavior of the expected number of consecutive pairs of noncommuting symbols in a reduced word for w0 ∈ Sn : ...
Full text
... surprising, it is actually very natural as Benford’s law is equivalent to the logarithms of the set being equidistributed modulo 1. For more on Benford’s law see [15, 16, 21, 24], as well as [20] for a compilation of articles on its theory and applications. Obviously, we would not be discussing Benf ...
... surprising, it is actually very natural as Benford’s law is equivalent to the logarithms of the set being equidistributed modulo 1. For more on Benford’s law see [15, 16, 21, 24], as well as [20] for a compilation of articles on its theory and applications. Obviously, we would not be discussing Benf ...
