Upload 4 files

.gitattributes

@@ -35,3 +35,5 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
 *tfevents* filter=lfs diff=lfs merge=lfs -text
 TopoDevPOC_n39_100samples.png filter=lfs diff=lfs merge=lfs -text
 TopoDevPOC.pdf filter=lfs diff=lfs merge=lfs -text
+developing_poc/md.topodevpoc.pdf filter=lfs diff=lfs merge=lfs -text
+developing_poc/od.topodevpoc.pdf filter=lfs diff=lfs merge=lfs -text

developing_poc/md.topodevpoc.pdf

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:ea9d2c75c30e83484ba65eef25e7d20a23e68a9f9de00b82b810f5406bcaca34
+size 246412

developing_poc/md.topodevpoc.tex

@@ -0,0 +1,244 @@
+\documentclass[conference]{IEEEtran}
+\usepackage{amsmath, amssymb, amsthm}
+\usepackage{graphicx}
+\usepackage{array}
+\usepackage{booktabs}
+\usepackage{cite}
+\usepackage{tikz}
+\usepackage{xcolor}
+
+\newtheorem{theorem}{Theorem}
+\newtheorem{lemma}{Lemma}
+\newtheorem{corollary}{Corollary}
+\newtheorem{definition}{Definition}
+\newtheorem{proposition}{Proposition}
+
+\begin{document}
+
+\title{MD.TopoDevPOC: Topologically Unique Multi-Directional Developing Point-of-Control Patterns in Pre-Market K-Lines}
+
+\author{\IEEEauthorblockN{ConQ Research Team}\\
+\IEEEauthorblockA{\textit{Continual Quasars}\\
+\today}
+}
+
+\maketitle
+
+\begin{abstract}
+This paper characterizes the complete space of developing Point of Control (POC) line patterns on pre-market candlestick sequences when no directional monotonicity is imposed. Allowing each inter-candle relation to be strict-up ($<$), strict-down ($>$), or equality ($=$), we prove that for $n$ candles there are exactly $3^{\,n-1}$ distinct patterns. The derivation uses elementary combinatorics and is validated by a state-transition matrix on three states. A ternary vector encoding with values $+1$, $0$, $-1$ is introduced, together with bidirectional conversion formulas to the symbolic sequence. Two natural aggregated metrics are defined: the migration count $M$ (total number of strict moves, the $L_1$ norm of the vector) and the end-to-end (E2E) net balance $S$ (the signed sum of the vector). Exact combinatorial counts for given $M$ are provided, and the joint distribution of $M$ and $S$ is outlined. Ten illustrative random multi-directional patterns are displayed in both symbolic and vector formats, with a right-to-left temporal chart. All results are purely combinatorial and require no simulation.
+\end{abstract}
+
+\begin{IEEEkeywords}
+developing POC, multi-directional patterns, combinatorial enumeration, ternary encoding, end-to-end balance, pre-market analysis
+\end{IEEEkeywords}
+
+\section{Introduction}
+
+The developing Point of Control (POC) during the pre-market session can exhibit rich behavior, moving up, down, or remaining flat between consecutive three-minute candles. While constrained (monotonic) patterns have been studied in a companion work, the unrestricted case where the POC may reverse direction multiple times within a single session captures the full complexity of pre-market price discovery. The central question is: Given $n$ consecutive pre-market candles, each associated with a developing POC value, how many distinct sequences of direction relations (strict-up, strict-down, flat) can be formed? Furthermore, what compact metrics describe the overall movement?
+
+This paper provides a comprehensive combinatorial treatment of multi-directional developing POC patterns. The main contributions are:
+\begin{enumerate}
+    \item A closed-form enumeration: for $n$ candles, exactly $3^{\,n-1}$ distinct patterns exist.
+    \item A ternary vector representation $(+1,0,-1)$ that encodes each transition, with explicit bidirectional conversion to the symbolic form.
+    \item Definition and analysis of two end-to-end (E2E) metrics: the migration count $M$ (total strict moves) and the net balance $S$ (signed sum of moves). Exact formulas for the number of patterns with a given $M$ are derived.
+    \item A state-transition matrix formulation on three states that independently confirms the total count.
+    \item Ten illustrative patterns with a visual chart following the correct right-to-left temporal convention.
+\end{enumerate}
+
+No empirical data or simulations are used; the development is entirely theoretical.
+
+\section{Problem Definition and Notation}
+
+Let $n \in \mathbb{N}$ be the number of candles, with $n=39$ for a standard US pre-market session. Index candles from the most recent $C_0$ back to $C_{-(n-1)}$. The corresponding developing POC values form a real sequence
+\begin{equation}
+    \mathbf{p} = (p_0, p_1, \dots, p_{n-1}) \in \mathbb{R}^n,
+\end{equation}
+where $p_k$ is the POC of candle $C_{-k}$. For each adjacent pair $(p_k, p_{k+1})$ we observe one of three possible relations:
+\begin{definition}[Multi-Directional Relation]
+The relation $R_k$ between $p_k$ and $p_{k+1}$ belongs to the set $\{\, <,\; >,\; = \,\}$,
+where $<$ means $p_k < p_{k+1}$ (up move), $>$ means $p_k > p_{k+1}$ (down move), and $=$ means $p_k = p_{k+1}$ (flat).
+\end{definition}
+A pattern is uniquely identified by the $(n-1)$-tuple of relations
+\begin{equation}
+    \mathbf{R} = (R_0, R_1, \dots, R_{n-2}), \quad R_k \in \{<, >, =\}.
+\end{equation}
+Two price sequences that yield the same $\mathbf{R}$ are considered equivalent. No further identification (e.g., by scaling or translation) is performed.
+
+\section{Combinatorial Enumeration}
+
+\begin{theorem}[Total Pattern Count]
+For $n \ge 1$ candles, the number of distinct multi-directional developing POC patterns is
+\begin{equation}
+    N_n = 3^{\,n-1}.
+\end{equation}
+\end{theorem}
+
+\begin{proof}
+For each of the $n-1$ adjacent pairs, there are three independent choices ($<$, $>$, $=$). Hence $N_n = 3^{\,n-1}$.
+\end{proof}
+
+For $n=39$, this evaluates to $3^{38} \approx 4.36 \times 10^{18}$. The space is vast, accommodating all possible sequences of directional moves and flats.
+
+\subsection{State-Transition Matrix Confirmation}
+
+The same result follows from a 3-state Markovian view. Define states corresponding to the last observed relation: $U$ (strict-up, $<$), $D$ (strict-down, $>$), and $F$ (flat, $=$). There are no restrictions on transitions, so any state can follow any state. The transition (adjacency) matrix is the all-ones matrix
+\begin{equation}
+    \mathbf{A} = \begin{pmatrix}
+        1 & 1 & 1 \\
+        1 & 1 & 1 \\
+        1 & 1 & 1
+    \end{pmatrix} = \mathbf{1}\mathbf{1}^\top,
+\end{equation}
+where $\mathbf{1} = (1,1,1)^\top$. With $n$ candles we have $n-1$ transitions. Let the initial state vector $\mathbf{v}_0 = (1,1,1)^\top$ (all states permissible before the first comparison). The total number of patterns is
+\begin{equation}
+    N_n = \mathbf{1}^\top \mathbf{A}^{n-2} \mathbf{v}_0 .
+\end{equation}
+Since $\mathbf{A}^k = 3^{k-1} \mathbf{A}$ for $k \ge 1$, we obtain
+\begin{align}
+    N_n &= \mathbf{1}^\top \left(3^{n-3} \mathbf{A}\right) \mathbf{v}_0 \nonumber \\
+        &= 3^{n-3} \, \mathbf{1}^\top \mathbf{A} \mathbf{1} \nonumber \\
+        &= 3^{n-3} \cdot 9 = 3^{\,n-1}.
+\end{align}
+This cross-check confirms the elementary counting argument.
+
+\section{Ternary Encoding and Conversion}
+
+A compact, signed representation of a pattern is given by a ternary vector of length $n-1$.
+
+\begin{definition}[Ternary Transition Vector]
+For a pattern with relations $\mathbf{R} = (R_0, \dots, R_{n-2})$, define the vector $\mathbf{m} = (m_0, \dots, m_{n-2})$ by
+\begin{equation}
+    m_k = \begin{cases}
+        +1, & \text{if } R_k = \; < \;\;(\text{up}),\\
+        -1, & \text{if } R_k = \; > \;\;(\text{down}),\\
+        0,  & \text{if } R_k = \; = \;\;(\text{flat}).
+    \end{cases}
+\end{equation}
+\end{definition}
+
+Thus $\mathbf{m} \in \{-1,0,+1\}^{n-1}$. The mapping is a bijection between the $3^{\,n-1}$ symbolic sequences and the ternary vectors.
+
+\subsection{Conversion Formulas}
+
+Let $\Sigma$ be a string of length $n-1$ over the alphabet $\{<, >, =\}$, ordered from $\Sigma_0$ (transition between $C_0$ and $C_{-1}$) to $\Sigma_{n-2}$.
+
+\textbf{Symbolic $\to$ Ternary:}
+\begin{equation}
+    m_j = f(\Sigma_j), \quad j=0,\dots,n-2,
+\end{equation}
+with $f(<)=+1$, $f(>)=-1$, $f(=)=0$.
+
+\textbf{Ternary $\to$ Symbolic:}
+\begin{equation}
+    \Sigma_j = g(m_j), \quad g(+1)=\;<,\; g(-1)=\;>,\; g(0)=\;=.
+\end{equation}
+
+The vector $\mathbf{m}$ is a row vector of size $1 \times (n-1)$.
+
+\section{End-to-End Metrics: Migration Count and Net Balance}
+
+Two aggregate properties naturally emerge from the ternary vector.
+
+\begin{definition}[Migration Count $M$]
+The number of strict directional moves, i.e., the count of non-zero entries in $\mathbf{m}$, is
+\begin{equation}
+    M(\mathbf{m}) = \sum_{k=0}^{n-2} |m_k| = \|\mathbf{m}\|_1.
+\end{equation}
+\end{definition}
+
+\begin{definition}[End-to-End (E2E) Net Balance $S$]
+The signed sum of the moves, capturing the net directional bias from the most recent candle to the oldest, is
+\begin{equation}
+    S(\mathbf{m}) = \sum_{k=0}^{n-2} m_k .
+\end{equation}
+\end{definition}
+
+$M$ measures the total activity (number of POC level changes), while $S$ indicates whether the cumulative movement was net up ($S>0$), net down ($S<0$), or perfectly cancelled ($S=0$). The two are related by $M \equiv |S| \pmod{2}$ when only strict moves are present.
+
+\subsection{Exact Counts by Migration Count}
+
+For a fixed $M = k$ ($0 \le k \le n-1$), the number of patterns with exactly $k$ strict moves is
+\begin{equation}
+    C_{n,k} = \binom{n-1}{k} \, 2^{\,k}.
+\end{equation}
+\textit{Derivation:} Choose $k$ positions out of $n-1$ to be strict; at each chosen position assign either $+1$ or $-1$ ($2$ choices). The remaining $n-1-k$ positions are $0$. Summing over $k$,
+\[
+\sum_{k=0}^{n-1} \binom{n-1}{k} 2^{\,k} = (1+2)^{\,n-1} = 3^{\,n-1},
+\]
+which recovers the total.
+
+If each transition is chosen uniformly at random among the three symbols, then $M$ follows a binomial distribution: $M \sim \mathrm{Binomial}\bigl(n-1,\; \frac{2}{3}\bigr)$.
+
+\subsection{Joint Distribution of $M$ and $S$}
+
+The number of patterns with $M = k$ and a given net balance $S = s$ can be expressed as
+\[
+N_{k,s} = \binom{n-1}{k} \cdot \binom{k}{\frac{k+s}{2}},
+\]
+provided $s \equiv k \pmod{2}$ and $|s| \le k$; otherwise $N_{k,s}=0$. Summation of $N_{k,s}$ over $s$ returns $\binom{n-1}{k}2^{k}$.
+
+\section{Illustrative Examples}
+
+Table~\ref{tab:examples} shows ten randomly generated multi-directional patterns for $n=6$ candles (five transitions). Each row gives a unique ID, the symbolic sequence, the $1 \times 5$ ternary vector $\mathbf{m}$, migration count $M$, and net balance $S$.
+
+\begin{table}[h]
+\centering
+\caption{Ten Random Multi-Directional Developing POC Patterns ($n=6$)}
+\label{tab:examples}
+\begin{tabular}{c c c c c}
+\toprule
+\textbf{ID} & \textbf{Symbolic Sequence} & \textbf{Ternary Vector $\mathbf{m}$} & \textbf{$M$} & \textbf{$S$} \\
+\midrule
+1 & $> \; < \; = \; > \; >$ & $(-1,\, +1,\, 0,\, -1,\, -1)$ & 4 & -2 \\
+2 & $< \; = \; < \; > \; =$ & $(+1,\, 0,\, +1,\, -1,\, 0)$ & 3 & +1 \\
+3 & $= \; > \; < \; = \; <$ & $(0,\, -1,\, +1,\, 0,\, +1)$ & 3 & +1 \\
+4 & $< \; < \; < \; = \; >$ & $(+1,\, +1,\, +1,\, 0,\, -1)$ & 4 & +2 \\
+5 & $> \; = \; > \; < \; <$ & $(-1,\, 0,\, -1,\, +1,\, +1)$ & 4 & 0 \\
+6 & $= \; = \; < \; > \; =$ & $(0,\, 0,\, +1,\, -1,\, 0)$ & 2 & 0 \\
+7 & $< \; > \; = \; > \; <$ & $(+1,\, -1,\, 0,\, -1,\, +1)$ & 4 & 0 \\
+8 & $> \; < \; > \; = \; =$ & $(-1,\, +1,\, -1,\, 0,\, 0)$ & 3 & -1 \\
+9 & $= \; > \; = \; < \; >$ & $(0,\, -1,\, 0,\, +1,\, -1)$ & 3 & -1 \\
+10& $< \; = \; = \; > \; <$ & $(+1,\, 0,\, 0,\, -1,\, +1)$ & 3 & +1 \\
+\bottomrule
+\end{tabular}
+\end{table}
+
+\subsection{Visual Chart}
+
+Figure~\ref{fig:multipattern} illustrates pattern ID~7 ($< > = > <$) with the conventional right-to-left temporal orientation. The POC values are set arbitrarily to reflect the signed moves: starting at $y=3$, then $+1\,(4)$, $-1\,(3)$, $0\,(3)$, $-1\,(2)$, $+1\,(3)$. The annotations between points display the relation symbols. The migration count $M=4$ and net balance $S=0$.
+
+\begin{figure}[h]
+\centering
+\begin{tikzpicture}[scale=0.6]
+    \draw[->] (0,0) -- (6,0) node[right] {$t$ (candle index)};
+    \draw[->] (0,0) -- (0,5.5) node[above] {POC};
+    \foreach \x in {0,1,2,3,4,5} {
+        \pgfmathtruncatemacro{\idx}{-\x}
+        \draw (5-\x,0.1) -- (5-\x,-0.1) node[below] {\small $C_{\idx}$};
+    }
+    % Pattern ID 7: < > = > <   (m = +1, -1, 0, -1, +1)
+    % Points: (5,3), (4,4), (3,3), (2,3), (1,2), (0,3)
+    \draw[thick, blue] (5,3) -- (4,4) -- (3,3) -- (2,3) -- (1,2) -- (0,3);
+    \filldraw (5,3) circle (2pt) (4,4) circle (2pt) (3,3) circle (2pt) (2,3) circle (2pt) (1,2) circle (2pt) (0,3) circle (2pt);
+    \node[anchor=south] at (4.5,3.5) {$<$};
+    \node[anchor=south] at (3.5,3.5) {$>$};
+    \node[anchor=west]  at (2.5,3)   {$=$};
+    \node[anchor=south] at (1.5,2.5) {$>$};
+    \node[anchor=south] at (0.5,2.5) {$<$};
+\end{tikzpicture}
+\caption{Visualization of multi-directional pattern ID~7: $< > = > <$ ($M=4$, $S=0$). Right-to-left orientation places current candle $C_0$ on the right.}
+\label{fig:multipattern}
+\end{figure}
+
+\section{Conclusion}
+
+We have fully enumerated the set of all multi-directional developing POC line patterns on a pre-market session of $n$ candles. The total number is $3^{\,n-1}$, arising from the independence of the three possible relations ($<$, $>$, $=$) at each of the $n-1$ transitions. A ternary encoding with $\{+1,0,-1\}$ provides a compact signed representation. The migration count $M$ and end-to-end net balance $S$ offer interpretable summaries of pattern activity and directional bias. Exact combinatorial formulas give the number of patterns possessing any prescribed $M$, and jointly with $S$. The state-transition matrix formulation independently verifies the count. These results form a theoretical foundation for pattern classification, statistical testing, and machine-readable feature construction in pre-market analysis.
+
+\begin{thebibliography}{1}
+\bibitem{marketprofile}
+J.~F.~Dalton, \emph{Mind Over Markets: Power Trading with Market Generated Information}. Marketplace Books, 2013.
+\bibitem{combinatorics}
+R.~P.~Stanley, \emph{Enumerative Combinatorics}, vol.~1, 2nd~ed. Cambridge University Press, 2011.
+\end{thebibliography}
+
+\end{document}

developing_poc/od.topodevpoc.pdf

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:e9186b08dfad199cd5e04ee04b65facfd40db982eb43a6b12186e4e53edc71fb
+size 244382

developing_poc/od.topodevpoc.tex

@@ -0,0 +1,275 @@
+\documentclass[conference]{IEEEtran}
+\usepackage{amsmath, amssymb, amsthm}
+\usepackage{graphicx}
+\usepackage{array}
+\usepackage{booktabs}
+\usepackage{cite}
+\usepackage{tikz}
+\usepackage{xcolor}
+
+% Theorem environments
+\newtheorem{theorem}{Theorem}
+\newtheorem{lemma}{Lemma}
+\newtheorem{corollary}{Corollary}
+\newtheorem{definition}{Definition}
+\newtheorem{proposition}{Proposition}
+
+\begin{document}
+
+\title{OD.TopoDevPOC: Topologically Unique One-Directional Developing Point-of-Control Patterns in Pre-Market K-Lines}
+
+\author{\IEEEauthorblockN{ConQ Research Team}\\
+\IEEEauthorblockA{\textit{Continual Quasars}\\
+April 20, 2026}
+}
+
+\maketitle
+
+\begin{abstract}
+This paper establishes the exact combinatorial enumeration of all possible unique developing Point of Control (POC) line patterns observed during the pre-market session consisting of $n = 39$ three-minute candlesticks. Under the constraint of continuous directional movement (bullish: non-increasing; bearish: non-decreasing), we prove that the total number of distinct patterns is $2^n$. The derivation employs elementary combinatorics and a state-transition matrix formulation. Additionally, we provide explicit formulas for converting between symbolic sequence representations and ternary matrix encodings using values $+1$, $0$, and $-1$. An equation for computing the number of migrated POC locations (strict moves) from the ternary matrix encoding is introduced, quantified as the $L_1$ norm of the pattern vector. Ten illustrative random patterns are presented in both symbolic and matrix formats, with a visual chart emphasizing the right-to-left temporal ordering. The results are purely theoretical and require no empirical simulation.
+\end{abstract}
+
+\begin{IEEEkeywords}
+developing POC, combinatorial enumeration, candlestick patterns, monotonic sequences, transition matrix, pre-market analysis
+\end{IEEEkeywords}
+
+\section{Introduction}
+
+The Point of Control (POC) is the price level at which the maximum volume is traded during a given time interval. In pre-market trading, where volume is often thin and directional conviction emerges gradually, the evolving POC exhibits a tendency toward monotonicity: it either trends upward (bullish) or downward (bearish) with possible flat segments, but seldom oscillates. This observation motivates the following combinatorial question: Given a sequence of $n$ consecutive pre-market candles, each associated with a developing POC value, how many distinct patterns of directional movement (strict or flat) exist under the constraint that the sequence is non-increasing (bullish) or non-decreasing (bearish)?
+
+The present work provides a definitive answer to this question, with the following main contributions:
+
+\begin{enumerate}
+    \item A closed-form enumeration showing that for $n$ candles there are exactly $2^n$ unique developing POC line patterns.
+    \item A matrix-based state-transition formulation that validates the combinatorial result.
+    \item Explicit formulas for converting a pattern between its symbolic sequence representation and a ternary matrix encoding using values $+1$ (strict up), $-1$ (strict down), and $0$ (equality).
+    \item An equation for computing the number of migrated POC locations (strict moves) from the ternary matrix encoding, quantified as the $L_1$ norm of the pattern vector.
+    \item A set of ten randomly generated pattern examples, displayed in both symbolic and ternary matrix forms, with a visual chart aligned to the correct right-to-left temporal order.
+\end{enumerate}
+
+The analysis is purely theoretical; no simulations, empirical data, or numerical approximations are employed.
+
+\section{Problem Definition and Notation}
+
+Let $n \in \mathbb{N}$ denote the number of candles. For the conventional pre-market session, $n = 39$. Index candles from most recent to oldest as
+\begin{equation}
+    C_0, C_{-1}, C_{-2}, \dots, C_{-(n-1)}.
+\end{equation}
+The corresponding developing POC values form a sequence
+\begin{equation}
+    \mathbf{p} = (p_0, p_1, \dots, p_{n-1}) \in \mathbb{R}^n,
+\end{equation}
+where $p_k$ denotes the POC value of candle $C_{-k}$.
+
+\begin{definition}[Continuous Bullish Pattern]
+A sequence $\mathbf{p}$ is a \emph{continuous bullish pattern} if for every $k = 0, 1, \dots, n-2$, the relation $R_k \in \{>, =\}$ holds between $p_k$ and $p_{k+1}$, i.e.,
+\begin{equation}
+    p_k \geq p_{k+1}, \quad \text{with } p_k > p_{k+1} \text{ or } p_k = p_{k+1}.
+\end{equation}
+\end{definition}
+
+\begin{definition}[Continuous Bearish Pattern]
+A sequence $\mathbf{p}$ is a \emph{continuous bearish pattern} if for every $k = 0, 1, \dots, n-2$, the relation $R_k \in \{<, =\}$ holds between $p_k$ and $p_{k+1}$, i.e.,
+\begin{equation}
+    p_k \leq p_{k+1}, \quad \text{with } p_k < p_{k+1} \text{ or } p_k = p_{k+1}.
+\end{equation}
+\end{definition}
+
+A pattern is uniquely identified by the $(n-1)$-tuple of relations $(R_0, R_1, \dots, R_{n-2})$. Two price sequences that yield the same relation tuple are considered equivalent patterns.
+
+\section{Combinatorial Enumeration}
+
+\begin{theorem}
+For any $n \ge 1$, the number of continuous bullish developing POC patterns of length $n$ is $2^{n-1}$. The number of continuous bearish patterns is also $2^{n-1}$. Consequently, the total number of distinct patterns is $2^n$.
+\end{theorem}
+
+\begin{proof}
+For a bullish pattern, each adjacent pair $(p_k, p_{k+1})$ permits exactly two relations: $>$ or $=$. The $n-1$ choices are independent. Thus the number of bullish patterns is $2^{n-1}$. An identical argument applies to bearish patterns with relations $<$ and $=$. Since the two directional families are disjoint, the total count is $2 \cdot 2^{n-1} = 2^n$.
+\end{proof}
+
+For $n = 39$, the exact total number of unique patterns is
+\begin{equation}
+    T_{39} = 2^{39}.
+\end{equation}
+
+\section{Matrix Formulation and State Transition}
+
+Define a ternary state variable $m_k$ for each transition $k$ ($0 \le k \le n-2$) as follows:
+\begin{itemize}
+    \item For a bullish pattern:
+    \begin{equation}
+        m_k = \begin{cases}
+            +1, & \text{if } R_k = \; >, \\
+            0,  & \text{if } R_k = \; =.
+        \end{cases}
+    \end{equation}
+    \item For a bearish pattern:
+    \begin{equation}
+        m_k = \begin{cases}
+            -1, & \text{if } R_k = \; <, \\
+            0,  & \text{if } R_k = \; =.
+        \end{cases}
+    \end{equation}
+\end{itemize}
+Note that in either directional family, the allowed values are either $\{+1, 0\}$ (bullish) or $\{-1, 0\}$ (bearish). Consequently, a pattern is equivalent to a ternary vector of length $n-1$:
+\begin{equation}
+    \mathbf{m} = (m_0, m_1, \dots, m_{n-2}) \in \{-1,0,+1\}^{n-1},
+\end{equation}
+subject to the constraint that all nonzero entries share the same sign.
+
+\subsection{Transition Matrix Representation}
+
+Consider the directed graph with two states $\{S_0, S_{\pm}\}$ corresponding to the last observed relation being equality ($S_0$) or strict move ($S_{\pm}$, with sign determined by direction). Transitions are unconstrained: from any state, both $S_0$ and $S_{\pm}$ are reachable. The adjacency matrix is
+\begin{equation}
+    \mathbf{A} = \begin{pmatrix}
+        1 & 1 \\
+        1 & 1
+    \end{pmatrix}.
+\end{equation}
+Let $\mathbf{v}_0 = (1,1)^\top$ be the initial vector (both states permissible before any comparison). The number of patterns with $n$ candles (i.e., $n-1$ transitions) is
+\begin{equation}
+    B_n = \mathbf{1}^\top \mathbf{A}^{n-2} \mathbf{v}_0,
+\end{equation}
+where $\mathbf{1} = (1,1)^\top$. Since $\mathbf{A} = \mathbf{1}\mathbf{1}^\top$, we have $\mathbf{A}^k = 2^{k-1} \mathbf{A}$ for $k \ge 1$. Hence,
+\begin{align}
+    B_n &= \mathbf{1}^\top \left( 2^{n-3} \mathbf{A} \right) \mathbf{v}_0 \nonumber \\
+        &= 2^{n-3} \mathbf{1}^\top \mathbf{A} \mathbf{1} \nonumber \\
+        &= 2^{n-3} \cdot 4 = 2^{n-1}.
+\end{align}
+This matrix derivation confirms the combinatorial count independently.
+
+\section{Conversion Between Symbolic Sequence and Ternary Matrix}
+
+We establish bidirectional conversion formulas between the symbolic sequence representation (a string of symbols $>$ and $=$, or $<$ and $=$) and the ternary matrix (row vector) encoding.
+
+\subsection{Symbolic Sequence to Ternary Matrix}
+
+Let $\Sigma$ be a string of length $n-1$ over alphabet $\{>, =\}$ for bullish, or $\{<, =\}$ for bearish. Define the mapping $f$:
+\begin{align}
+    f_{\text{bullish}}(>) &= +1, & f_{\text{bullish}}(=) &= 0, \\
+    f_{\text{bearish}}(<) &= -1, & f_{\text{bearish}}(=) &= 0.
+\end{align}
+The ternary matrix $\mathbf{M}$ of size $1 \times (n-1)$ is given by
+\begin{equation}
+    \mathbf{M}_{1,j+1} = f(\Sigma_j), \quad j = 0,1,\dots,n-2.
+\end{equation}
+That is, $\mathbf{M} = \begin{pmatrix} f(\Sigma_0) & f(\Sigma_1) & \cdots & f(\Sigma_{n-2}) \end{pmatrix}$.
+
+\subsection{Ternary Matrix to Symbolic Sequence}
+
+Conversely, given a ternary row matrix $\mathbf{M} = (m_0, m_1, \dots, m_{n-2})$ with $m_j \in \{+1,0\}$ for bullish or $\{-1,0\}$ for bearish, the symbolic sequence is obtained by applying the inverse mapping $g$:
+\begin{align}
+    g_{\text{bullish}}(+1) &= >, & g_{\text{bullish}}(0) &= =, \\
+    g_{\text{bearish}}(-1) &= <, & g_{\text{bearish}}(0) &= =.
+\end{align}
+Formally,
+\begin{equation}
+    \Sigma_j = g(m_j),
+\end{equation}
+and the sequence is $\Sigma = \Sigma_0 \Sigma_1 \cdots \Sigma_{n-2}$.
+
+These conversions are one-to-one and preserve pattern identity.
+
+\section{Migration Count: Number of Strict Moves}
+
+A natural quantitative property of a developing POC pattern is the number of times the POC level actually changes location (i.e., the number of strict moves). This count, denoted by $M$, is simply the number of nonzero entries in the ternary vector $\mathbf{m}$.
+
+\begin{definition}[Migration Count]
+For a continuous developing POC pattern encoded by the ternary vector $\mathbf{m} = (m_0, \dots, m_{n-2})$, the \emph{migration count} $M$ is defined as
+\begin{equation}
+    M(\mathbf{m}) = \sum_{k=0}^{n-2} |m_k| = \|\mathbf{m}\|_1,
+\end{equation}
+where $\|\cdot\|_1$ denotes the $L_1$ norm (sum of absolute values). For bullish patterns, $m_k \in \{+1,0\}$; hence $|m_k| = m_k$ (since $+1 \ge 0$). For bearish patterns, $m_k \in \{-1,0\}$; hence $|m_k| = -m_k$. In either case, $M$ counts the number of strict directional steps.
+\end{definition}
+
+The migration count satisfies $0 \le M \le n-1$. The extreme case $M = 0$ corresponds to the all‑equality pattern (flat POC line). The opposite extreme $M = n-1$ corresponds to a pattern with no equalities (continuously strict move). Because the entries of $\mathbf{m}$ are independent within the sign constraint, the distribution of $M$ for a given direction follows a binomial distribution with $n-1$ trials and success probability $1/2$ (assuming each transition independently chooses strict or flat). Specifically,
+\begin{equation}
+    \Pr(M = k \mid \text{direction fixed}) = \binom{n-1}{k} \left(\frac{1}{2}\right)^{n-1}, \quad k = 0,1,\dots,n-1.
+\end{equation}
+This probabilistic interpretation aligns with the total count $2^{n-1}$ per direction.
+
+The migration count is directly computable from the symbolic sequence by counting the occurrences of $>$ (bullish) or $<$ (bearish), ignoring $=$. It is also immediately obtained from the ternary matrix via the $L_1$ norm.
+
+\section{Illustrative Examples}
+
+We present ten randomly generated continuous developing POC patterns. For compactness, we use $n = 6$ candles (5 transitions). Each pattern is displayed with its directional label, symbolic sequence, corresponding $1 \times 5$ ternary matrix, and migration count $M$.
+
+\begin{table}[h]
+\centering
+\caption{Ten Random Continuous Developing POC Patterns ($n=6$)}
+\label{tab:examples}
+\begin{tabular}{c c c c c}
+\toprule
+\textbf{ID} & \textbf{Direction} & \textbf{Symbolic Sequence} & \textbf{Ternary Matrix ($1 \times 5$)} & \textbf{$M$} \\
+\midrule
+1 & Bullish & $> \; > \; = \; > \; =$ & $\begin{pmatrix}+1 & +1 & 0 & +1 & 0\end{pmatrix}$ & 3 \\
+2 & Bullish & $= \; > \; = \; = \; >$ & $\begin{pmatrix}0 & +1 & 0 & 0 & +1\end{pmatrix}$ & 2 \\
+3 & Bearish & $< \; = \; < \; < \; =$ & $\begin{pmatrix}-1 & 0 & -1 & -1 & 0\end{pmatrix}$ & 3 \\
+4 & Bearish & $= \; = \; < \; = \; <$ & $\begin{pmatrix}0 & 0 & -1 & 0 & -1\end{pmatrix}$ & 2 \\
+5 & Bullish & $> \; = \; = \; > \; >$ & $\begin{pmatrix}+1 & 0 & 0 & +1 & +1\end{pmatrix}$ & 3 \\
+6 & Bullish & $= \; > \; > \; = \; >$ & $\begin{pmatrix}0 & +1 & +1 & 0 & +1\end{pmatrix}$ & 3 \\
+7 & Bearish & $< \; < \; = \; = \; <$ & $\begin{pmatrix}-1 & -1 & 0 & 0 & -1\end{pmatrix}$ & 3 \\
+8 & Bearish & $= \; < \; = \; < \; =$ & $\begin{pmatrix}0 & -1 & 0 & -1 & 0\end{pmatrix}$ & 2 \\
+9 & Bullish & $> \; > \; > \; = \; =$ & $\begin{pmatrix}+1 & +1 & +1 & 0 & 0\end{pmatrix}$ & 3 \\
+10 & Bearish & $< \; = \; = \; = \; <$ & $\begin{pmatrix}-1 & 0 & 0 & 0 & -1\end{pmatrix}$ & 2 \\
+\bottomrule
+\end{tabular}
+\end{table}
+
+\subsection{Visual Chart with Correct Temporal Ordering}
+
+The temporal axis is oriented from right to left, aligning with the index convention $C_0$ (current candle, $t=0$) at the rightmost position, followed by $C_{-1}$, $C_{-2}$, etc., proceeding leftwards. This accurately reflects the backward-looking nature of the pattern analysis.
+
+Figure~\ref{fig:pattern1} depicts Pattern 1 (Bullish: $> > = > =$) with this right-to-left orientation. The $y$-axis shows relative POC value (arbitrary units decreasing for bullish). The migration count $M=3$ corresponds to the three downward-sloping segments.
+
+\begin{figure}[h]
+\centering
+\begin{tikzpicture}[scale=0.6]
+    % x-axis reversed: 0 on the right, negative indices to the left
+    \draw[->] (0,0) -- (6,0) node[right] {$t$ (candle index)};
+    \draw[->] (0,0) -- (0,5) node[above] {POC};
+    % Labels: C_0 at x=5, C_{-1} at x=4, ..., C_{-5} at x=0
+    \foreach \x in {0,1,2,3,4,5} {
+        \pgfmathtruncatemacro{\idx}{-\x}
+        \draw (5-\x,0.1) -- (5-\x,-0.1) node[below] {\small $C_{\idx}$};
+    }
+    % Pattern: > > = > =
+    % Starting value 5, then steps: -1, -1, 0, -1, 0
+    % Plot from right to left: C_0 (x=5, y=5), C_{-1} (x=4, y=4), ...
+    \draw[thick, blue] (5,5) -- (4,4) -- (3,3) -- (2,3) -- (1,2) -- (0,2);
+    \filldraw (5,5) circle (2pt) (4,4) circle (2pt) (3,3) circle (2pt) (2,3) circle (2pt) (1,2) circle (2pt) (0,2) circle (2pt);
+    % Annotate relations between points (placed near the line segment)
+    \node[anchor=south] at (4.5,4.5) {$>$};
+    \node[anchor=south] at (3.5,3.5) {$>$};
+    \node[anchor=south] at (2.5,3)   {$=$};
+    \node[anchor=south] at (1.5,2.5) {$>$};
+    \node[anchor=south] at (0.5,2)   {$=$};
+\end{tikzpicture}
+\caption{Visualization of Bullish Pattern 1: $> > = > =$ ($M=3$). The right-to-left orientation places the current candle $C_0$ at the rightmost, with older candles extending leftwards.}
+\label{fig:pattern1}
+\end{figure}
+
+\section{Discussion and Consistency Verification}
+
+The enumeration $2^{39}$ demonstrates the vast theoretical space of possible continuous developing POC patterns during the pre-market session. Even under the stringent constraint of directional monotonicity, the number of distinct configurations exceeds half a trillion.
+
+The ternary matrix representation using $+1$, $0$, and $-1$ provides a compact, signed encoding that inherently encodes both the direction (sign) and the presence of a strict move. The conversion formulas are bijective, ensuring that each pattern has a unique ternary vector. The migration count $M = \|\mathbf{m}\|_1$ offers a simple, interpretable metric for pattern activity, directly computable from either the symbolic sequence or the ternary matrix.
+
+The state-transition matrix derivation independently confirms the count $2^{n-1}$ per direction, serving as a cross-check of the combinatorial proof. Moreover, the examples demonstrate that patterns may contain any number of equalities, including the extreme case of all $=$ symbols (ternary matrix of all zeros, $M=0$), which corresponds to a completely flat developing POC line.
+
+The chart orientation (right to left) aligns with the temporal indexing convention and aids in intuitive interpretation by placing the most recent information at the viewer's natural scanning direction.
+
+Extensions of this work may consider patterns where the number of consecutive equalities is bounded, or where transition probabilities are non-uniform. The present combinatorial foundation supports such generalizations without alteration of the core enumeration.
+
+\section{Conclusion}
+
+We have determined that the total number of unique continuous developing POC line patterns for a sequence of $n$ pre-market candlesticks is $2^n$, with exactly $2^{39}$ patterns for the conventional $n=39$ session. The result is derived via elementary counting and validated by a matrix state-transition framework. Formulas for interconversion between symbolic sequences and ternary matrices (using $+1$, $0$, $-1$) are provided. An equation for the migration count (number of strict moves) as the $L_1$ norm of the pattern vector is introduced, offering a compact summary statistic. Ten illustrative random patterns with their migration counts are presented, along with a correctly oriented visual chart. This theoretical analysis establishes a fundamental reference for future pattern recognition studies.
+
+\begin{thebibliography}{1}
+\bibitem{marketprofile}
+J. F. Dalton, \emph{Mind Over Markets: Power Trading with Market Generated Information}. Marketplace Books, 2013.
+\bibitem{combinatorics}
+R. P. Stanley, \emph{Enumerative Combinatorics}, vol. 1, 2nd ed. Cambridge University Press, 2011.
+\end{thebibliography}
+
+\end{document}