The logistic map is a classic recursive sequence defined by $x_{n+1}=rx_{n}(1-x_{n})$ and $r$ is a parameter with $0\leq r \leq 4$. It turns out, this innocent sequence is quite strange when $r$ gets closer to 4. For large enough $r$, chaos can even occur. We will investigate the fixed points of this map as well as some of its periodic orbits, and later we will look into some of the numerics with this sequence.
Abstract:
This talk will be about using the Euler characteristic to count words in free partially commutative monoids or acyclic orientations of graphs
Abstract:
Abstract:
In this talk, I will discuss the analytical aspect of some recent work on the long time behaviors of a class of random Hamilton-Jacobi equation.
Four different lectures
1) Basic results from classical regularity theory
2) Aspects of Nonlinear Calderon-Zygmund
3) Aspects of Nonlinear Potential Theory
4) Non-uniformly elliptic problems
Four different lectures
1) Basic results from classical regularity theory
2) Aspects of Nonlinear Calderon-Zygmund
3) Aspects of Nonlinear Potential Theory
4) Non-uniformly elliptic problems