The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Binary multiples of combinatorial geometries - II”

On n-ary equivalence relations and their application to geometry

Wanda Szmielew

Similarity:

CONTENTSForeword............................................................................................................................................. 5Introduction......................................................................................................................................... 7Chapter I. n-ary equivalence relations........................................................................................... 8Chapter II. Application of n-ary equivalence relations...

On the rank of random subsets of finite affine geometry

Wojciech Kordecki (2000)

Discussiones Mathematicae Graph Theory

Similarity:

The aim of the paper is to give an effective formula for the calculation of the probability that a random subset of an affine geometry AG(r-1,q) has rank r. Tables for the probabilities are given for small ranks. The expected time to the first moment at which a random subset of an affine geometry achieves the rank r is derived.

Affine bijections of C(X,I)

Janko Marovt (2006)

Studia Mathematica

Similarity:

Let 𝒳 be a compact Hausdorff space which satisfies the first axiom of countability, I = [0,1] and 𝓒(𝒳,I) the set of all continuous functions from 𝒳 to I. If φ: 𝓒(𝒳,I) → 𝓒(𝒳,I) is a bijective affine map then there exists a homeomorphism μ: 𝒳 → 𝒳 such that for every component C in 𝒳 we have either φ(f)(x) = f(μ(x)), f ∈ 𝓒(𝒳,I), x ∈ C, or φ(f)(x) = 1-f(μ(x)), f ∈ 𝓒(𝒳,I), x ∈ C.

Self-affine fractals of finite type

Christoph Bandt, Mathias Mesing (2009)

Banach Center Publications

Similarity:

In the class of self-affine sets on ℝⁿ we study a subclass for which the geometry is rather tractable. A type is a standardized position of two intersecting pieces. For a self-affine tiling, this can be identified with an edge or vertex type. We assume that the number of types is finite. We study the topology of such fractals and their boundary sets, and we show how new finite type fractals can be constructed. For finite type self-affine tiles in the plane we give an algorithm which...