Pith. sign in

REVIEW 1 major objections 5 minor 50 references

Permutation-Based Distances for Groups and Group-Valued Time Series

T0 review · 1 major / 5 minor · reviewed 2026-08-04 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Cayley's theorem lets every finite group carry the Cayley and Kendall permutation distances as generator-free metrics.

desk verdict A useful but not deep construction: pullback permutation metrics via Cayley embedding, with an unacknowledged ordering dependence in the Kendall variant and a couple of fixable errors. read the letter →

arxiv 2509.09191 v1 pith:XU5CCUIP submitted 2025-09-11 math-ph math.MP

José M. Amigó , Roberto Dale This is my paper · ORCID
classification math-phmath.MP MSC 05A0520B3537B1037M10
keywords finitegroupsCayleydistanceKendallCayley'stheoremordinalpatternsgroup-valuedtimeserieseditdistancestranscripts
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper sets out to give every finite group the same metric toolkit that has proved useful for permutations in ordinal time-series analysis. It transports the Cayley and Kendall edit distances from symmetric groups to an arbitrary finite group G by embedding G into Sym(G) through Cayley's theorem. The resulting distance is left-invariant, expressible as the norm of a transcript Phi(a)^{-1}Phi(b), and computable from the group's multiplication table without choosing a generating set. This matters because ordinal patterns are permutations, so any finite group that appears as a symbolic alphabet can now be compared element-wise or window-wise, enabling synchronization and similarity analysis for group-valued time series.

What carries the argument

The carrying mechanism is Cayley's theorem implemented as left translations: each group element a maps to the permutation Lambda_a : b -> a*b, read row-wise from a chosen enumeration of the group's multiplication table. The source metrics are the Cayley distance (minimum number of transpositions to transform one permutation into another) and the Kendall distance (minimum number of adjacent transpositions), both edit distances on the symmetric group. The isometry Phi transfers these distances from Sym(G) back to G, and the identity d_C,K(r,s) = ||r^{-1}s|| turns the distance between group elements into the norm of a transcript, connecting the metric directly to the group operation.

What would settle it

Compute the Kendall-based distance D_K for a small group such as Z_4 or the Klein four-group under two different element orderings, for example (0,1,2,3) and (0,2,1,3). If the resulting distance matrices do not coincide up to a relabeling that is an automorphism of the group, the Kendall version is an artifact of the enumeration rather than an intrinsic property of the abstract group.

Watch

Extended reading notes

Core claim

Definition 18 is the paper's central assertion: for a finite group G and a Cayley isomorphism Phi from G into a symmetric group, D^(Phi)_C,K(a,b) = d_C,K(Phi(a), Phi(b)) is a distance on G with the same properties as d_C,K—left invariance, positivity, symmetry, and the triangle inequality—and it can be written as ||Phi(a)^{-1}Phi(b)||, the Cayley or Kendall norm of the transcript from a to b. The paper argues that because any finite group embeds into a symmetric group, permutations serve as a universal alphabet for algebraic representations of time series, so the two permutation edit distances become available for every finite group. It also works out concrete examples (Klein four-group, cyc

Load-bearing premise

The construction assumes that the chosen Cayley isomorphism, including the arbitrary enumeration of the group's elements in the multiplication table, is an acceptable canonical input; because the Kendall metric is not invariant under relabeling, different orderings of the same group can give different distances.

Editorial extensions

If this is right

  • Any finite group, not just symmetric groups, inherits a left-invariant metric from permutation edit distances, with values bounded by |G|-1 for the Cayley version and |G|(|G|-1)/2 for the Kendall version.
  • Distances between elements of a group-valued time series can be computed as norms of transcripts, so transcript-based analyses of synchronization and causality gain an explicit metric companion.
  • Sliding-window l_p distances built on D^(Phi) yield element-wise and window-wise distance time series; in the numerical study they distinguish no, weak, and strong generalized synchronization in coupled Hénon systems.
  • For G = Sym(L), the embedded Kendall distance is proportional to the original Kendall distance in the tested cases (factor 3 for L=3, 46 for L=4, 714 for L=5), preserving the quantitative information of the original metric.
  • The construction needs only the multiplication table and can be computed in O(|G| log |G|) time, avoiding the search for minimal generating-set expressions.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper leaves implicit that the Kendall version depends on the arbitrary enumeration of G used to build the multiplication table, since Kendall distances count inversions relative to an ordering; two orderings of the same abstract group can generate different distance values, so downstream time-series conclusions should be checked for stability under relabeling.
  • The same transport recipe could be applied to any metric on the symmetric group, not only Cayley and Kendall, so the paper effectively opens a family of permutation-based group metrics parametrized by the choice of permutation distance.
  • The forbidden-distance gaps noted in the paper could be turned into a diagnostic: a white-noise baseline would calibrate which gaps are structural, and deviations from that baseline might serve as a synchronization or determinism signature.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 5 minor

Summary. The paper proposes a general construction of distances on arbitrary finite groups: embed G into a symmetric group via Cayley's theorem (primarily via left translations) and pull back either the Cayley distance or the Kendall tau distance from the symmetric group. This yields D^(Phi)_C and D^(Phi)_K on G, which are left-invariant and admit a norm representation. The paper then extends these distances to G-valued time series by element-wise and window-wise comparison, and illustrates the method on ordinal representations of coupled Hénon systems. The central Definition 18 is straightforward and, once a Cayley embedding and an ordering of G are fixed, produces genuine distances. However, the manuscript contains a false general statement of Cayley's theorem, a numerical error in the Sym(3) proportionality factor, and an unacknowledged dependence of the Kendall-based distance on the arbitrary enumeration of G. These issues affect the paper's advertised generality and require correction.

Significance. If the construction is properly qualified, the paper offers a computationally convenient, generator-free way to metrize finite groups and group-valued time series, which is of interest in ordinal-pattern and transcript-based time-series analysis. The paper has useful worked examples, explicit distance tables, and a numerical benchmark. Its main theoretical content is elementary: the pullback of a metric under a faithful permutation representation. The claimed generality, however, is currently overstated: the Kendall variant is not invariant under relabeling of G, Theorem 4 is false as stated for non-faithful actions, and Eq. (44) contradicts the paper's own Table (42). These are local but load-bearing issues, and they can be fixed within the scope of the paper.

major comments (1)
  1. [Section 6, Eqs. (58)-(59)] The proportionalities D^(Lambda)_K = 46 d_K on Sym(4) and D^(Lambda)_K = 714 d_K on Sym(5) are asserted from 'numerical calculations' without giving the calculation, the enumeration used, or a reproducibility statement. These are exact claims about all permutations in Sym(4) and Sym(5), and they are used to justify the equivalence of the distributions in Figures 3 and 4. Because Eq. (44) already contains an incorrect factor for Sym(3), the reader cannot take these numerical assertions at face value. Please provide an exhaustive verification (e.g., a short script or a proof) and, in any case, specify the enumeration underlying the computation.
minor comments (5)
  1. [Definition 8] There is a typo in (D1): it reads 'd(x, y >0' and 'd(x, y) = 0'; a closing parenthesis is missing. Please fix.
  2. [Section 4.1] The word 'multiplicaction' appears before Eq. (6) and again in Section 4.1. It should be 'multiplication'.
  3. [Section 5.1] In item (ii), 'Trancriptions' should be 'Transcriptons' or 'Transcriptions'.
  4. [Section 7] The text begins 'Metric properties of finite groups is an unsual tool'; 'unsual' should be 'unusual'.
  5. [Example 21] After correcting Eq. (44), the text should say that Table (42) divided by 5 reproduces Table (29), not divided by 3. This correction should be propagated to the discussion of allowed distances.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the group distance is a direct transport of permutation metrics via Cayley's theorem; numerical experiments are illustrative, not evidence.

full rationale

The derivation chain is self-contained. Definition 18 defines D^(Phi)_C,K(a,b) = d_C,K(Phi(a), Phi(b)) as a transported distance, not as an empirical prediction or fitted result. The metric axioms, left invariance, and norm representation follow immediately from the homomorphism property of the Cayley isomorphism and the previously proved Proposition 10 and Corollary 11; no parameter is fitted and no input is renamed as an output. Cayley's theorem is cited to standard textbooks, and the group-distance construction does not depend on any self-citation for its validity. The numerical simulations use the authors' prior synchronization model [50] only as a testbed to illustrate the distances; the imported claim about generalized synchronization is not load-bearing for the mathematical construction. Remark 19 acknowledges dependence on the implementation of Phi, and a further robustness caveat is that the Kendall variant also depends on the arbitrary enumeration of G, but this is a non-circularity concern about choice of input rather than an equivalence-by-construction of the result to its premises. Overall, no circular step is present.

Assumptions & free parameters 1 free parameters · 5 assumptions · 0 invented entities

The central metric costs nothing in fitted parameters: it uses Cayley's theorem and known distance formulas. The main hidden choice is the labeling and ordering of G and the selection of left translations, which affect D_K. Additional assumptions enter only in the numerical illustration (generalized synchronization intervals from prior work) and in the unproved proportionality factors for Sym(4) and Sym(5). No new physical or algebraic entities are postulated.

free parameters (1)
  • Cayley embedding implementation and element ordering = left translations with a fixed but arbitrary enumeration of G
    Definition 18 returns different distances for different Phi and for different orderings of the group elements; the paper fixes these implicitly through the multiplication table rows without treating them as parameters.
assumptions (5)
  • standard math Cayley's theorem: each finite group embeds into a symmetric group via left translations.
    Used to build Phi in Definition 18. Theorem 4 overstates this to arbitrary actions, which is false without faithfulness.
  • standard math The Cayley and Kendall distances on Sym(n) are metrics, with d_C = n - number of cycles and d_K = inversion count.
    Taken from references [24,25]; these formulas are the basis of D^(Phi)_C,K.
  • domain assumption Labeling G as {1,...,|G|} and identifying Sym(G) with Sym(|G|) preserves the intended metric.
    Section 2, Eqs. (2)-(6). The Kendall distance is not invariant under relabeling, so this assumption is non-trivial and not flagged.
  • domain assumption The coupled Henon system has generalized synchronization near C=0.55 and for C >= 1.1, as reported in reference [50].
    Section 6 uses these intervals to interpret the distance histograms; the intervals are not independently verified in this paper.
  • ad hoc to paper D_K^(Lambda) = 46 d_K for Sym(4) and D_K^(Lambda) = 714 d_K for Sym(5) for all permutations.
    Equations (58) and (59) are supported only by 'numerical calculations show'; no proof is provided.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Permutation-Based Distances for Groups and Group-Valued Time Series." pith.science (2026). https://pith.science/paper/XU5CCUIP

@misc{pith2026250909191,
  author       = {Pith},
  title        = {Pith review of: Permutation-Based Distances for Groups and Group-Valued Time Series},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/XU5CCUIP}},
  note         = {Machine review of arXiv:2509.09191}
}
read the original abstract

Permutations on a set, endowed with function composition, build a group called a symmetric group. In addition to their algebraic structure, symmetric groups have two metrics that are of particular interest to us here: the Cayley distance and the Kendall tau distance. In fact, the aim of this paper is to introduce the concept of distance in a general finite group based on them. The main tool that we use to this end is Cayley's theorem, which states that any finite group is isomorphic to a subgroup of a certain symmetric group. We also discuss the advantages and disadvantage of these permutation-based distances compared to the conventional generator-based distances in finite groups. The reason why we are interested in distances on groups is that finite groups appear in symbolic representations of time series, most notably in the so-called ordinal representations, whose symbols are precisely permutations, usually called ordinal patterns in that context. The natural extension from groups to group-valued time series is also discussed, as well as how such metric tools can be applied in time series analysis. Both theory and applications are illustrated with examples and numerical simulations.

Figures

Figures reproduced from arXiv: 2509.09191 by the authors.

Figure 1
Figure 1. Kendall adjacency graph of Sym(3). A link between two nodes means that the corresponding permutations differ by an adjacent transposition, i.e., the Kendall distance between them is 1 [PITH_FULL_IMAGE:figures/full_fig_p007_1.png] view at source ↗
Figure 2
Figure 2. Kendall adjacency graph of Sym(4). A link between two permutations means that the Kendall distance between them is 1. In the following, whenever convenient for economy of notation, we denote by dC,K both the Cayley and Kendall distances. 7 [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. Top row: Probability distributions of the Kendall distances dK(rt, st) for the algebraic representation of the time series x and y with the group G = Sym(4) (i.e., ordinal patterns of length L = 4) and coupling strengths C = 0.30 (left panel), 0.55 (middle panel) and 1.10 (right panel). Bottom row: Same as top row for the representation group G = Sym(5) (i.e., ordinal patterns of length L = 5). At this point, we dra… view at source ↗
Figures from the paper (2 more)
Figure 4
Figure 4. Figure 4: Probability distributions of the allowed distances for [PITH_FULL_IMAGE:figures/full_fig_p017_4.png]
Figure 5
Figure 5. Figure 5: Top row: Probability distributions of the distance dist1(r 4 t , s 4 t ) for the algebraic representation of the time series x and y with the group G = Sym(3) (ordinal patterns of length L = 3) and coupling strengths C = 0.30 (left panel), 0.55 (middle panel) and 1.10 …

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

50 extracted references · 5 canonical work pages

  1. [1]

    A review of symbolic dynamics and symbolic reconstruction of dynamical systems

    Hirata, Y .; Amigó, J.M. A review of symbolic dynamics and symbolic reconstruction of dynamical systems. Chaos2023,33, 052101

  2. [2]

    Permutation Entropy: A Natural Complexity Measure for Time Series.Phys

    Bandt, C.; Pompe, B. Permutation Entropy: A Natural Complexity Measure for Time Series.Phys. Rev. Lett. 2002,88, 174102

    2002

  3. [3]

    Symbolic analysis of high dimensional time series.Int

    Keller, K.; Lauffer, H. Symbolic analysis of high dimensional time series.Int. J. Bifurc. Chaos2003,13, 2657–2668

  4. [4]

    Ordinal pattern statistics for the assessment of heart rate variability.Eur

    Graff, G.; Graff, B.; Kaczkowska, A.; Makowiecz, D.; Amigó, J.M.; Piskorski, J.; Narkiewicz, K.; Guzik, P. Ordinal pattern statistics for the assessment of heart rate variability.Eur. Phys. Spec. Top.2013,222, 525–534

    2013

  5. [5]

    Spatiotemporal permutation entropy as a measure for complexity of cardiac arrhythmia.Front

    Schlemmer, A.; Berg, S.; Lilienkamp, T.; Luther, S.; Parlitz, U. Spatiotemporal permutation entropy as a measure for complexity of cardiac arrhythmia.Front. Phys.2018,6, 1–13

    2018

  6. [6]

    Distinguishing noise from chaos.Phys

    Rosso, O.A.; Larrondo, H.A.; Martin, M.T.; Plastino, A.; Fuentes, M.A. Distinguishing noise from chaos.Phys. Rev. Lett.2007,99, 154102

    2007

  7. [7]

    True and false forbidden patterns in deterministic and random dynamics.Europhys

    Amigó, J.M.; Zambrano, S.; Sanjuán, M.A.F. True and false forbidden patterns in deterministic and random dynamics.Europhys. Lett.2007,79, 50001

    2007

  8. [8]

    Characterizing synchronization in time series using information measures extracted from symbolic representations.Phys

    Monetti, R.; Bunk, W.; Aschenbrenner, T.; Jamitzky, F. Characterizing synchronization in time series using information measures extracted from symbolic representations.Phys. Rev. E2009,79, 046207

Show all 50 references
  1. [9]

    Identification of equivalent dynamics using ordinal pattern distribution.Eur

    Parlitz, U.; Suetani, H.; Luther, S. Identification of equivalent dynamics using ordinal pattern distribution.Eur. J. Spec. Top.2013,222, 553–568

    2013

  2. [10]

    Non-parametric tests for serial dependence in time series based on asymptotic implementations of ordinal-pattern statistics.Chaos2022,32, 093107

    Weiß, C.H. Non-parametric tests for serial dependence in time series based on asymptotic implementations of ordinal-pattern statistics.Chaos2022,32, 093107

  3. [11]

    Non-parametric analysis of serial dependence in time series using ordinal patterns.Comput

    Weiß, C.H.; Ruiz Marín, M.; Keller, K.; Matilla-García, M. Non-parametric analysis of serial dependence in time series using ordinal patterns.Comput. Stat. Data Anal.2022,168, 107381

    2022

  4. [12]

    Recent Progress in Symbolic Dynamics and Permutation Complexity.Eur

    Amigó, J.M.; Keller, K.; Kurths, J. Recent Progress in Symbolic Dynamics and Permutation Complexity.Eur. Phys. J. Spec. Top.2013,222, 241–247

    2013

  5. [13]

    20 Years of Ordinal Patterns: Perspectives and challenges.Eur

    Leyva I.; Martinez, J.; Massoller, C.; Rosso, O.A.; Zanin, M. 20 Years of Ordinal Patterns: Perspectives and challenges.Eur. Phys. Lett.2022,138, 31001

    2022

  6. [14]

    Ordinal methods: Concepts, applications, new developments, and challenges.Chaos 2023,33, 080401

    Amigó, J.M.; Rosso, O.A. Ordinal methods: Concepts, applications, new developments, and challenges.Chaos 2023,33, 080401

    2023

  7. [15]

    Herstein, I.N.Abstract Algebra; John Wiley: 1996; ISBN 978-0471368793

    1996

  8. [16]

    Lang, S.Undergraduate Algebra, 3rd ed.; Undergraduate Texts in Mathematics; Springer: New York, NY , USA, 2005; ISBN 978-0387220253

    2005

  9. [17]

    Fraleigh, J.B.A First Course in Abstract Algebra; Pearson Education Limited : 2013; ISBN 978-1292024967

    2013

  10. [18]

    New Approaches in Ordinal Pattern Representations for Multivariate Time Series

    Mohr, M; Wilhelm, F.; Hartwig, M.; Möller, R.; Keller, K. New Approaches in Ordinal Pattern Representations for Multivariate Time Series. In Proceedings of the Thirty-Third International Artificial Intelligence Research Society Conference (FLAIRS 2020), North Miami Beach, FL, ...

    2020

  11. [19]

    Permutation entropy: One concept, two approaches.Eur

    Amigó, J.M.; Keller, K. Permutation entropy: One concept, two approaches.Eur. Phys. J. Spec. Top.2013,222, 263-274

    2013

  12. [20]

    Complexity-entropy causality plane as a complexity measure for two-dimensional patterns.PLoS One2012,7, e40689

    Ribeiro, H.V .; Zunino, L.; Lenzi, E.K.; Santoro, P.A.; Mendes, R.S. Complexity-entropy causality plane as a complexity measure for two-dimensional patterns.PLoS One2012,7, e40689

  13. [21]

    Discriminating image textures with the multiscale two-dimensional complexity-entropy causality plane.Chaos Solitons Fractals2016,91, 679–688

    Zunino, L.; Ribeiro, H.V . Discriminating image textures with the multiscale two-dimensional complexity-entropy causality plane.Chaos Solitons Fractals2016,91, 679–688

  14. [22]

    Two new parameters for the ordinal analysis of images.Chaos2023,33, 043124

    Bandt, C.; Wittfeld, K. Two new parameters for the ordinal analysis of images.Chaos2023,33, 043124

  15. [23]

    Metrics on permutations: A survey.J

    Deza, M.; Huang, T. Metrics on permutations: A survey.J. Comb. Inf. Syst. Sci.1998,23, 173–185

    1998

  16. [24]

    Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall τ-Metric.arXiv2024, arXiv:2404.15126v2

    Nguyen, T. Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall τ-Metric.arXiv2024, arXiv:2404.15126v2

    arXiv

  17. [25]

    A new measure of rank correlation.Biometrika1938,30, 81–93

    Kendall, M.G. A new measure of rank correlation.Biometrika1938,30, 81–93. https://doi.org/10.2307/ 2332226

  18. [26]

    Distance measures based on the edit distance for permutation-type representations.J

    Sörensen, K. Distance measures based on the edit distance for permutation-type representations.J. Heuristics 2007,13, 35–47.https://doi.org/10.1007/s10732-006-9001-3

    2007 doi

  19. [27]

    Small Order Patterns in Big Time Series: A Practical Guide.Entropy2019,21, 613

    Bandt, C. Small Order Patterns in Big Time Series: A Practical Guide.Entropy2019,21, 613. https://doi. org/10.3390/e21060613. 21 Permutation-Based Distances for Groups and Group-Valued Time SeriesA PREPRINT

    doi

  20. [28]

    Kendall tau sequence distance: Extending Kendall tau from ranks to sequences.arXiv2019, arXiv:1905.02752v3

    Cicirello, V .A. Kendall tau sequence distance: Extending Kendall tau from ranks to sequences.arXiv2019, arXiv:1905.02752v3

    1905 arXiv

  21. [29]

    Minimal Permutation Representations of Finite Groups.Am

    Johnson, D.L. Minimal Permutation Representations of Finite Groups.Am. J. Math.1971,93, 857–866. https: //doi.org/10.2307/2373739

    1971 doi

  22. [30]

    On Minimal Permutation Representations of Classical Simple Groups.Sib

    Grechkoseeva, M.A. On Minimal Permutation Representations of Classical Simple Groups.Sib. Math. J.2003, 44, 443–462.https://doi.org/10.1023/A:1023860730624

    2003 doi

  23. [31]

    Rachev, S.T.; Klebanov, L.; Stoyanov, S.V .; Fabozzi F.The Methods of Distances in the Theory of Probability and Statistics; Springer: New York, 2013; ISBN 978-1461448686

    2013

  24. [32]

    Divergence measures based on the Shannon entropy.IEEE Trans

    Lin, J. Divergence measures based on the Shannon entropy.IEEE Trans. Inf. Theory1991,37, 145–151

  25. [33]

    A new metric for probability distributions.IEEE Trans

    Endres, D.; Schindelin, J. A new metric for probability distributions.IEEE Trans. Inf. Theory2003,49, 1858– 1860

  26. [34]

    Permutation Jensen-Shannon distance: A versatile and fast symbolic tool for complex time-series analysis.Phys

    Zunino, L.; Olivares, F.; Ribeiro, H.V .; Rosso, O.A. Permutation Jensen-Shannon distance: A versatile and fast symbolic tool for complex time-series analysis.Phys. Rev. E2022,105, 045310

  27. [35]

    Revisiting the Characterization of Resting Brain Dynamics with the Permutation Jensen–Shannon Distance.Entropy2024,26, 432.https://doi.org/10.3390/e26050432

    Zunino, L. Revisiting the Characterization of Resting Brain Dynamics with the Permutation Jensen–Shannon Distance.Entropy2024,26, 432.https://doi.org/10.3390/e26050432

    doi

  28. [36]

    Neue Begründung der Theorie quadratischer Formen von unendlichvielen Veränderlichen.J

    Hellinger, E. Neue Begründung der Theorie quadratischer Formen von unendlichvielen Veränderlichen.J. Fürdie Reine Und Angew. Math.1909,136, 210–271. Available online: http://eudml.org/doc/149313 (accessed on August 27, 2025)

    1909

  29. [37]

    Kantorovich, L. V . On the translocation of masses.Dokl. Akad. Nauk SSSR1942,37, 227–229. Reprinted inJ. Math. Sci.2006,133, 1381–1382

    2006

  30. [38]

    An Invitation to Optimal Transport, Wasserstein Distances, and Gradient Flows

    Figalli, A.; Glaudo, F. An Invitation to Optimal Transport, Wasserstein Distances, and Gradient Flows. In EMS Textbooks in Mathematics, 23th ed.; European Mathematical Society: Berlin, Germany, 2021; ISBN-13: 978-3985470105

    2021

  31. [39]

    Pinsker, M.S.Information and Information Stability of Random Variables and Processes; Holden-Day, San Francisco CA, 1964; ISBN 978-0816268047

    1964

  32. [40]

    On Approximating Total Variation Distance.arXiv2023, arXiv:2206.07209v2

    Bhattacharyya, A.; Gayen S.; Meel, K.S.; Myrisiotis, D.; Pavan, A.; Vinodchandran, N.V . On Approximating Total Variation Distance.arXiv2023, arXiv:2206.07209v2

    arXiv

  33. [41]

    Transcripts: An algebraic approach to coupled time series.Chaos2012,22, 013105

    Amigó, J.M.; Monetti, R.; Aschenbrenner, T.; Bunk, W. Transcripts: An algebraic approach to coupled time series.Chaos2012,22, 013105

  34. [42]

    Information directionality in coupled time series using transcripts.Phys

    Monetti, R.; Bunk, W.; Aschenbrenner, T.; Springer, S.; Amigó, J.M. Information directionality in coupled time series using transcripts.Phys. Rev. E2013,88, 022911

  35. [43]

    Differentiating patients with obstructive sleep apnea from healthy controls based on heart rate-blood pressure coupling quantified by entropy- based indices.Chaos2023,33, 103140

    Pilarczyk, P.; Graff, G.; Amigó, J.M.; Tessmer, K.; Narkiewicz, K.; Graff, B. Differentiating patients with obstructive sleep apnea from healthy controls based on heart rate-blood pressure coupling quantified by entropy- based indices.Chaos2023,33, 103140

  36. [44]

    Error detecting and error correcting codes.Bell Syst

    Hamming, R.W. Error detecting and error correcting codes.Bell Syst. Tech. J.1950,29, 147–160

    1950

  37. [45]

    A technique for computer detection and correction of spelling errors.Commun

    Damerau, F.J. A technique for computer detection and correction of spelling errors.Commun. ACM1964,7, 171–176

  38. [46]

    Binary codes capable of correcting deletions, insertions, and reversals.Sov

    Levenshtein, V .I. Binary codes capable of correcting deletions, insertions, and reversals.Sov. Phys. Dokl.1966, 10, 707–710

    1966

  39. [47]

    Cormen, T.H.; Leiserson, C.E.; Rivest, R.L.; Stein, C.Introduction to Algorithms, 3rd ed.; The MIT Press: Cambridge, MA, USA, 2009

    2009

  40. [48]

    Advances in record-linkage methodology as applied to matching the 1985 census of Tampa, Florida

    Jaro, M.A. Advances in record-linkage methodology as applied to matching the 1985 census of Tampa, Florida. J. TheAmerican Stat. Assoc.1989,84, 414–420

    1985

  41. [49]

    Winkler, W. E. String Comparator Metrics and Enhanced Decision Rules in the Fellegi-Sunter Model of Record Linkage. In Proceedings of the Section on Survey Research Methods, American Statistical Association 1990; pp. 354–359

    1990

  42. [50]

    Generalized synchronization in the presence of dynamical noise and its detection via recurrent neural networks.Chaos2024,34, 123156

    Amigó, J.M.; Dale, R.; King, J.C.; Lehnertz, K. Generalized synchronization in the presence of dynamical noise and its detection via recurrent neural networks.Chaos2024,34, 123156. 22

Pith tools

Reviewed August 4, 2026 · model on record in the stance chip above.