Glossary of Fomenko’s New Chronology

Enquête-Code (Written Biography):
Fomenko laid out 34 points of investigation that can be used to create a biography for an historical figure. These can each be marked as EC1 to EC34.
Page [1]: 57-59.

The F-model:
A corollary of local maximas between volume graphs vol X(t) and vol Y(t). A corollary to the basic hypothesis of 4.3.1. [1, p.51]
The hypothesis – “Though, with time, the amplitude of the volume graph for the surviving textual stock decreases gradually (since ancient texts get lost and destroyed), more remains from those years ci whose events were described by contemporaries in a considerable number of texts.” [1, p.43]

“Namely, the years of local maxima ri(X) should be close to those denoted by ri(Y) for any two historical texts X and Y describing one historical epoch (A, B) in the history of the same region Γ.
In other words, the volume graphs vol X(t) and vol Y(t) must attain local maxima, i.e., form peaks, approximately at the same points (years) in the time interval (A, B).” [1, p.43]

Page [1]: 43, 51.

Generation Chapter:
“In short, we call a fragment of a text describing the events of one generation “a generation chapter”.”
Page [1]: 146.

The K-model:
A statistical hypothesis… A corollary to the basic hypothesis of 4.3.1. [1, p.51]
The hypothesis – “Though, with time, the amplitude of the volume graph for the surviving textual stock decreases gradually (since ancient texts get lost and destroyed), more remains from those years ci whose events were described by contemporaries in a considerable number of texts.” [1, p.43]

Page [1]: 43, 50, 51.

Laws of Information Density Conservation:
“The laws of information density conservation permit us to introduce a formal procedure to date the events described in texts with lost or unknown dating.”
Page [1]: 39, 52.

Law of Information Density Conservation:
???
Page [1]: 42.

Local maxima:
The point where “The height of the function at “a” is greater than (or equal to) the height anywhere else in that interval.” [source]
Page [1]: 42.

The Map-Code:
Explained on page 11.
Page [2]: 11.

Method for Comparing the Sets of Informative Functions for Two Historical Epochs:
Explained on pages 60 and 61 in [1].
Page [1]: 60-61.

Method for Dating Historical Events Described in Chronographic Texts:
Explained on pages 9 and 10.
Page [2]: 9-10.

Method for Discovery of Dependent Historical Texts:
???
Page [2]: S2.

Method for Duplicate-Discovery/Duplicate Discovery Method:
Explained on pages 151 and 152 in [1].
Page [1]: 151-152.

Method for Duplicate Recognition:
“In the experiment which I performed, the discovery of such double peaks of the frequency graph (which corresponds to the duplicates) occurred as follows. Let aij be an element of the matrix K{T}, placed in the ith row and the jth column. Consider the matrix {ααβ} consisting of the elements ααβ, where αi and βj, i.e., part of the large matrix K{T} bounded by the ith row and jth column. We construct the averaged frequency graph Kijav(t) for it by averaging the values positioned in the matrix {ααβ} on the diagonals parallel to the principle one. We now assume that the ith and the jth columns of the frequency matrix K{T} correspond to two duplicates X(i) and X(j), i.e., T = i or T = j. Then the averaged frequency graph of Kijav(t) has the form represented in Fig.17, i.e., it possesses two maxima.
Then, by marking all those elements aij (where i < j) in the large matrix K{T} for which the averaged graph of Kijav(t) has such an anomalous form, we discover those chapters which may be duplicates. It was required in concrete computations that the averaged graph of Kpqav(t), where p = i + s and q = js, on the average should be monotonically decreasing if the positive integer s is sufficiently small compared to the difference ji.” [1, p.81]
Page [1]: 79, 81.

Method for Finding the Chronologically Correct Order of Chapters in a Historical Chronicle/Method of Chapter Ordering:
“We now describe the method of finding the chronologically correct order of chapters in a historical text X (or in a whole set of texts). Number all the chapters of the text X in a certain order, e.g., in which they occur in the text itself. We then determine the graph of K(T0, T) described above for each separate chapter X(T0). The number of these graphs will equal that of the chapters in the text X. All these values K{T} (for the variables T0 and T) are naturally organized into a square matrix K{T} of order n × n, where n is the total number of chapters in the text.” [1, p.77]

“This method of chapter ordering permits us to date ancient events.” [1, p.79]
Page [1]: 77, 79.

Method for Ordering Texts in Time:
“The present method permits us, for example, to discover a chronologically correct order for individual textual chapters and duplicates on the basis of the collection of proper names mentioned.” [1, p.145]

“The method also permits us to date events.” [1, p.150]

Page [1]: 145, 150.

Method for Restoring the Graph of the Primary and Surviving Information Stock:
“Construct the informative functions ƒi(t, Y) and consider the set of all absolutely dated texts X. We also construct their informative functions ƒi(t, X) and assume that we can choose X with some ƒi(t, X), or at once their whole set, close in the sense of smallness of the coefficient d to an informative function ƒi(t, Y). In other words, d(ƒi(X), ƒi(Y)) is “small” (i.e., it is close to the values of the coefficient d(ƒi(Z), ƒi(V)) for surely dependent pairs Z and V.” [1, p.52]
Page [1]: 52.

Method for Text Ordering and Duplicate Recognition:
“The method of text ordering and duplicate recognition is also applicable to the list of reciprocal citations in any closed collection of historical and other texts.” [1, p.81]
Page [1]: 81.

Methods for Ordering and Dating Old Geographic Maps and Descriptions:
???
Page [2]: S4.

Numerical Dynasty:
The “sequence of numbers represented as an integral vector a in the space Rn“. The sequence of numbers is obtained from a real dynasty. Two chroniclers writing about the same real dynasty could, due to differences in chronicling, produce two differing numerical dynasties (based on the original real dynasty).
Page [1]: 68.

Primary information stock:
The total amount of textual information.
Page [1]: 42.

Principle of Amplitude Correlation/Amplitude Correlation Principle:
A – “If texts X and Y are dependent, then their volume graphs vol X(t) and vol Y(t) must correlate strongly within their poor zones. On the other hand, there may be little or no amplitude correlation within their rich zones when the graphs are superimposed.”
B – “If texts X and Y are independent, then their volume graphs must be independent within their poor zones.”
Page [5]: 192, 198.

Principle of Maximum Correlation/Principle of Correlation of Maxima/Maxima Correlation Principle/Maximum Correlation Principle:
A – “If two texts X and Y are dependent, then their volume functions exhibit “splashes” that are essentially simultaneous, i.e. the local maxima of vol X(t) and vol Y(t) correlate.”
B – “If two texts X and Y are independent then the local maxima of their volume function do not correlate.”

“The volume graphs for the chapters of two dependent texts X and Y which describe the same period (A, B) and the state Γ must attain local maxima, or form peaks, simultaneously, i.e. years described in X and Y in detail should be close or coincide. Conversely, if two texts X and Y are known as undoubtedly independent and describe either different periods (A, B) and (C, D) of the same length or different states, then their volume graphs reach local maxima at different points if we let (A, B) and (C, D) coincide.” [1, p.141]

“The graphs of undoubtedly dependent texts form peaks almost simultaneously, and the peaks are not correlated on graphs of undoubtedly independent texts”.

Page [1]: 47, 141, 142-143.
Page [5]: 188.
Page [3]: 668.

Principle of Frequency Damping/Frequency Damping Principle:
“In numbering the chapters chronologically correctly (i.e., chapters describing the same events), with duplicates being absent among them, each graph of K(T0, T) vanishes to the right of the point T0 itself and decreasing monotonically to the right of T0.” [1, pp.76-77]

“In the correct enumeration of chapter generations, the author of the text, while proceeding from the description of one generation to another, also describes other historical figures, namely, he does not speak at all of the personages of the generations (since they have not yet been born) belonging to those prior to a generation numbered To; then, in describing To, the author speaks of the historical figures of this generation more, since the described events are related to them most; and, finally, proceeding with the description of subsequent generations, the author mentions the prior historical figures still less and less, since new events with new historical figures drive out the dead.” [1, pp.146-147]

“In the chronologically correct enumeration of chapter generations, each graph of K(To, T) should vanish to the left of To, attain an absolute maximum at To, and then gradually dampen.” [1, p.147]

Page [1]: 76-77, 146-147.

Principle of Frequency Decay/Frequency Decay Principle:
???
Page [5]: 189.

Principle of Frequency-Duplicating/Frequency-Duplicating Principle:
“Thus, if the chapters of the text, which in general are numbered chronologically correctly, contain two whose frequency graphs have the form approximately in Fig. 17, then they are probably duplicates and should be identified.” [1, p.80]
Page [1]: 79, 80.

Principle of Map-Improvement:
“A sequence of maps is ordered chronologically correctly if and only if each graph of L(T0, T) is of the form shown in Fig.39, i.e., vanishes to the left of T0, attains an absolute maximum at T0, and falls monotonically to the right.” [2, pp.12-13]
Page [2]: 12-13.

Principle of Monotone Information Loss/Monotone Information Loss Principle:
“The farther we move in time from the epoch [A, B] of interest, the fewer documents from this epoch usually remain and the less we can learn about it.”
Page [5]: 188.

Principle of “Regard-for-Information”/“Regard-for-Information” Principle:
“The regard for information varies inversely with its volumes.” Chroniclers are forced to give full attention to poor texts than rich texts, as there is less to draw from a poor text than a rich one.
Page [5]: 192.

Principle of Small Distortion/Small Distortion Principle:
“If two numerical dynasties are sufficiently close (in the sense of the measure λ), then they indeed represent the same real dynasty of kings, i.e., they are merely two different versions of its description.
Such numerical dynasties will be called dependent. On the contrary, if two numerical dynasties represent two real dynasties of kings, known a priori as different, then the numerical dynasties are much different from one another (in the sense of the measure λ). Such numerical dynasties will be called independent.”
Page [1]: 68, 69.

Real Dynasty:
Let n represent “consecutive authentic rulers”, and the “true rule durations” of those rulers be “p1, p2, …, pn”.
Page [1]: 68

Statistical hypothesis (theoretical model):
“is a hypothesis that is testable on the basis of observing a process that is modeled via a set of random variables.” [source]
Page [1]: 50, 68.

Stream Deviation Coefficient (SDC):
The coefficient λ.
Page [1]: 60.

Surviving information stock:
The remaining amount of textual information left over from the primary information stock.
Page [1]: 43.

~~~~~ ~~~~~ ~~~~~ ~~~~~

References:

[1] – http://chronologia.org/en/kw1.pdf (1994). Accessed 26 July 2020.

[2] – http://chronologia.org/en/kw2.pdf. Accessed 26 July 2020.

[3] – Statistical estimation of chronological nearness of historical texts (1986). Accessed 26 July 2020.

[4] – http://chronologia.org/en/seven/2NA3-EN.pdf. Accessed 27 July 2020.

[5] – http://chronologia.org/en/volume_functions_of_historical_texts.pdf (1990). Accessed 26 July 2020.

~~~~~ ~~~~~ ~~~~~ ~~~~~

Gain access to exclusive Ctruth activities, benefits, and content @

~~~~~ ~~~~~ ~~~~~ ~~~~~

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: