Andrea Bianchi (12/17/20): An upper bound on the topological complexity of discriminantal varieties
Title: An upper bound on the topological complexity of discriminantal varieties Abstract: A discriminantal variety V is the complement in C^m of the zero locus of a polynomial. Many interesting spaces arise in this way: for example both the ordered configuration space F_n(R^2) and the uno
From playlist Topological Complexity Seminar
Dan Guralnik (3/23/2023): Wanted: Topologists for Autonomous Robots Community
Topological Complexity (TC) addresses a foundational problem in Robotics from the 2nd half of the 20th century: Quantify the complexity of planning continuous paths through a topological space, regarded as the configuration/state space of a programmable synthetic system. Technological bre
From playlist Topological Complexity Seminar
Big O Notation: A Few Examples
This video is about Big O Notation: A Few Examples Time complexity is commonly estimated by counting the number of elementary operations (elementary operation = an operation that takes a fixed amount of time to preform) performed in the algorithm. Time complexity is classified by the nat
From playlist Computer Science and Software Engineering Theory with Briana
Big O Part 3 – Quadratic Complexity
The raw performance of an algorithm, program, or a programmatic operation depends on a number of factors such, not least the computer it’s running on. Big O is not concerned with this; Big O describes the way the time taken by a program (or memory or space usage) depends on the amount of
From playlist Big O Complexity
What is the definition of scientific notation
👉 Learn about scientific notations. Scientific notation is a convenient way of writing very large or very small numbers. A number written in scientific notation is of the form a * 10^n where a is the first non-zero number between 1 and 10, (1 included) and n is the number of digits up to t
From playlist Scientific Notation | Learn About
Determine Time Complexity Function and Time Complexity Using Big-O Notation: f(n)=(cn(n-1))/2
This video explains how to determine the time complexity of given code. http://mathispower4u.com
From playlist Additional Topics: Generating Functions and Intro to Number Theory (Discrete Math)
The chaotic complexity of natural numbers | Data structures in Mathematics Math Foundations 175
This is a sobering and perhaps disorienting introduction to the fact that arithmetic with bigger numbers starts to look quite different from the familiar arithmetic that we do with the small numbers we are used to. The notion of complexity is key in our treatment of this. We talk about bot
From playlist Math Foundations
Steve Scheirer (10/28/21): Relative topological complexity and configuration spaces
Joint work with Bryan Boehnke and Shuhang Xue
From playlist Topological Complexity Seminar
Lucile Vandembroucq (8/25/22): On the weak topological complexity and the TC-Ganea conjecture
By analogy with the classical Ganea conjecture, which has been disproved by N. Iwase, the TC-Ganea conjecture asks whether the equality TC(X x S^n)=TC(X)+TC(S^n) holds for all finite CW complexes X and all positive integers n. In a previous work in collaboration with J. González and M. Gra
From playlist Topological Complexity Seminar
What are complex numbers? | Essence of complex analysis #2
A complete guide to the basics of complex numbers. Feel free to pause and catch a breath if you feel like it - it's meant to be a crash course! Complex numbers are useful in basically all sorts of applications, because even in the real world, making things complex sometimes, oxymoronicall
From playlist Essence of complex analysis
Lecture 15: TC of F_p (corrected)
In this video, we compute TC of the field F_p with p-elements. As an application of this computation we deduce that THH of F_p-algebras is in a highly compatible fashion an Module over HZ. This relates to fundamental work of Kaledin and has some subtle aspects to it, which we carefully dis
From playlist Topological Cyclic Homology
Bárbara M. Gutiérrez (7/22/21): Effectual topological complexity
In this talk we will introduce the concept of Effectual Topological Complexity, which is a new version of the Topological Complexity (TC) for G-Spaces. We will state some of its main properties, for instance, we will explain the relation between this notion with the standard version of TC
From playlist Topological Complexity Seminar
Michael Farber (2/24/22): Topological complexity of spherical bundles
I will start by describing the concept of a parametrized motion planning algorithm which allows to achieve high degree of flexibility and universality. The main part of the talk will focus on the problem of understanding the parametrized topological complexity of sphere bundles. I will exp
From playlist Topological Complexity Seminar
Said Hamoun (2/23/23): On the rational topological complexity of coformal elliptic spaces
We establish some upper and lower bounds of the rational topological complexity for certain classes of elliptic spaces. Our techniques permit us in particular to show that the rational topological complexity coincides with the dimension of the rational homotopy for some special families of
From playlist Topological Complexity Seminar
Isaac Ortigoza (12/8/22): Symmetric and symmetrized topological complexity of the torus
I describe a calculation for the symmetric and symmetrized topological complexity of the torus, thus completing the description of those numbers in the case of closed surfaces, orientable or not. The method is based on obstruction theory and depends on the construction of an explicit resol
From playlist Topological Complexity Seminar
Jeremy Hahn : Prismatic and syntomic cohomology of ring spectra
CONFERENCE Recording during the thematic meeting : « Chromatic Homotopy, K-Theory and Functors» the January 24, 2023 at the Centre International de Rencontres Mathématiques (Marseille, France) Filmmaker: Jean Petit Find this video and other talks given by worldwide mathematicians on CIR
From playlist Topology
Jamie Scott (9/23/21): Applications of Surgery to a Generalized Rudyak Conjecture
Rudyak’s conjecture states that cat (M) is at least cat (N) given a degree one map f between the closed manifolds M and N. In the recent paper "Surgery Approach to Rudyak's Conjecture", the following theorem was proven: Theorem. Let f from M to N be a normal map of degree one between clos
From playlist Topological Complexity Seminar
Mateusz Skomora: Separation theorems in signed tropical convexities
The max-plus semifield can be equipped with a natural notion of convexity called the “tropical convexity”. This convexity has many similarities with the standard convexity over the nonnegative real numbers. In particular, it has been shown that tropical polyhedra are closely related to the
From playlist Workshop: Tropical geometry and the geometry of linear programming
Time Complexity Analysis | What Is Time Complexity? | Data Structures And Algorithms | Simplilearn
This video covers what is time complexity analysis in data structures and algorithms. This Time Complexity tutorial aims to help beginners to get a better understanding of time complexity analysis. Following topics covered in this video: 00:00 What is Time Complexity Analysis 04:21 How t
From playlist Data Structures & Algorithms