Junior Colloquium Department of Mathematics 1
نویسنده
چکیده
Knots are obtained by embedding a circle in R. Pictures and handicrafts of knots have appeared in ancient Chinese art several hundred years B.C. The first systematic study of knots though started in the 19th century by a Scottish physicist Peter Guthrie Tait who classified all knots to 10 crossings and made several important conjectures about knots (the most recent of these conjectures is proven in 1991). In my talk, I will recall some elementary notions of knots (such as prime knots, torus knots, fibered knots, pretzel knots, alternating knots, satellite knots, etc.). Nowadays, knots are interesting objects not just to mathematicians, but also to physicists, biologists, chemists, etc. In my talk, I will recall some elementary notions of knots (such as prime knots, torus knots, fibered knots, pretzel knots, alternating knots, satellite knots, etc.). Many, many examples and pictures will be provided. I’ll also briefly mention several well known knot invariants, but concentrate mostly on computing the Alexander polynomial of knots. Speaker: Liz Sattler Title: Hausdorff dimension of sub-fractals associated with sub-shifts Date: February 26 Abstract: Many fractals can be defined by an iteration function system (IFS) consisting of finitely many maps. We can associate a letter to each map and use a symbolic space to describe the fractal. One way to define a sub-fracta is to relate the IFS to a sub-shift of finite type (SFT) on the symbolic space. In this talk, we will formally describe the connection between such sub-fractals and SFTs. We will also discuss some techniques for calculating the Hausdorff dimension of these sets. Many fractals can be defined by an iteration function system (IFS) consisting of finitely many maps. We can associate a letter to each map and use a symbolic space to describe the fractal. One way to define a sub-fracta is to relate the IFS to a sub-shift of finite type (SFT) on the symbolic space. In this talk, we will formally describe the connection between such sub-fractals and SFTs. We will also discuss some techniques for calculating the Hausdorff dimension of these sets.
منابع مشابه
Mathematics Department Colloquium Organizer : Maciej Zworski Thursdays , 4 : 10 – 5 : 00 pm , 60 Evans April 21
متن کامل
Impossibility of Approximating Analytic Functions from Equispaced Samples
It is shown that no stable procedure for approximating functions from equally spaced samples can converge geometrically for analytic functions. The proof combines a Bernstein inequality of 1912 with an estimate due to Coppersmith and Rivlin in 1992. In a nutshell, you can't beat Gibbs and Runge. Monday December 14 2009 4:30 PM Building 4, Room 370 Refreshments are available in Building 2, Room ...
متن کاملAlmost Euclidean subspaces of ℓ1N via expander codes
We give an explicit (in particular, deterministic polynomial time) construction of subspaces X ⊆ RN of dimension (1− o(1))N such that for every x ∈ X, (logN)−O(log log logN) √ N ‖x‖2 6 ‖x‖1 6 √ N ‖x‖2. If we are allowed to use N1/ log logN 6 No(1) random bits and dim(X) > (1 − η)N for any fixed constant η, the lower bound can be further improved to (logN)−O(1) √ N‖x‖2. Through known connections...
متن کاملRound Complexity Versus Randomness Complexity in Interactive Proofs
Consider an interactive proof system for some set S that has randomness complexity r(n) for instances of length n, and arbitrary round complexity. We show a public-coin interactive proof system for S of round complexity O(r(n)/ log n). Furthermore, the randomness complexity is preserved up to a constant factor, and the resulting interactive proof system has perfect completeness. ∗Department of ...
متن کاملDoubly infinite separation of quantum information and communication
Zi-Wen Liu, ∗ Christopher Perry, Yechao Zhu, Dax Enshan Koh, and Scott Aaronson Center for Theoretical Physics and Department of Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA Department of Physics and Astronomy, University College London, Gower Street, London WC1E 6BT, United Kingdom Department of Mathematics, Massachusetts Institute of Technology, Cambridg...
متن کاملTesting Equivalence of Polynomials under Shifts
Two polynomials f, g ∈ F[x1, . . . , xn] are called shift-equivalent if there exists a vector (a1, . . . , an) ∈ F such that the polynomial identity f(x1 +a1, . . . , xn +an) ≡ g(x1, . . . , xn) holds. Our main result is a new randomized algorithm that tests whether two given polynomials are shift equivalent. Our algorithm runs in time polynomial in the circuit size of the polynomials, to which...
متن کامل