Cantor set | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

In mathematics, the Cantor set is a set of points lying on a single line segment that has a number of unintuitive properties. It was discovered in 1874 by Henry John Stephen Smith and introduced by German mathematician Georg Cantor in 1883. Through consideration of this set, Cantor and others helped lay the foundations of modern point-set topology. The most common construction is the Cantor ternary set, built by removing the middle third of a line segment and then repeating the process with the remaining shorter segments. Cantor mentioned the ternary construction only in passing, as an example of a more general idea, that of a perfect set that is nowhere dense. More generally, in topology, a Cantor space is a topological space homeomorphic to the Cantor ternary set (equipped with its subspace topology). By a theorem of L. E. J. Brouwer, this is equivalent to being perfect nonempty, compact metrizable and zero dimensional. Construction and formula of the ternary set The

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications

Related people

Related units

Related concepts

Related courses

Related lectures

Summary

Official source

About this result

Related publications (3)

Related publications

Related people

Related units

Related concepts (56)

Related concepts

Related courses (4)

Related courses

Related lectures (8)

Related lectures

Fractal

In mathematics, a fractal is a geometric shape containing detailed structure at arbitrarily small scales, usually having a fractal dimension strictly exceeding the topological dimension. Many fr

Discrete space

In topology, a discrete space is a particularly simple example of a topological space or similar structure, one in which the points form a , meaning they are isolated from each other in a certain sen

General topology

In mathematics, general topology (or point set topology) is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology. It is the foundation of mos

Extensive amenability and a Tits alternative for topological full groups

Nóra Gabriella Szoke

This dissertation investigates the amenability of topological full groups using a property of group actions called extensive amenability. Extensive amenability is a core concept of several amenability results for groups of dynamical origin. We study its properties and present some applications. The main result of the thesis is such an application, a Tits alternative for topological full groups of minimal actions of finitely generated groups. On the one hand, we show that topological full groups of minimal actions of virtually cyclic groups are amenable. On the other hand, if

G

is a finitely generated not virtually cyclic group, we construct a minimal free action of

G

on a Cantor space such that the topological full group contains a non-abelian free group.

EPFL2019

Coloring Intersection Graphs of Arc-Connected Sets in the Plane

Michal Lason, Bartosz Maria Walczak

A family of sets in the plane is simple if the intersection of any subfamily is arc-connected, and it is pierced by a line L if the intersection of any member with L is a nonempty segment. It is proved that the intersection graphs of simple families of compact arc-connected sets in the plane pierced by a common line have chromatic number bounded by a function of their clique number.

Springer2014

We provide the first examples of finitely generated simple groups that are amenable (and infinite). This follows from a general existence result on invariant states for piecewise-translations of the integers. The states are obtained by constructing a suitable family of densities on the classical Bernoulli space.

Annal Mathematics2013

MATH-205: Analysis IV

Learn the basis of Lebesgue integration and Fourier analysis

CS-341: Introduction to computer graphics

The students study and apply fundamental concepts and algorithms of computer graphics for rendering, geometry synthesis, and animation. They design and implement their own interactive graphics programs.

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, discrete structures & algorithmic thinking.