Inversive geometry | Circles | Circle packing
In geometry, a Steiner chain is a set of n circles, all of which are tangent to two given non-intersecting circles (blue and red in Figure 1), where n is finite and each circle in the chain is tangent to the previous and next circles in the chain. In the usual closed Steiner chains, the first and last (n-th) circles are also tangent to each other; by contrast, in open Steiner chains, they need not be. The given circles α and β do not intersect, but otherwise are unconstrained; the smaller circle may lie completely inside or outside of the larger circle. In these cases, the centers of Steiner-chain circles lie on an ellipse or a hyperbola, respectively. Steiner chains are named after Jakob Steiner, who defined them in the 19th century and discovered many of their properties. A fundamental result is Steiner's porism, which states: If at least one closed Steiner chain of n circles exists for two given circles α and β, then there is an infinite number of closed Steiner chains of n circles; and any circle tangent to α and β in the same way is a member of such a chain. The method of circle inversion is helpful in treating Steiner chains. Since it preserves tangencies, angles and circles, inversion transforms one Steiner chain into another of the same number of circles. One particular choice of inversion transforms the given circles α and β into concentric circles; in this case, all the circles of the Steiner chain have the same size and can "roll" around in the annulus between the circles similar to ball bearings. This standard configuration allows several properties of Steiner chains to be derived, e.g., its points of tangencies always lie on a circle. Several generalizations of Steiner chains exist, most notably Soddy's hexlet and Pappus chains. (Wikipedia).
Oscillations of a Beaded Chain
From playlist Emil
Cyclic Groups (Abstract Algebra)
Cyclic groups are the building blocks of abelian groups. There are finite and infinite cyclic groups. In this video we will define cyclic groups, give a list of all cyclic groups, talk about the name “cyclic,” and see why they are so essential in abstract algebra. Be sure to subscribe s
From playlist Abstract Algebra
Dihedral Group (Abstract Algebra)
The Dihedral Group is a classic finite group from abstract algebra. It is a non abelian groups (non commutative), and it is the group of symmetries of a regular polygon. This group is easy to work with computationally, and provides a great example of one connection between groups and geo
From playlist Abstract Algebra
Steiner's Porism: proving a cool animation #SoME1
Strange circle stuff. (Some people have commented that the audio is really low. Unfortunately I haven't found a way to fix it without re-uploading the whole video, but your feedback will be taken on board for the next video! Also to everyone begging for more content, I’m currently in the m
From playlist Summer of Math Exposition Youtube Videos
Longest Block Chain - Applied Cryptography
This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.
From playlist Applied Cryptography
This is Lecture 22 of the CSE549 (Computational Biology) course taught by Professor Steven Skiena [http://www.cs.sunysb.edu/~skiena/] at Stony Brook University in 2010. The lecture slides are available at: http://www.algorithm.cs.sunysb.edu/computationalbiology/pdf/lecture22.pdf More inf
From playlist CSE549 - Computational Biology - 2010 SBU
Die Max-Planck-Gesellschaft - in 75 Sekunden
Wissen ist alles. Und Grundlagenforschung ist der wichtigste Vorgang, um unsere Welt zu verstehen und unseren Horizont zu erweitern. Unter allen Organisationen, die Grundlagenforschung betreiben, ist die Max-Planck-Gesellschaft die beste Adresse für Spitzenforscher, denn sie hat die optima
From playlist Most popular videos
Symmetric Groups (Abstract Algebra)
Symmetric groups are some of the most essential types of finite groups. A symmetric group is the group of permutations on a set. The group of permutations on a set of n-elements is denoted S_n. Symmetric groups capture the history of abstract algebra, provide a wide range of examples in
From playlist Abstract Algebra
Sebastian Bubeck: Chasing small sets
I will present an approach based on mirror descent (with a time-varying multiscale entropy functional) to chase small sets in arbitrary metric spaces. This could in particular resolve the randomized competitive ratio of the layered graph traversal problem introduced by Papadimitriou and Ya
From playlist Workshop: Continuous approaches to discrete optimization
Jennifer Tour Chayes (Microsoft Research New England and Microsoft Research New York City) URL: https://www.icts.res.in/lecture/4/details/1644/ Description: Everywhere we turn these days, we find that networks can be used to describe relevant interactions.In the high tech world, we see th
From playlist Distinguished Lectures
Construct a minimum network using Torricelli's construction for a Steiner point in GeoGebra.
From playlist Discrete Math
This video provides a demonstration for constructing a Steiner Point in a network with three vertices. I use the Smart Notebook digital math tools which include a compass and ruler to guide students in the construction of a Steiner Point.
From playlist Discrete Math
Pierre Liardet - Randomness and Cryptography with a dynamical point of view (Part 2)
Randomness and Cryptography with a dynamical point of view (Part 2)
From playlist École d’été 2013 - Théorie des nombres et dynamique
Rainbow structures, Latin squares & graph decompositions - Benny Sudakov
Computer Science/Discrete Mathematics Seminar I Topic: Rainbow structures, Latin squares & graph decompositions Speaker: Benny Sudakov Affiliation: ETH Zürich Date: March 01, 2021 For more video please visit http://video.ias.edu
From playlist Mathematics
Discrete Math Test Review - Minimum Networks
This video shows the student how to solve a variety of problems related to minimum networks.
From playlist Discrete Math
Abstract Algebra: The definition of a Ring
Learn the definition of a ring, one of the central objects in abstract algebra. We give several examples to illustrate this concept including matrices and polynomials. Be sure to subscribe so you don't miss new lessons from Socratica: http://bit.ly/1ixuu9W ♦♦♦♦♦♦♦♦♦♦ We recommend th
From playlist Abstract Algebra