Aho-Corasick Automaton

Kosaraju's Algorithm is an efficient method for finding strongly connected components (SCCs) in a directed graph. The algorithm operates in two main passes using Depth-First Search (DFS). In the first pass, we perform DFS on the original graph to determine the finish order of each vertex, which helps in identifying the order of processing in the next step. The second pass involves reversing the graph's edges and conducting DFS based on the vertices' finish order obtained from the first pass. Each DFS call in this second pass identifies one strongly connected component. The overall time complexity of Kosaraju's Algorithm is $O(V + E)$, where $V$ is the number of vertices and $E$ is the number of edges, making it very efficient for large graphs.

The Fama-French Model is an asset pricing model developed by Eugene Fama and Kenneth French that extends the Capital Asset Pricing Model (CAPM) by incorporating additional factors to better explain stock returns. While the CAPM considers only the market risk factor, the Fama-French model includes two additional factors: size and value. The model suggests that smaller companies (the size factor, SMB - Small Minus Big) and companies with high book-to-market ratios (the value factor, HML - High Minus Low) tend to outperform larger companies and those with low book-to-market ratios, respectively.

The expected return on a stock can be expressed as:

where:

• $E(R_i)$ is the expected return of the asset,
• $R_f$ is the risk-free rate,
• $\beta_i$ is the sensitivity of the asset to market risk,
• $E(R_m) - R_f$ is the market risk premium,
• $s_i$ measures the exposure to the size factor,
• $h_i$ measures the exposure to the value factor.

By accounting for these additional factors, the Fama-French model provides a more comprehensive framework for understanding variations in stock

A Cayley graph is a visual representation of a group that illustrates its structure and the relationships between its elements. Given a group $G$ and a set of generators $S \subseteq G$, the Cayley graph is constructed by taking the elements of $G$ as vertices. An edge is drawn between two vertices $g$ and $g'$ if there exists a generator $s \in S$ such that $g' = gs$.

This graph is directed if the generators are not symmetric, meaning that $g$ to $g'$ is not the same as $g'$ to $g$. The Cayley graph provides insights into the group’s properties, such as connectivity and symmetry, and is particularly useful for studying finite groups, as it can reveal the underlying structure and help identify isomorphisms between groups. In essence, Cayley graphs serve as a bridge between algebraic and geometric perspectives in group theory.

The Brouwer Fixed-Point Theorem states that any continuous function mapping a compact convex set to itself has at least one fixed point. In simpler terms, if you take a closed disk (or any compact and convex shape) in a Euclidean space and apply a continuous transformation to it, there will always be at least one point that remains unchanged by this transformation.

For example, consider a function $f: D \to D$ where $D$ is a closed disk in the plane. The theorem guarantees that there exists a point $x \in D$ such that $f(x) = x$. This theorem has profound implications in various fields, including economics, game theory, and topology, as it assures the existence of equilibria and solutions to many problems where continuous processes are involved.

The Brouwer Fixed-Point Theorem can be visualized as the idea that if you were to continuously push every point in a disk to a new position within the disk, at least one point must remain in its original position.

The Fresnel Equations describe the reflection and transmission of light when it encounters an interface between two different media. These equations are fundamental in optics and are used to determine the proportions of light that are reflected and refracted at the boundary. The equations depend on the angle of incidence and the refractive indices of the two media involved.

For unpolarized light, the reflection and transmission coefficients can be derived for both parallel (p-polarized) and perpendicular (s-polarized) components of light. They are given by:

• For s-polarized light (perpendicular to the plane of incidence):

• For p-polarized light (parallel to the plane of incidence):

The Runge-Kutta methods are a family of iterative techniques used to approximate solutions to ordinary differential equations (ODEs). These methods are particularly valuable when an analytical solution is difficult or impossible to obtain. The most common variant, known as the fourth-order Runge-Kutta method, achieves a good balance between accuracy and computational efficiency. It works by estimating the slope of the solution at multiple points within each time step and then combining these estimates to produce a more accurate result. This is mathematically expressed as:

where $k_1, k_2, k_3,$ and $k_4$ are calculated based on the ODE and the current state $y_n$. The method is widely used in various fields such as physics, engineering, and computer science for simulating dynamic systems.