Okay, thanks everybody for for making it out and sorry about the email coming late this week It somehow I must have shut my laptop too quickly after I hit send and it didn't make it out of my draft So I apologize for that But this week we have Ryan Martin from Iowa State University who's going to be talking to us about splits with forbidden subgraphs Go ahead and take us away. All right. Thank you, Drew So this is joint work with Maria Aksinovich and if you can see this is a coffee cup I got from Kalsua. I spent the fall last fall in Budapest at the rainy Institute on sabbatical and I spent two months of the spring before COVID hit in Kalsua working with Maria and So our subject is splits which I will explain So a graph is called an NK graph. It's also called a K split of the complete graph If it has three properties first of all, it's N partite One of the things I want to emphasize is that N is no longer the number of vertices in our graph But it's the number of parts in this split There are most K vertices in each blob I'll use the word blob just because it's easier and more clear than using part and At least one edge is between each distinct pairs of blobs and for our particular problem We might as well assume that exactly one edge is between each distinct pair of blobs. So So for instance, there is an edge between here and here and it's this edge And if you look between every pair, there's exactly one So there's a little bit of history to this the sort of thing So Hayward can Hayward considered the smallest K for which some graph has a K split that is planar So here gamma is taking the place of KN and what we're doing And so what we do is we take a graph and then we split it but we make sure that the parts that Parts have an edge between them in correspondence with the vertices of this graph Gamma and that's called the planar split thickness and splits were used in bar visibility representations of graphs Hutchinson West and and my co-author Maria among others have done things in this area So what we were asking is sort of a standard Turron type question So suppose you're given a graph H and an integer n which is larger than the number of vertices of H What's the smallest K so that there's an NK graph with no copy of H as a sub graph? So you have this graph H which is forbidden and what you want to do is create this other graph with blobs so that there is At least one edge between each blob and since this is as a sub graph I'm free to delete any edges that are extraneous if I for instance were to have two edges between blobs I could just delete one of them and it wouldn't matter In fact, it would help me so I want the minimum K so that there exists an NK graph G Such that H is not a sub graph All right, so with that setup in mind Um, take a look at this particular example that I've been feeding you for the past couple of slides So it turns out it's bipartite instead of drawing it to be bipartite What I'm going to do is I'm going to color the vertices and I'm going to color one red and one blue and Notice if you look carefully through each of them every edge has a blue end vertex and a Red end vertex and that's exactly a bipartite graph So this one's bipartite well This isn't a coincidence. So, uh, barbunera and ucurt Made an observation in a in another paper sort of introducing this idea that If the chromatic number of this graph h is at least three Then the f we want to look at is equal to two So all we need is So all we need is a bipartite graph That is a split of kn And that's easy enough to create um So it turns out that this question Is highly trivial for any graph h that is not bipartite But like the turn on question It suddenly becomes highly non trivial when you are bipartite when h is bipartite Yeah, what's what's good. So what's going on with that result why I'm just having trouble seeing why that should be true Okay, so what you need to do is to take a graph on two end vertices And it needs to be you need to have an edge between each of the end blobs And it needs to be bipartite. So what you do how do you construct this thing is you take You take the sets say n sets take n sets color one of them In each one of them color one vertex red and one vertex blue And then just arbitrarily put an edge between them Such that it goes between red and blue Doesn't matter how you do it Then do it again for every pair of blobs So for every pair of blobs, you're going to get an edge between red and blue and again arbitrary. It doesn't matter at all And then when you do that you're going to have an n two graph You have two vertices in each blob. You have n blobs All the edges will go from a red to a blue But that graph is bipartite. So there's no copy of h if h it has chromatic number through your gray Yeah, so it's it's but uh, this is a good exercise because I think it gets gets you thinking about how this how this thing might work But it doesn't say anything about bipartite ages Okay, so let's observe what we have. Um, and there's actually a very trivial lower bound here Um So an nk graph is a graph on at most nk vertices We don't we don't care if one of the blobs is a little smaller, but we our parameter is always the largest blob And since g is a graph that has no h and has nk vertices Then it obeys this rule Okay, so again g Has n blobs. And so there are n choose two edges one edge between each pair of blobs And then we have the extremal number Magically sitting there, but keep in mind the extremal number is the total number of vertices All right, so of course if you replace this extremal with some expression that we happen to know for the extremal For instance, if the extremal is less than c times l to the b where b is some exponent And it doesn't matter if you don't know the exact term exponent It just has to obey less than or equal to cl to the b Then if you solve this equation for uh for k you get um You get a k that's at least c prime n over n to the two over b minus one okay, so So we've got a lower bound on the minimum here um If you if k were to be any smaller then it wouldn't obey this condition okay, and um There's another observation here that um h is always a subgraph of some complete bipartite graph And so therefore we can use kavari shush turn on to say that in fact There is a b less than two for which this holds and therefore um, we have this expression for f and h So we got a lower bound assuming some knowledge of the extremal function and by kavari shush turn on Um, we that holds at least for some constant b We're not really sure what the b ought to what the b ought to be But in any case, it's true. And so um, we got we have this condition and among other things This means f of n goes to an f goes to infinity as n goes to infinity Which of course was not true when h was not bipartite. So that's an interesting little fact and in general I I would say this is our main theorem that says that If you have a bipartite graph that's not a forest and such it for any sufficiently large l The extremal function is trapped between these things with these exponents a and b For some positive constants c and capital c and exponents a and b If b minus a is not too large Then in fact, we have these very nice bounds for f Um, it's an artifact of the proof that we need a and b to be close to each other um, I wouldn't I really don't know what the um Um What people canjecture as to whether the extremal function actually behaves like this or oscillates in some way Um, I'll give you some information about that later But notice that if a equals b we get a really nice tight result that only differs by a multiplicative long term So um, so that's nice and and let me go through what some of the things that we know some of the things that we know about turn on exponents so I got this from the fruity Shimanovic paper and the ball and pepe paper and yonzer paper and I just wanted to show that there were some examples for which Our theorem holds and some for which our theorem doesn't hold and just for an example, uh, c2k If k is in Uh, two three and five so c4 c6 c10 Doesn't work the upper and lower bounds are too far away from each other according to our formula but um c4 uh c6 and c10 do work for um for our theorem So does k2t k3t? I have k5t. I'm not sure why I don't have k4t, but um k4t I think follows from k5t k6t works But the bounds that we know of so far for kst where s and where t is not too much bigger than s Don't work, but then they work again if t is much larger compared to s And of course better values are known when t is huge compared to s But um, but our theorem still holds there for the cube. Uh, it doesn't hold Because the bounds we have on the cube are just too far apart and um This this expression this uh k kst um, this is um Relatively new result. This is from the yonzer paper and this is um subdividing kst um in a certain way But it happens to work in that case too Okay, so sometimes our theorem works. Sometimes it doesn't work It does work if you actually know the turn on exponent So the obvious corollary is if you have a bipartite graph that's not a forest So that um the extremal value is theta of l to the r Then there are constants for which f of nh is trapped between End of the 2 over r minus 1 and end of the 2 over r minus 1 times the log term So um, again, our our theorem works on a larger range for which the turn on exponents are known But this is a talk. I want to simplify the talk So we'll just assume that the turn on exponent exists And so where we happen to be in the situation of the corollary That um That the exponent exists and then i'll try to explain, uh, you know how some of this goes So There's a very important lemma that we use. Um, it's an old lemma due to Erdisch and shimonovich And it says if the extremal function at least the way we're using it if the extremal function Has a known exponent Then what we can do is we can find a graph that's not quite extremal It has half the edges of the extremal graph But the maximum and average degrees Differ by at most a multiplicative constant So there's no a priori reason that um, that the extremal graph um For any turn on property doesn't have one very large degree vertex and then um, and then Um, a bunch of moderate degree vertices But you can do a little bit of manipulation of of An extremal graph that you don't know much about but to guarantee that the maximum degree is not too big And so once we have that what we're going to do is uh The upper bound is really the key the lower bound follows directly from the first observation that I made That the extremal function you had entries to less than or equal to the extremal function So what I'm going to do is I'm going to choose a I'm going to choose a k value Such that this equation is followed so So ex nk Is greater than or equal to 12 n squared log n 12 doesn't matter Um notice, of course that we know that this is true That if you have n squared over two, that's automatically true for for If we have an nk graph but we um Here we're going to um We're going to let our k be large enough and then we're going to find a graph What what graph are we going to find it has nk vertices, which we label capital n we have the extremal number divided by two edges where We'll just say that that's capital m and then the maximum degree is some constant time m over n So two m over n is the Two m over n is the average degree So we're just going to let q be a constant and that puts us And we can guarantee all that from the air to shamanovich result from 1970 And so what we're going to do is we're going to take such a graph. We haven't created the blobs yet So let's create the blobs And the way we're going to do it is we're going to randomly partition The vertex set into blobs and not only that we're going to do it in the most naive way possible We're going to color each vertex with one of the n colors independently and with probability one of rent So seems like an obvious thing to do and we need to show two things In order for this to be for this construction to be an nk graph as as we would like it The first thing is that each blob has to have a reasonable size The size we're looking for of course is k But uh, we allow ourselves a little wiggle room and if we allow ourselves a little wiggle room It's very easy to show that if you partition a set randomly in this way the Largest size is k plus little low k But the other thing that's more difficult is that we have to guarantee this condition where Every pair of edges every pair of blobs has at least one edge between them And again in this case if we have multiple edges, that's great. We could delete them if we felt like it but otherwise We don't bother much Okay, and the problem with this is there is a slight dependency um, depending on what you think your Random events are but I would say the event is that two blobs have an edge between them Well, there's a there's a dependency on that because the the blobs are determined by coloring the vertices all right, so So what we're going to do is we're going to get around independence And here's how we'll do it. So we're going to let i and j be colors And we're going to let si j be the number of edges with color i on one end of vertex and color j on the other i is going to be not equal to j If i equals j, it's fine, but we don't care and what we're concerned about is the event that s i j is equal to zero If any of those events happen, it's a bad situation So we want to show that the probability of that is Strictly less than one I mean formally we want to show that it's less than half because we still Need that condition that all of the blobs are of size at most k But that again that happens with very very high probability. So Okay, so isometry it suffices to bound Just this expression the probability that the uh blob colors one and two Have no edge between them Because then all we are all we're going to do is if we can bound this expression Then we can take the union bound to bound this probability and if this is small enough then the union bound will We'll solve our problem for us So we've sort of reduced the problem We hope and we really have reduced the problem to just taking two blobs and saying is there an edge between those two blobs And the way we're going to do this is um, and maybe it's natural. Maybe it's not Um, is we're going to take an edge from this graph that we have the graph is deterministic We we don't have much control over the graph But what we are doing is randomly choosing the vertices So for every edge, we're going to denote the indicator of the event that the color of the end vertices of E i are one and two So what is the probability of? I i complement what's so i'm i'm asking Hoping and get a little feedback here So we have we have an edge And we need to know what the probability is that um We don't have the event that the colors are one and two Well, the probability that a vertex has color one is one over n probability the vertex has color two is one over n And so what we're looking at is one minus two over n squared So the edge can have colors one and two or two and one And then we we want to consider the complement of that event. So that's one minus and so what what S one two is is that's just the event of all of these things failing to happen And then there's if if all of these events Or if all the i's fail to happen Or in other words if the So this this means that the that a given edge does not get colors one and two If no edge gets colors one and two Then we have a bad situation and that that would mean that this is true What we would like to say is that the probability of intersection of events is approximately the probability product of the probabilities If that if they were equal they would be independent But as I said, there's a slight dependence here. We can't guarantee that there's independence of these events and the problem with What I would consider a traditional approach to attacking this problem is there's really too much dependency to apply the lobos local lemma So lobos local lemma When you apply it There's you have to have a certain amount of no dependency if things are too far away from each other in some sense Then there's no dependency, but there's there's a slight dependency everywhere here But the thing is it's not very big the dependency is not very much So lobos local lemma doesn't seem to work very well But there is an alternative and that's swens inequality Perhaps I should say swens inequalities swen had a version of this and And it was subsequently improved So swen the setup for swen is Remarkably similar to the setup for the local lemma So swens inequality has a super dependency digraph And I'm going to simplify things For our setting So Here's your goal. You want to show that these events are independent So you just say what what our goal is is the product of the probability of ii Of the complement of ii so that's we want to say that the probability of what we're looking for Is very close to the probability that we want it to be And swens says well that probability minus that is less than or equal to m times this expression So the expression that i'm coloring in yellow here If you think about this if the sum of those y's is small Then you have e to the small minus one which is small And so What we hope to get is that basically The probability that we're looking for is m plus m times small And then that will allow us to solve the problem um What happens to uh to swens inequality is it has this expression to it And since the events ii and ij are sort of well understood We're just coloring things uniformly at random. This is not a bad setup to use But we didn't use it And and mostly well, let me go into to what this means You know for what we're doing so So m is The product of these probabilities, which is less than or equal to e to the negative Of the sum of the probabilities, which is e to the minus mu So it's e to the minus mu And so what swens inequality if we get things to work It should say this that this probability is roughly e to the minus mu And um, unfortunately, it's too restrictive for us So what we're going to use is um yansen's version of swens inequality So if you find yourself Facing the situation where you think that lobas's local lemma is not working There's too much dependency at least between events, but the actual dependency between events isn't very big Maybe you want to use swen i'd uh I'd recommend yansen's paper in 1998 Because not only does he publish swens inequality he publishes a number of versions of them And the one we use is basically the one with the fewest amount of variables So there's there's an extra parameter that applies in all of his other theorems, but in this one You it's eliminated and We pay a little price We don't get quite what we want, but um, it's not a big price for the problem that we're interested in Okay, so here's the setup of yansen so We have a bunch of indicator random variables And we have a dependency graph if a and b are disjoint and there's no edge in a b Then the sets i i and i for i and i and i and b are independent S12 which is what we're looking for. It's the thing we want to compute We want to determine whether it's zero or not. Well, that's the sum of the indicators And that's just the number of edges that are colored with color one and two P i is just the expectation of the indicator as usual and mu is the expectation of this thing And that's the sum of the p i's D I don't know. You might call it a discriminant. It's um, it's a covariance And what it's doing is it's measuring the covariance of these things. And so you take your dependency digraph you Look at the dependent pairs and then you compute this expectation and you sum overall i's Divided by two doesn't matter and the conclusion that gives you is The probability of what we're looking for the probability that the sum of these indicators is zero is small And in particular It's minus the min of mu squared over 48 d or mu over four So what we would have liked is this to be exp of minus mu But as you can see we we suffer a little bit. We don't get we don't get mu even in this case We we get mu over four But that won't matter for us because we end up with a log term anyway. And so we don't need this So let's go into our setting. So our setting is well the p i is the event That an edge gets colored with colors one and two and that's two over n squared We add those up and that's just two over n squared times the number of edges And uh, then If we look at this so when are two events dependent? Well, um, we're measuring we're determining whether And one edge has color one and two and another edge has color one and two If those edges are vertex disjoint then they're not dependent on each other because They coloring these two vertices and these two vertices are different But if they share a vertex then there is some dependency and so what I want to say here is that This this is um an expression in terms of the graph And this expression is in terms of the The blue the thing underlined in blue is in the dependency digraph So in the dependency digraph we're interested if and in this case, it's not a digraph It's the dependency digraph is just an ordinary graph. So if we have two events that, um Intersect with each other that corresponds to two edges sharing the same vertex And so that's why we have a sum of degree choose two and then the probability that Two edges are both one two edges colored with one and two means that the central vertex gets a color either one or two And the other end vertices get the other color. So that's two over n cubed Right here and then that's easy to compute It's easy to compute an upper bound for Because the capital delta is just the maximum degree of the graph and remember that We needed that from the Erdos-Schumanovich theorem. So, um, in fact, we could probably prove this without that theorem, but giving away Instead of having the extremal number of edges having the extremal divided by two doesn't we don't get a Substantively better result anyway So it didn't matter to us and if we just plug it in literally plug it into Janssen's formula, we get this expression So um mu over four is m over two n squared And this complicated mu squared expression simplifies to this And we can further simplify the expression down at the bottom the n over 12 q squared n Because That's just the way it simplifies And if we plug in our value So let me go back here a second So we have n over 12 q squared n compared to m over two n squared If we plug in m, which is the extremal number for m What we get is that this term m over two n squared dominates and so we get This expression Now it turns out that if if we chose a k that was large enough Then the exponent is at most minus three log n and then the union bound holds the probability that Um, there exists a bad vertex is less than or equal to n choose two that there exists a one two vertex Or the one two edge So if there exists if there is no edge between points between two blobs Then that means that this is at most entries two times the probability that some blob doesn't contain an edge And then that that's less than or equal to e to the two log n minus three log n which goes to zero which ends the proof So the the story here is that Janssen Janssen's version of swen um Is really important for what we're doing we again we have some um, some dependency diagram But it turns out that there is some dependency between the events, but fortunately it's small enough for us to handle All right, so um, so we get this log term Uh in the upper bound. So if you remember we have We have f n h is at most Big O of What is it n to the uh Two over r minus one. Well, let me let me just Point you to To this expression So that means if k is too large then then it doesn't work then then we get a coloring So k has to be bounded by that expression in orange The log term as with most probabilistic methods is inevitable We we are always going to have a log to always Almost always have a log term when you apply the any probabilistic method like this So we were pleased um that we didn't think with um with a probabilistic method We could do any better And I think it's borne out in some of our other results where we can get rid of the log And in particular We can get rid of the log for c four so in general if um If the extremal number is Doing what we wanted to do Then we get um we get a log term difference in the upper and lower bounds But for c four we don't get a log term we get um a two A coefficient of two between the upper and lower bounds And the reason why is because we don't use a probabilistic method So the lower bound Comes from this typical way. We keep getting lower bounds We know that we have to have n shoes in the graph that we get we have to have n shoes two edges And that's bounded by the extremal number which we know for c four So that's the lower bound And the upper bound comes from uh a construction of a q to the three halves Two q to the one half graph That is c four free where q is the square of any prime power So technically speaking we have an infinite sequence of examples that produces the upper bound But what you can do is between examples you can just delete some vertices and and you can interpolate between those So we do need a q to be the square of a prime power or in other words a prime to an even power And here's the way we do it and how we do our construction. So For any prime power p the classical affine plane of order q has q square points and q square plus q lines And what you do is you just take a projected plane of order q and delete a line And what you get is the classical affine plane So what you're seeing here is a projective plane of order three Remember the fanno plane or recall the fanno plane is a projected plane of order two So a projective plane of order three you can think of as a hyper graph Where the sizes of the edges are four And so what you do is you take this thing and you can check that it's a projective plane of order three if you if you want to But if I delete that one edge This is what I get and and this is really nice now. I have a three by three grid of vertices Um, and I also have these notice that the edges sort of come in packs I have the horizontal edges. I have the vertical edges I have the edges with slope one and then so Yeah, the way this is drawn is a little confusing but This has slope one this has slope one and Let's see. Oh, sorry. I I mistrew it. This has slope one going all the way here This diagonal has slope one and then this triple has slope one And then we have slope negative one. So they all come together in bundles Um, all with the same slope and here I've colorfully drawn them So the graph, um That we're going to create gq is bipartite It's points and lines So this should be very familiar to anybody who's who's seen the projective bipartite Graph of the projected plane with points and lines is just the affine plane And so we have our points And we have our lines And point is jason to align in the bipartite graph if and only if the point is in the line in the In the affine plane Um, I should point out that what this does is if you take the projective plane bipartite graph And you delete a line and you delete the corresponding points This is what you this is the graph that you obtained But we can if you're giving the correct affine plane Sometimes easier to express it this way and I will I will take advantage of the fact that we are expressing it in terms strictly of the affine plane And the claim is that uh, this graph has no c4 Now that claim is easy if you believe what I told you that it was the Projective plane construction where you delete a line and all the incident points All right, so um So what I want to do here is yeah, I think I'm here. I'm establishing c4 free So, um, if we let h be a subgroup of order square root of q of the additive group And uh Additive group of this field and let a be the set of distinct representatives of cosets Then what we're going to do is we'll have this point The set of points P x and h so again the the points are x y's remember our our points were in a nice grid And so p x and h are all of the x's which are For which the y is a different coset Or sorry is a different Um, we take the representatives of the cosets and we take an element of the coset And we take all the y's that fit into this category and we bundle them together as points And the lines are just uh lines That are bundled according to the slope And it turns out that each uh subset of points and each subset of lines has size square root of q and what we're going to do is pair each Set of points with a set of lines to make a blob of size Two square root of q so if you're picturing this as a bipartite graph you have your points And maybe you have your lines And you have some bipartite graph in between And then you further, um subdivided the points And you further subdivided the lines Then you're going to just arbitrarily um Pair up a point with a lot of set of points with a set of lines Does it make much sense? Well, it turns out it solves a minor problem here, but um, but you can do it arbitrarily without much trouble So now that we have we have a c4 free graph And then We've done this partition of the of the affine plane of the points and the lines And then I have two claims here. One is that the graph is actually uh graph with the blobs that we want So it's a q cubed two square root of q graph and that's this sort of clear that that's um the The blobs are of size exactly two square root of q and therefore there are q cubed um blobs I guess right and then gq has an edge between each pair of blobs and um I won't get into why that's true, but that's um, it's basically the picture is showing you What what we've done actually is we've The it turns out that the blobs that we're taking for the The blobs that we're taking for the points are just the vertical lines So we take the vertical lines and that's going to be how we're going to bundle the points together and that's the um That's the p-axis and then the lm's are going to be those with the same slope And then we do the further subdivision according to this uh coset the cosets in the subgroups and um You know, I it looks very complicated. I think because of the notation, but the idea is is pretty simple and in fact Craig timmons After we posted this on archive made the observation that you can get this similar upper bound result for c6 and c10 um The constant here you pay a little bit, but that doesn't matter You you get rid of the log term for c6 and c10 And that's just because we know constructions of c6 free and c10 free graphs And they're very well defined and they're very algebraic. So we're able to understand those very well Um a corollary for this which interesting is that for our problem if you get something to be true for h You get it to be true for every super graph of h. And so in particular our result on c4 Corresponds to a result on k2t So uh the upper bound still holds the lower bound we keep losing ground But we only lose constant so So we're able to um, we have a long term difference if we know the toron exponent if it's um If it's a c4 or c6 or c10, we know enough about the extremal graph that we can get a better result and get rid of the log And then we have um question about trees. So if you remember I in way back in the um When I said what the main theorem was We excluded trees explicitly And we have better results on trees on trees. We have no log term So If a tree is on t edges, then we have the following bounds um The results are pretty straightforward. The lower bound is the same old lower bound. We've always done The upper bound comes from multicolor ramsey and that me and that comes from here And it turns out that the multicolor ramsey number for trees is nice and we can analyze that And if you notice our general bounds on trees differ by a multiplicative factor of four Moreover, um, they depend highly on The fact that we know the extremal number is at most l t minus one But the air to shosh conjecture suggests that in fact you can do better And that the extremal number is less than or equal to l times t minus one over two And if that were true, then we would improve the lower bound by a factor of two and we could get rid of that Um, I think the air to shosh conjecture there there's currently a claim that a proof exists And that claim is at least five years old Um, you're probably even older than that. So it's apparently a very complicated proof So if you believe the air to shosh conjecture is true, then we can get a slightly better bound here But in the special case of a star, we actually have the solution in almost all cases so, um We have that it's actually m minus one over t minus one and I made a slight mistake here Let me fix it The slight mistake is this is the ceiling of n minus one over t minus one Unless t is even and n minus one over t minus one is an even integer In that case, we were not able to uh to fix it. We We had a difference of one um, we Uh, I should say we we were able to uh if if t equals two Um, notice that that's even So t equals two means that you forbid um a k one two So forbidding a k one two is forbidding this graph As a sub graph, but all that means is that the maximum degree is one But you can do a perfect matching and the perfect matching has exactly Uh n minus one blob uh blobs of size n minus one Take a perfect matching Perfect matching with n times n minus one edges And then just two color the edges the edges differently So for every edge color one vertex one color Color i and the other one color j do that for all pairs i and j Um, and that should solve the problem. All right, so And so that gets blobs of size n minus one So So what's open? well, um There is still this log term and I would say that Um an open problem that's at least worth working on is getting rid of the log term in the case where uh fee isn't Where the exponent is known Again, you can't use probabilistic methods and the problem is we don't even know very much about the extremal values again Except in the case of c4 c6 and c10 um If we have a t edge tree again, we we have these um bounds um the lower bound depends on the extremal number so it can be improved with um air to shosh and um the upper bound depends on ramsey numbers of trees And then of course in the annoying case of the star on t edges then We we haven't quite resolved it, but We think that can be done and then of course you can you can consider other splits um Splits have been used for planarity and bar visibility Maybe you can apply another problem other than torontic problems and then of course you can ask about splits and other combinatorial structures in hypergraphs. They make some sense um, but Again, we know even less about hypergraphs than we know about and uh, that's all I have. Thank you Thanks, ryan. Let's have everybody thank our speaker Thank you. I mean I have other pictures of carlser. That's the math building and that's the schloss That is the the castle in kaosrow, which is the if you look at a map of kaosrow. It defines the whole city And that's looking away from the schloss at night And that is something I saw on the streets of the town It didn't strike me as a very rich town, but uh, a pink uh lamborghini is pretty impressive and uh, Yeah, I saw that in the super marked and I don't know What do I have else? Oh, yeah, uh dog parking And uh, Luft balloons That's just me thinking And that's in the math department building You're welcome Okay, why don't uh, why don't we open it up for any questions for our speaker? Of course, like there are these various strengthening of yonston Under various, you know, if you know something more about the events like they're negatively dependent or whatever And so yeah tracking my brain to What yeah, so so all of them involved another parameter with a lowercase delta It would not minimum degree, but something else and we just said why Calculate this other thing because we were always going to lose a long term anyway So everything just any sort of improvement got absorbed. But yeah, there's Uh, I think it's positive dependency, but I'm not sure maybe maybe it's negative dependency But there are a variety of these that are due to yonston and it's very nice I mean, there's many many times you run across a problem like this and you want to solve it using Say let's solve it using the local Emma the local Emma doesn't work because there's too much dependency, but in this case We could we could get control over the dependency when they were dependent. So So we took advantage of that and I've actually I've been looking to apply sweating quality for a long time But this is beautiful. Why why have we never used this or have I never used it before and You know, finally, this was a nice opportunity to do it and I think in general you just can't get rid of that long term because the extremal graphs are just such a black box Um, unless you could do something like Irish Chiminovich and say not only Is the max degree under control, but other things are under control in the sense that it's sort of regular in some sense Then maybe you can get rid of that long term But even then I think you're just reducing the exponent Is there a believed truth for the the fnt function when t is a treat? um Well, so I would say this is there hasn't been extensive study on this So let me say that uh, I believe that neither the upper nor lower bound is correct that asymptotically It should be n over t n over t or n minus 1 over t minus 1 plus little o of n For any fixed t. So I think I think so the obvious thing to say as well, um, the Air to shosh bound gets rid of the two on the left hand side And probably you get rid of the two on the right hand side But that that involves some knowing some ramsey numbers and Unfortunately, I think those are well known for trace Professor may know, uh, would it be helpful to do any kind of alteration there? So if we The probabilistic method if we don't guarantee every two blob has an edge, but then We can come back and fix it later Oh, um so Yeah, so I think the thinking that you have here is that You guarantee that many pairs of blobs have an edge between them, but not all of them Sacrifice the log and then what you do is then you try to Put them back in And then and then make sure without without creating a copy of H Yes, that would be the problem because you can't I wouldn't know how to put them back in I would try to do the other way around but yeah, I mean the The random partitioning is going to make some things very opaque for you And because the graph that we start with is something close to an extremal graph and then we manipulate it randomly We don't know what we started with so we can't really make a lot of good statements about what we end up with So that's We add don't even have to interact with the with the all right with the existing graph, right? We can just couldn't hold new Yeah, so so what you would your sacrifice would be as follows. So your your blobs are now of size Constant times whatever and then you add that amount So that would mean That you would have to make sure that you're adding a small number and you're Maybe adding a perfect matching or something So that you guarantee that you have no interaction Um Yeah, it has to depend on what what the itch is So to avoid it Well, not necessarily so you can add new vertices So, uh, I think what you're saying what what one approach of what you could be saying is suppose you wanted to create Blobs now of size k over 2 So but you're going to run into the problem where many blobs have no edge between them And what you do is augment every blob and then put edges as you need them, but you make them brand new edges Yeah Yeah, um I the only thing I would fear there is that you are Reducing it to the same problem Because in order to insert them they're going you're not going to be able to put You have to create these new blobs these new sub blobs And then they have to be h free And you have to put the edges in so that they're h free And where they're missing And that may be difficult because they those edges are going to have to interact in some way And so you're going to have to know how to put them in in such a careful way so that you can You can avoid creating an edge It's possible that that's a good that it's not something I thought of and that's You you might get a good result there But what I would be worried about is that you're you're creating The same problem and trying to resolve it too So I don't know okay, that's a great approach though. I like that Thank you Do you have any other questions for our speaker? Okay, in that case, thanks a lot Ryan and uh, thanks everybody for coming


respect and fear are linked. They're not always the same thing and you can maybe have fear without respect. It's very hard to have respect without fear. He's pointing out something extremely important here, the fear aspect. And the fear aspect is of course frowned upon nowadays. Society has become very weak and very detached from nature as well. You see for example anti-bullying laws everywhere. Guys, don't get me wrong. Of course nowadays everything goes to extremes even the bullying. However, bullying in its natural state is a normal mechanism of selection. This is how boys understand who is on top of the hierarchy, who is the alpha male, even from childhood out on. It is completely natural. But society nowadays tries to destroy everything, of course. When you see sports nowadays, hey children, there is no winner anymore. Everybody wins. No second places. But that is not real. That is not true. Just as it's not real that a man is a woman just because he puts on a woman's dress. No, he's not a woman. But society goes along with it. Yes, yes, you go, queen.


The following is a presentation of TFNN The power trading hour with your host David white Call now toll-free at 1-877-927-6648 or internationally at<PHONE_NUMBER> now David white And welcome all to another excellent edition Doesn't matter where you're at as long as i'm here in florida the free estate in the nation leading the way at this time every day The following takes place between 2 p.m. And 3 p.m So what do we have going on today? Well, you got to think that maybe everybody Said and on delay in china took their marbles and ran over here to the united states after Probably a little bit of worrying About what's going on with the real estate market in china um Maybe just the wake-up call and of course, uh He always worry about jumping out of a vrying pan and into the fire The one thing that we don't have today that I think we would all like to see is the kind of blowout volume To the upside right now. We're starting off the show with about 6.2 billion shares Which is not anywhere close to enough. So now maybe it comes in in the last part of the day But I could see us giving half of this back tomorrow If we don't get any more volume here fairly quickly Um, certainly 20 30 35 points sport comes in at about 44 19 On the s and p cash. So that's about 42 43 points um So we'll keep an eye on it what I also Uh, i'm starting to see is a lot of last minute flash in the pan from individual stocks I e people got short and they're being run today whether they hold up through the close. There'll be another big signal But uh, then the big caps that are just kind of lying around like a dead fish Um, you got a 60 point move in the s and p Uh and microsoft's up 410 some percent Um, not good. We should be having five bucks on apple We're up about a buck invidia Is one of the better ones up 2.4 percent But I wouldn't say anything to write home about After the current action um Wanted to see how some of the other ones that hadn't been doing so well like disney Uh up, uh, maybe three bucks A little bit off those lows in flx Netflix up about four four and a half bucks so, um You know, let's take a quick look at amazon So I haven't looked at that and up 41 that one's at least a little better But um, anyway, like I said, I'm not seeing anything out here that Screams, uh, we're going right back up to the top Um, we could go sideways or go back and retest 4400. I think 44 19 tomorrow Would be a good test if you do it on lighter volume But again, that presupposes that the incredibly light volume we're seeing in a lot of stuff Especially in the equities If you look at the total volume pretty good if you look at the equities Just horrifically bad, especially these big gap stocks and the fang stocks We should be having a great deal more Volume on the way back up Does that mean that we stop here? Instantly the answer is no, but my guess is that we are probably up against Um Fairly decent resistance now Through the friday close. Anyway, we're up 67 on the s and p cash dows up Almost 600 points nasdaq up 170 Russell up 2% it's the leading the day 2264 crude oil up a buck I ran out for lunch today and It's been a long time since i've seen gas at three bucks here in florida I know it's printing almost seven bucks in california now um, but You know what I think that is something we need to keep a very close eye on not for trading per se, but seeing that because that is the control rods for the nuclear reactor that is our economy um A lot of people believe that especially gasoline and energy and oil or evil And uh, you have openly said how they want to push it to eight bucks I don't know if they're going to get there, but certainly for floridians Three bucks starts uh Making a big change on whether they drive and how far and how many trips and maybe if they go that extra Step to a store some states. It's probably four bucks because they're used to being gouged uh, not leaving living in the Ultimately free state of florida by the way um, so, uh You know what keep a close eye on that that is the kind of thing that could put the big kibosh On another big rally higher, but we can see Yeah Gasoline at three bucks, especially when it was a buck eighty five a year ago People are starting to talk At least down here Anyway, give me a call today eight seven seven nine two seven six six four eight Email me at path at tfnn dot com Let's do a little history and then we'll get into a big question Someone asked me earlier in the day and we're going to discuss And that is could gold truly be over? um I don't know the answer to that, but I will talk about a principle that goes back over 500 years And uh, we'll see if that doesn't shed any light on the subject in the meantime I'll do a little history repeating On this day in 1949 there's surprising low key and carefully worded statement President harry s truman informs the american people that the soviets have exploded in nuclear bomb The soviet accomplishment years ahead of what thought was possible by the u.s Mostly because traitors here in the united states Although being a trader is supposed to only be when you're in an official act of war Eh, he was a there were a bunch of traitors some of them met old sparky The only problem I have is they weren't able to give him the juice more than once caused a panic in the u.s government uh harry truman um Had his uh joint chiefs of staff come in and ask him how many atomic bombs we had And they said on this day, you know, we could put maybe three or four of them together And everybody was shocked, uh, this started one of the biggest uh expansions of both missile technology and the technology to uh go to full out Uh, manufacturing on nuclear weapons and of course one day later Uh truman agreed to start working on the hydrogen bomb Inclusion bomb and within a few years we had that But uh, hey, don't get complacent Beat him isn't free We'll be back in a Are you grinding in the market? But seeing little to no return or are you a successful trader simply looking to make your job a little easier Learn to take the path of least resistance with david white's powerful trading newsletter David white is an accomplished trader whose deep understanding of technology and the markets Allows him to consistently find and share winning trades support and resistance Define the ranges in which stocks trade by understanding these trading ranges David white is able to find the path of least resistance David white's trading newsletter the path of least resistance is delivered daily Before the markets open to make every trading day an easy win Visit tfnn.com today and subscribe to david white's ultimate trading newsletter For $119 a month and try all of our newsletters risk-free with our 30 day money back guarantee Take the path of least resistance at tfnn educating investors What's separating you from the most successful men and women on wall street? That's right information Having all the information gives us the perspective we need to place the right trades at the right time The test profile scanner is the premier market profile based scanner Powered by its acclaimed task preparatory algorithms This feature rich scanner instantly filters over 2500 plus global financial markets such as stocks etf's Commodities futures and forex This powerful suite of tools leverages instant trade filtering and strategy formulation to show you emerging trades Before they happen for a limited time You can save $100 off your first month by using the promo code upgrade And you still get a 30 day money back guarantee. So you have nothing to risk Level the playing field with the task profile scanner, which you can find under the services tab at tfnn.com Sign up today Sharpening your skills as an investor is like getting better at playing a musical instrument You have to practice sure, but you also need excellent instruction from experts at tfnn You'll get advice and guidance from the authority and technical market analysis And it's not just dry tedious text either tfnn airs live financial content streamed live on tfnn.com and tfnn's youtube channel with tiger tv Live every market day from 8 30 a.m. To 4 p.m. Eastern for free Each host is an experienced trader and gives their take on the market while taking calls and questions live from around the world From the moment the market opens until the closing bell sounds Tiger tv has eight different shows with expert hosts to help you make the right moves with your money Watch online at tfnn.com or on tfnn's youtube channel and become the investor You were born to be tfnn educating investors Toll free at 1<PHONE_NUMBER> internationally at<PHONE_NUMBER> As we uh come back For the show we had that question of whether or not gold is going away Probably because so we're back down to 1756 or got to 1750 again Or if we're just in a trading reign that's going to dry a range that's going to drive everybody nuts But the question put to me was whether or not bitcoin could supplant gold as the third rail To go to after the dollar and maybe the euro are abandoned for The uh the bad things that the government is doing to them And i brought up grisham grisham's law And i'll read this to you quickly and economics grisham law Is a monetary principle stating that bad money drives out good For example, if there are two forms of a commodity money and circulation Which are accepted by laws having similar phase value The more valuable commodity will gradually disappear from circulation Uh the law states that any circulating currency consists of both good and bad money Quickly becoming dominated by bad money. This is because people spending the money will hand over the bad coins rather than the good ones Keeping the good ones for themselves And uh this would sound rather bland if it it wouldn't backed up for about 600 years of history Uh, especially in coins Where people started kind of uh shaving the edges off of them. Uh, that's why now Even coins like quarters have these kind of like What would you call them? And the gradated you know do this in front of the microphone Gradated edge Uh that's so that they could put silver and gold on the edge because people were always shaving them down to make it Uh a little less than what it was supposed to be But uh what would happen is people would only trade the bad coins that had already been bastardized And pretty soon the only coins that were in circulation were the bad ones everybody kept the good ones Thinking that they would one day be worth their full value unfortunately, everybody always thought that the coins had been shaved off a little bit and The price of the good coin Was always lower. We've seen this in other kinds of uh things. Uh in in fact One of the things I remember growing up was there was a flood in the city in 1978 And there were all these flood damaged cars that were for sale and no one could really figure it out Well, everybody thought that they were getting a great deal for these flood damaged cars Then we come to find out that this car dealer at least one maybe more got caught by the local news channel Taking a hose and putting water Into a car that they got from somewhere else some other state and hadn't been flood damaged But making people think that was flood damaged because then the people thought that they were getting a great deal on the car Uh, but at the same point, they wouldn't buy the unflood of flood damaged cars because they thought maybe it was flood damaged So the idea here is if you have two equal forms of a commodity Um now bitcoin gold probably not the same thing But there may be a bit to this and the fact that people can easily trade the more uh more Worthless of the two currencies like bitcoin because literally it's backed by nothing At least if you trade gold you probably Can end up with some gold at some point maybe down the line. It will be worth more back what you paid for it Um, but uh christiam's law It's been uh, actually the first occurrence of this goes back almost 2000 years uh, so it's uh Why a lot of what we know changes Over time The idea that uh The personal beliefs of humans and what they do their behavior changes much over time is not Uh, and so far it's uh held up Like I said, uh, although scarce 2000 years ago, uh, but rather uh huge volumes of information From the last 600 years Uh, give me call<PHONE_NUMBER> Um, I like my old music better. Yes. Why the change? Uh, for some reason youtube didn't like it. They were always flagging it at least that's what I heard I think it was actually too good made all the other shows sound bad, but that's just my personal belief. Um Has not been the case that rallies usually carry up to friday on weeks no matter what the volume So, uh, would this week be an exception? Uh, the only reason I'd say it would be an exception is the incredible light volume today, um Kramer have been telegraphic start of a big decline Uh, to september 17th about 10 days prior to that date. So it began almost immediately after his prediction Uh, can it stand this idiot? Uh, could it be that traders got a jump on his predictions and the sell-off is over now? There were a lot of bad things happening and the problem with Uh, something like in china is you don't know, uh, the, um Uh, what is it? Uh the unintended consequences my belief, although I cannot prove it is that, uh, after everybody quickly exited china Uh, over the last few days of last weekend into this week And the prices fell No new money was probably going to china and anybody that got their money out of china Was more than glad to go park it over here for a couple of days, but If we would have seen the kind of flood of all that money We would have seen the kind of a volume, uh, that would be commensurate with it So, you know, we should be with the kind of move we've had over the last two days We should be having something like 12 to 15 billion shares today Uh, if we get to 10 billion shares on the cboe consolidated tape, I think that would be a lot Uh, anyway, you still have plenty of time to give me a call. We're going to start getting into charts here now Uh, but uh, yeah and of course, uh This market is makes liars out of everyone if you were short Uh, you were right for a little while if you were long You were right for a while and vastly wrong for a while Uh, but uh, what else can you say? Um Question about ccj uh from art Um, you see anything coming back here? Uh, well you're back at support Um, I would have liked to seen 21 95 hold it did not you gap through it But thank god the volume didn't really increase that much again, this is a Canadian company So you're probably better off. This is a way to play china without Uh being in china And the only thing you really have to worry about is is uh, this is going to be a very front-loaded business And for that probably years to continue Uh, but at one point they're going to have all the uranium they need and it's probably going to have to see a fairly I don't think that's it now I think a lot of people just got out of the association kind of will still buying and building Uh, the actors. I think that uh, is not okay. We're going to continue Unabated I'd wait Are you having fun trading the markets? But having trouble finding like-minded individuals to discuss your trading and investment ideas with Become an apex predator in the trading markets and join the tiger's den trading room only at tfnn.com The tiger's den is an exclusive trading room where successful traders from around the world come to exchange trades and ideas Join the den and surround yourself with the sharpest minds in the trading world Subscribers to the tiger's den are also the first to have their questions answered live on air And can privately chat with our tfnn hosts live during their shows Interact with other tigers and tigers as they share trading ideas news analysis and discuss the market action all trading day Subscribe to the tiger's den risk-free with our 30-day money back guarantee and become part of the tfnn trading community educating investors You could be making money off the stock market And if you're already making money off the stock market, you could be making a lot more Check out tfnn and tiger tv and get expert investing advice to give you the power to control your financial future Go to tfnn.com and find the newsletter for you Whether you're into trading gold metals futures currencies or options You'll get advice and analysis to help you seriously get ahead Tfnn also features trading services with a 30-day money back guarantee for new subscribers As well as tfnn's tiger den trading room trading software and educational webinars for all trading levels And make sure you check out tiger tv for free on tfnn.com or tfnn's youtube channel for live Financial content from 8 30 a.m. To 4 p.m. Eastern on market days Stop watching on the sidelines while other people get rich and become the investor You were born to be tfnn educating investors Tfnn is excited about our new software charting program the art of timing the trade charts In collaboration with tom o'brien and using his best-selling book the art of timing the trade your ultimate trading master system David white has programmed an outstanding piece of software that will complement any traders methodology Using this first of its kind program The art of timing the trade charts allows you to scan thousands of stocks for fibonacci formation setups Including guardleafs abc's butterflies and much more the art of timing the trade charts is designed to help you When scouring the markets for stocks just beginning to form the trading patterns that many investors spend days Weeks or even months searching to find and right now we're offering licenses available at only $79 a month We are so confident that you're going to love this new charting software that will even give you a 30 day Unconditional money back guarantee don't miss out on this incredible new piece of software Get your copy of the art of timing the trade charts today by visiting tfnn.com This segment is brought to you by think or swim for more information Just click the think or swim banner on the front page of tfnn.com the uh Gap down on august 17th on the qq q add 76.1 million shares today. We're doing about half Well, we're doing yeah, we're doing less than half that now Um, so that kind of tells you a bit. We're also pretty much right at that downtrend line So keep a very close eye on the cues here Any kind of uh more downside out here? Could mean that we are starting a sell-off That would take us probably back to Uh 342 ish that april 29th high Um, so and it could be a fairly decent Uh fall off if we fail here if we continue Uh retest of 382 78 the september 7th high But this just absolutely filling all of the gap down But with pitiful volume is never a good sign You also have an untested high volume low on september 20th at 360 93 um The problem is If you want to be long you really need to get at least somewhere into that bottom of that september 20th candle Uh to wash it out Uh question about the smh's Uh, like I said, um Looked at some of them. They're really not saying that much Um, I'd like to see a little bit more in the way of volume On the 20th, uh, we had Uh 3.9 million shares down in the smh's today were up on 1.6 Um, could they go back and retest 276? They're pretty close generally when you get that The downside would be any close lower in the next few days. I would run. Um as I felt, uh The specter Of a huge downturn on monday Uh any kind of close back lower Uh tomorrow Uh of significance Let's say we lose three or four points back again That would make me think that we're getting ready to go back and retest the 249 35 Um, but certainly bounces on light volume Are going to continue today Whether we get more juice Is going to be a big issue. Um, I just don't like a lot of the movement out here the stocks That actually should be ripping uh that I follow and have ripped in the past or not So you probably two things one people not interested them in the way that they were Maybe their sector rotation Something else is going on. Um, I would think that the ivb, uh with fairly heavy shorting of the last few days Uh should actually be ripping people's faces off Why it's up? I'm not saying that it's actually Uh doing anything like that on the 17th. You had four and a half million shares Then you got one million shares. This is not a good-looking market at 233 on thursday And again a lot of times you don't get the signal till friday um, but um, I'm kind of stepping in here a little bit And uh getting some protection to the downside in case we gap lower Uh question about oracle. We don't talk about it much. Oh rcl Whatever they got everybody thinks that they're selling a lot of it. Um, I haven't actually been able to come up with a really good um Answer on why everybody thinks oracle is suddenly super valuable compared to what it was before Maybe someone that knows will call in maybe in the know because I can't read anything or haven't found anything that explains it Uh, when you were uh back up here on the 13th of september, you had 18.8 million shares Uh today you're getting back to that in with six million shares so far Uh And not so much jimmy A lot less than you would think A lot of pretend kind of like uh that uh the king was appointed by god I don't think he had anything to do with it um Questions about crm Finally starting to move. Uh, this one had been shorted for a while nice gap higher Um, you got 11 million shares one of the few out here that actually is headed back to its high 284 50 which is the september second high is probably what this thing is shooting for Um 11 million shares will say you end up the day with 12 uh with 14 million shares Um, it's all going to be the test of that to 84 50 Uh, I still won't think that they're doing that well Maybe they are But uh, I think amazon and microsoft and google are just killing these guys Um, they're spouting that they're doing extremely well I'm I'm wondering if that may be some wishful thinking on the ceo's head Or behalf, but uh, you'll know here we need 284 50 with more than 13 million shares So you're talking about six bucks higher across the next couple of days We talked about ccj. Uh, you want that to start turning it up here If you're really thinking that china isn't falling into a giant funnel funnel And a tidal tidal pool. What are those things that spin around? Like a toilet you go straight down Uh tidal pool tidal well, yeah, I'll think of the name of it. Uh, other things going on In the thing, what do you think uh that we're just bouncing because of the unemployment numbers I think there's part of that but man Talk about a brutal end of the summer um The question is how long uh, does everybody think we can wait Till we all get back to work Uh, but uh, ain't tough did here and uh, a very interesting, uh Discussion why I was out driving To lunch today and looking at that three dollar gas, which I despise But it is certainly, um, a very interesting talk on the chip shortage during the noontime news About how many, uh places in vietnam now Are closed that are all involved in making a lot of these low dollar chips. I thought it was very interesting It's only like about a minute and a half, but I did not catch it all but Interesting nonetheless Okay, Dave Take a look at snap And what do you think uh visa v? It's at its highs Why facebook is sucking wind Uh, or as I call it fascist book Um I tell you what You know if you wanted to do a Paris trade I think I would be long snap And short facebook because I don't think anything That happens in the next couple of years long term Is gonna be good for facebook Uh snap face I always like saying that because uh the what is it bella check called it snap face? Uh facebook, uh, nothing good's gonna happen Um There's a lot of political things that I won't get into Uh better about a year We're gonna see zuckerberg on a spit Probably every day Um, and of course even the people in power today at the federal trade Are looking to uh, can't give him a few posts So, uh, yeah, I'd be long snap Are you in the market for buying or selling real estate in the bay area including the surrounding st Petersburg tampa and clear water markets tiger real estate Is a firm that has extensive experience in the tampa bay area Whether you're looking to sell your current property for maximum value Or you're in the market for a second home or investment property tiger Realty has the experience across all areas of real estate in the tampa bay area to help buyers and sellers Make the most informed decisions across all price levels from the price You should be paying per square foot in certain up and coming areas to the type of cash flow investment Properties are capable of creating tiger real estate can help you make the best decision When it comes to all areas of the market before you make one of the biggest decisions of your financial future Call tiger real estate llc today at seven two seven three two nine eighty three twenty two or email us at tiger at tfnn.com that's seven two seven three two nine eighty three twenty two call us today The technology around us is changing every day With so much happening it can seem impossible to keep up with all the information David white's investment newsletter the technology insider is designed to give you all the information you need to understand the technology that shapes today's markets and tomorrow's future David white has made his living staying on the cutting edge of technology His weekly newsletter will give you specific recommendations for value tech stocks as well as entry prices target prices and stops to set for each trade Dave delivers his weekly newsletters every friday with updates throughout the week You can get the technology insider at tfnn.com for only 37 in 50 cents Sign up for david's newsletter the technology insider and get an inside look at everything the technology sector has to offer Try it risk-free today with our 30-day money back guarantee tfnn educating investors Are china a shares hot or not? If you trade china a shares now may be time to take a closer look trade chu or chad Directions daily csi 300 china a share bull and bear etf's china a shares in either direction Visit direction investments.com today an investor should consider the investment objectives risks charges and expenses of the direction shares carefully before investing The prospectus and summary prospectus contain this and other information about direction shares to obtain a prospectus or summary prospectus Please contact direction shares at eight six six four seven six seven five two three The prospectus or summary prospectus should be read carefully before investing an investment in the funds is subject to risk Including the possible loss of principal the funds are designed to be utilized only by sophisticated investors such as traders and active investors distributor four-side fund services llc Don't forget you can listen to tfnn live on your mobile device 24 hours per day Go to tfnn.com then hit watch tiger tv. That's tfnn.com then hit watch tiger tv As we come back Some of the questions are what uh are the stocks that I don't think are doing as well as they should be and that is Advanced micro this thing should Have a lot of volume It's come off to the side to me this thing the week Last four days And even the last week two days on no volume Make me think that there is a much better chance now This comes back into around the $95 area and i'm not exactly sure other than Everybody continues talking about Big problems with shortages generally It to this point hasn't affected amd that much I like the light volume off the top so far That a lot of these including apple are just not doing much Makes me think and these are so heavily weighted in the indexes makes me think the indexes are a lot more Uh app to go lower Uh and quickly With the weak response for a lot of these stocks um You know you look at apple here down on Uh 123 million shares on the 20th And today we're doing 45 million shares trying to figure out how to close that gap Now maybe i'm all wet on this but my guess is you got a lot of people On apple above that 147 area That will do nothing more than want to sell Because for the most part What back to July mid of july they're on the losing side probably So it didn't look that good got another question here today Okay Uh blackberry still live. Yeah, I saw their, uh their Earnings call is coming up What is it uh bb I haven't looked at this one for a long time uh the big problem with uh Blackberry we talked about it a long time ago Is something called the connect discount And that is stocks uh in canada trade for a great deal lower in technology than The similar company in the united states and generally the reason is anybody that's worth their salt as a programmer from canada Is going to get a big fat job offer Uh and not have to worry about uh Well used to not have to worry about taxes as much and they just get pilfered There's not a way to really hold um fairly Good employees up there you got a gap now What is the was earnings today? Uh, I did not uh Look let's take it quick. Come on We're up 12 percent. I knew it was coming Earnings beat. Yeah, hang on a second here Okay, canada is all street has been firms blackberry are benefiting from up taking demand for cyber security tools um Demand for its qnx software And I actually bought qnx for one of my products I'm going to say nineteen 96 1997 Something like that and used it. Um qnx is really kind of a really micro linux kind of thing For embedded software Struggle maintain production persistent chip shortage crisis Meme stock after a social driven. Okay. I'm starting to get into it here. Uh, the uh, the uh, Robin hoods are pushing it a bit Um, is it out of business? No, this is one of these companies. It's going to be held up By the canadian government. They need at least something To show that they're in the In the technology business. Um, this is just a very hard one for them to compete in Especially if you're talking about people that are doing the same thing with In texas And they're probably paying an effective tax rate In texas of with federal and state probably 40 percent Compared to the 70 or 80 percent That uh, you're probably getting hit with in canada There's a lot of ways around it in canada to do it, but You're just you're going to make a lot of money and you're going to get most of it back in texas Why most of the people that are fairly good as canadian programmers or engineers Try to become us citizens as quickly as they can And of course the best way to do that is get a big fat paying job Then you can pay a lawyer to push it through who probably knows a congressman that'll give you a little handout Somebody mentioning f-cell See how that's doing Take a little closer look Well, you had a high volume low You're bouncing out of that with a lot of volume to the upside Then you kind of come straight back now you're back up Now this thing's just uh football, isn't it? um Interesting, I still think I've had some questions lately about whether I think that uh There's still a lot to be had for uh fuel cells long term and yeah, toyota is pushing out a brand new version Of their mariah. I think it is Uh continues to add the natural gas fueling stations I think at some point and there's going to be a tipping point where everybody figures Out that there isn't enough lithium to run these cars on batteries Uh, they're also going to get tired of standing around waiting for the cars either to start fire Or to uh charge up and spend an hour charging the cars or whatever Uh, of course the faster you charge it the less Long those batteries are going to Last so I'm not a big fan long term of thinking batteries are the answer You may come up with some kind of new battery technology Um, but uh, I've heard that for eight years now All kinds of papers from colleges and institutions And not a squat jack has actually made it to it And when we look at even the batteries, uh As of last week, I saw another test of Tesla batteries compared to batteries that have been made for the last 15 years And we have a quantum move Of six percent better energy density after all those years and lithium ion batteries So it is not moving just because I make a bigger battery Doesn't make make it any more Uh, it doesn't make it way any less or take up any more room So just making a bigger something, uh, isn't uh You know, that's an easy thing for musk to do In fact, let's take a look at Tesla when we return still got plenty of time to give me call<PHONE_NUMBER> Sharpening your skills as an investor is like getting better at playing a musical instrument You have to practice sure, but you also need excellent instruction from experts at TFNN You'll get advice and guidance from the authority in technical market analysis And it's not just dry tedious text either TFNN airs live financial content streamed live on TFNN.com and TFNN's youtube channel with tiger tv Live every market day from 8 30 a.m. To 4 p.m. Eastern for free Each host is an experienced trader and gives their take on the market while taking calls and questions live from around the world From the moment the market opens until the closing bell sounds Tiger tv has eight different shows with expert hosts to help you make the right moves with your money Watch online at TFNN.com or on TFNN's youtube channel and become the investor You were born to be TFNN educating investors This can rise and fall like the tides Subscribe to Basil Chapman's newsletter the opening call and you too can ride the wave Basil Chapman is an authority in technical analysis His Chapman wave trading system has been helping traders identify trends and capitalize on momentum in the markets since 1984 TFNN invites you to test Basil's proprietary Chapman wave trading methodology with a monthly subscription to the opening call newsletter for only $149 Your subscription to the opening call comes with a 30-day money back guarantee as well as daily market updates on key indexes stocks and commodities Ride the wave sign up for the opening call risk-free today Are you looking for a secured investment which pays you on a monthly basis The Tiger first mortgage program may be the program for you The best rate on a five-year cd in the country right now according to bankrate.com is paying 1 per year or $1,000 per $100,000 invested The Tiger first mortgage program pays 7 per year paid monthly on secured high value buildable properties in st. Petersburg, florida The investment is for four years paying 7 per year or $7,000 per $100,000 invested Your investment is secured by high value real estate in st. Petersburg, florida Your investment can be anywhere from 100,000 to 500,000 Do you want to make 1,000 per year on 100,000 dollars invested or 7,000 per year on a secured Tiger first mortgage The Tiger first mortgage program may be just the program for you The Tiger first mortgage program pays 7 per year paid monthly for more information You can call<PHONE_NUMBER>. That's<PHONE_NUMBER> Catch Tom O'Brien professional trader and educator founder of TFNN Also a special guest on CNBC. Tom will bisect and dissect the markets The Tom O'Brien show next on TFNN And we're back I wanted to look at Tesla out here. This is uh, this is interesting um This is kind of what you look for In failures And that is uh, you almost get back up at the top. You kind of go sideways Very interesting to see this stock not do much of anything During the china debacle of friday and monday Let's take a quick look at this I kind of vaguely remember that people were getting out of it Almost nobody short this on a daily basis on a uh, wow You have about that three percent A little over three percent short um Nobody short this thing This is exactly kind of what you're looking for I don't know if i'll pull the trigger, but i'll look at this tomorrow and see how it's moving, but uh Everything that you kind of like a huge star Sharp move down on lots of energy back down to the may 19th low Back up to 764 45 And this is what you want to see you want to see light volume on the way up You want to see everybody quit shorting and you want it to go sideways out here That means that every time someone tries to move the price up you find a seller That's generally a good indication that the insiders or the street folk are out here distributing it That also means that you don't instantly get a really good signal that it's over But uh, I'll have to look at it. I don't know what the options are on this I will look at it tomorrow morning, but uh, you know what not a bad deal. Um I haven't we've I've made a lot of money being uh short tesla Um at the right times This may be interesting Uh, so when you can not when you have to we'll see you here tomorrow same back channel same back


Hey everybody, Matt here for Latin Sports Cards, ripping 2020-21, Panini Illusions, basketball, team all addition, 10 box break, number 12, tiered random teams. Here's another look at our random results. I'll leave those up there for just a minute and we will get to ripping. All right, let's do it. It's Tim Hardaway, Jr., Cole Anthony, rookie. It's Gordon Hayward, Nico Mania, and it's an impact for lineage Charles Barclay. We're going to do a single dice roll. One, two, three will be left or top for these dual team cards. So one, two, three will be left or top, four, five, six will be right or bottom. And the only exception would be if it's an auto or a one of one. That is three, so they will go top or left on the career lineage. Xavier Tillman, there's Garland, and Gold, 25 to Montesa Bonus. Clear shots, Paul George. There's Ant-Man, rookie. Bondaxon, Lamello, Ball, rookie, Red. There you go, Hornets. Not number, but very nice. Team all exclusive. Gratz, Hornets. Manual quickly. So again, that goes top, so that goes nicks. There's Patrick Williams, Killian Hayes. Yeah, these chairs, they're just not meant to have like butts in them for so long, I don't think. Yeah. Like they need a break, too. Yeah. It's Malachi Flynn, instant impact. There's Tim Duncan, living legends. There's just no need to challenge me, too. No. Okay. What can I say? That is Mavericks. Trophy collection, auto. Dorian Finney-Smith. There you go, Dallas. Sorry, Killian Hayes. Anthony Edwards, KT. For lineage, Dirk, that goes, I guess it's Dallas and Dallas. Mavericks. KD, Shining Stars. There's Trey Jones. Patrick Williams, rookie. And rookie, Red, Skyler Maze. There you go, Hawks. Give it to McDaniels. There's Joe Tyrese Halliburton, rookie. Not bad. Tyrese Maxi. Skyler Maze. Thought of a Mitchell Clear Shots. Desmond Bain. Kenyon Martin, Jr., rookie. Big Bay. Maldon. Zeke Najee. Najee. Kenzie has ruined Najee Harris for almost everybody. I even read his name in her voice. Carlos Jr., C.J. Ellaby. Duncan Robinson. M.B. Obi-Toppin. There's Marcus Smart, Red. There's Cole Anthony, rookie. Lamar Stevens, rookie. There's James Wiseman, Anthony Edwards. It's an impact, rookie, insert, Koro. Jay Sean Tate, Anthony. There's just a Chua, a Kongwu. Ready to see some gold. So we have Prison Basketball, Multi-Pak, Sellos up after this.  Let's do it. I'm calling my shop. Let's do it. Lamello Ball. There you go, Hornet. Second Mellow. RJ Hampton, rookie. There's Larry Bird, Clear Shots. Xavier Tillman. There's Obi-Toppin. Rookie Red. Jordan Wara. There's Ant-Man, Season Highlights. Jordan Wara. It's an impact. And more Ant-Man. Where'd everybody go? Did I put you all to sleep? It's Dotson, Cole Anthony, Jerry West. Jerry, have you watched the show about the Lakers? No. Killian Hayes on HBO Max. It is so good. Really? Yeah. Yeah. Oh, it's good. You've seen it on Macro. It's a Koro. It'll make you look at Jerry West differently. Really? Skyler Mays, Patrick Williams. I'm only on the, I think I just finished the third, maybe fourth episode. Yeah, my son actually said it would be awesome if they made a, like a season two, but where it's like the 90s Lakers. Sabin Lee. Moses Brown. Paul. It's Shack. LeBron. And Jalen Smith. R.J. Hampton. Lonzo. And Rookie Red. Emmanuel Quickly. Tillman. It's Rookie Obi-Toppin. Lamello Ball. Once again. Steeke Bradley Beale. G. Marshall. And there's Rookie Cole Anthony. It's Anthony Edwards. This is Peyton Pritchard. Rookie. There's Denial Dia. Dominique. Ben Vassell. It's Red. Paul Milsep. There's Rookie Trey Jones. Jaden McDaniels. Kai Flynn. Did you ever watch Playmakers on ESPN? Any of you ever watched that? It was on back in like the early to mid 2000s, I think. Tyrese Halliburton. It was so good. Zion. It was like, it was on ESPN. And then apparently NFL threatened to basically sever their relationship with ESPN if they did another season. That was really good. I had the DVD set on my wish list on Amazon by the time I circled back to get it. It was already gone. Tyrese Maxi. There's LeBron Mystique from the FDA. Will Smith. Oh, there we go. I can use that hemron. And those RBI's. Prangwoo. It's Kimba Walker. Red. Peyton Pritchard. Giannis. Williams. There's KD. Jaden McDaniels. So again, Prism 2020, 21. Prism basketball, multi-packed cellos. Up next, James Wiseman. Nathan Knight. Mitchell. There's LeBron James. Amazing. Dobson. Marce Stevens. There's Red Kauai. Be sure to grab your spots for tomorrow's break, Sunday Funday. And we'll have personnel starting at 10 a.m. as well. Probably won't get to many personals tonight. There's Moses Brown. Jay Sean Tate. But we'll be here until two. There's LeBron. Saban Lee. We'll have a short turnaround. Jalen Smith.  It's Rookie Desmond Bain. Save Joe. And finally, a yellow. That's Eric Pascal. It's a 25 for the Warriors. First yellow of the break, I think. Annual quickly. Small exclusive there. Najee. It's Sam Merrill. Rookie Red. D-Bay. There's Poku.  So, man, I feel like I need to say something controversial. This is live in the chat. I'm not going to. It's Paul Reed. That's all right. Patrick Williams. They're saving their energy so they can flip out when I pull a logo man. I'm going to pull the Jerry West logo man. A logo man of the logo man. All righty. Here we go. Last box. Reggie Perry. Sadiq Bay. Mark Stevens. Robert Woodard. Rookie Red. Tyrese Maxie. Mason Jones. Josh Green. Saban Lee. And last pack. Let's see another yellow in here. It's Stuart. Broadway Junior. Poku. There's Lamello. RJ Hampton on the back. And that will do it for the break. Just one hit. There's another look at it. That was Dorian Finney-Smith. Otto from the Mavericks. All right. Thanks everybody. Appreciate it. We have Prison Basketball Multipacks up next.


Hi there guys, well I just wanted to do just a just a couple of few minutes on this this is a well as you can see it's on the front it's a a mark 326 was it 326 or 328 sorry it's a ESR tester it says TR that's backslash LCR backslash ESR oh TR I presume that means transistor and the LCR would be the inductance and the ESR of course the equivalent series resistance now I've had this for about four months now I think it's very hard to get something and do a review on it straight away I think you're going to be using it for a little while get some first-hand user type thing so anyway like I say I've been using this for the last four months and 21 pounds eBay I think it's brilliant I think it's absolutely brilliant for the money this bring that the reason why I bought this because there are a lot of these other little meters and this is what I started off by so I bought one of these but these zip zip zip connectors they get damaged really easy especially when you're trying to squeeze in you know the bigger bigger transistors tip 35s they're not gonna have it and that was a pain in the book for me because I was doing a lot of stuff with tip 35 basically you know the little slayer coils and whatever and it is good to have a bit of a meter that works this one I believe there's another one it may not be it may just be a size it's a clock circuit which is basically a digital you know I build them up just for the experience I've sold and fapping about when I've really made them that was cheap but the reason I bought this was because in order to do the bigger transistors it worked out a lot easier if I just had these little grippers little hook hooks and that makes this fantastic when you put a transistor on to this not only does it show you that's faulty and it gives you a nice little thing I don't know if you can be able to pick this up very well because this cameras rubbish and the lighting is not very good I do I am gonna invest in a better camera very very soon I'm just gonna find some that's cheap but a good picture so this makes this very easy to hook up on to and you're very quickly as you can see that's faulty there's no way that's two resistors but this is faulty I've got through about six of them last week or so just plain different experiments and stuff and normally on a good one it will give you what it is it tells you the beta which is the HFE gives you the pinouts so it's what leads against the watts and it's reasonable on the battery and there you can see that what it says there there you go that's what you get when one's working and it's great for inductors brilliant it's great for resistance it's great for transistors this actually does do quite well there's a couple of problems when they're not problems actually start you from buying it one of the problems is these these clips I tend to sometimes have them hanging over the edge of my bench here and they can catch on and twice I've had to re-solder and it's the middle one this one because this pulls off and it's not very good and so you know there and little bits of this it starts peeling away a little bit in the corner but I'm not gonna worry about that too much because I can just stick that back down again which is pretty much what I'm doing there it's sort of staying where I want it to okay I can accept that so there's that to look out for but if you're quite happy which is resoldering it that's fine the only other thing is and this is crazy because I'm quite stuck to by the sticky tape the only other thing is the battery connector it's one of those nine volt connector things if I can just locate the screwdriver I should have really tidied it up yesterday but I've been working like a early dog and not really had a great deal of time and I keep meaning to do this but I keep forgetting to do it so I just thought oh right just while everything's in chaos what a great time to start doing a little video can I take this off right see if I whip this off yeah you'll see what I mean now normally there wouldn't really be any issues with it and it's great that this you know it's just got one one bit there and and but this is the problem you see the connector it's almost coming apart it's almost you know falling apart itself and sooner or later I'll have to go in here and take it apart but another one I've got spare ones but you know what I have to I have to charge this battery quite a bit um because I use it in other things as well and I know it's not a rechargeable well I just connected it to my power supply and I charge them I do it with all my non-rechargeable batteries they all seem to be rechargeable for some reason but yeah and so that and the fact that the hook clip there can come off when you catch it too many times is the only fault I can find with this thing and for 21 pounds it's low profile it sits out the way in actual fact my uh my little drawer things here it's quite happy I just ship that out the way so I can do a second one there that's what I folded I can just push it across and look how well that stays out the way and it's so easy for me to connect transistor whatever I like and I get my readout nice and easy beautiful so out of all these cheap ones that I found on eBay believe me I got through nearly all of them this one I would say the best I'd say it's the best because you can attach to it nice and easily no more missing around trying to push on to the SMD parts on some of these testers or trying to show a you know the bigger BJTs or MOSFETs into the ZIF connector because you're just going to macro up that connector and if that's the only way you've got connected there now somebody said to me they said why you just put wires in the connector then in the ZIF connector then you know have like a you know snip these up from just to put the wires in I suppose that's one way of doing it that's one way of doing it or you could just buy this those other ones don't have cases this is not a case you can chuck this in your toolbox I'd say take these out first look they're even color coded so not that it matters what color goes in where um but it's just makes it a bit easier to identify when you see it off on the screen there but you can chuck that in your toolbox I've put a bit of blue tap there to stop it from opening up as wide as it goes so when it's sat there it's looking more at me rather than facing upwards because I prefer it like that it's bail is better than why I'm gonna just put these these up because they're caught up it's better than the one on here because this look how easy that goes over I am so frustrated with this for that because I love this this meter is absolutely lovely it's nice and rugged it's nice and for this every in time and that's the downside I can see where this meter apart from it doesn't do um leather pico furries and such which is a little bit I'd have expected a little bit more out of it but I should have read the data sheet and but I do like that don't get me wrong I do like that meter it's great I don't regret buying that at all and I certainly don't regret buying this but I've sent back two of those other ones the other one that I showed you that has a fault it keeps saying it needs to be calibrated but this so far has been absolutely great so if it's 21 pounds from ebay if anyone was thinking about you know is this worth getting or not I'd say yeah they have to go through some abuse with me especially with the Tesla stuff I'm more like Slater excited to cause I haven't I've sort of saw the Tesla quite but I need I need some AC things and I'm not that keen yet I'm just playing with the mains um I don't mind a little bit but I haven't got the confidence just to chop myself an AC Tesla coil together but yeah um if you're thinking about buying one of these like say I've been using it for four months brilliant brilliant hasn't let me down the really thing I could just call it again then pulling it up is that my table has this thing where it wants to catch hold of these and try and pull the ends off but like I say if you don't have a table like mine which is just trying to cause me trouble um and if you don't mind solving that one if they do come off it's all good they fit nice and snug they don't just fall out or you know go wandering off um yeah thumbs up thumbs up for that being so cheap and so versatile and it's in a case cheers for watching see you later guys


You know, 100 years from now, people will still be using real estate. 100 years from now, the iPhone might be obsolete, you know what I mean? It's a timeless asset. Yeah. It's kind of, it's fundamental. So this book is really about fundamentals, crashes, debt, and taxes. That's why I call it the graduate school for rich, dead, poor, dead. So you should read rich, dead, poor, dead first, but this is graduate school.  That's good for the middle class, but I want it to be rich.


For the first time in my life. I have done a cross-world party all by my lonesome with no help from chat. What's over? saying it I will strike your beard with the mudra All right, I'm eating egg I've been told that it helps Yes, that's a good start Trick attack height. Okay Got markers here. Hey, Maverick. What's up, buddy? I'm just finding Rammu for the first time ever out. I pronounced that sentence That judgment is Swift or Rammu of Rammu whimsums, babe. You are behind on the video You tell me stuff to do that's already You got it. Don't worry if I die find out why they're good healers with me. I'm not worried at all Now if I was in the pub, I'd probably be dead Yes, the wife is back seating Yes, thanks dudes appreciate the help. Thanks for the 10 bits Jean IRL appreciate it Thank you. Thank you for those bits Yeah, you guys are making this really easy for me. Thank you so much. I mean you guys are carrying me through these primaries Stuff like this used to take me like half a day to finish in pubs. Well, that was way back when Not when I last played We could wipe so many times But I heard they made the fight easier Not like I'm doing extreme No, just