Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Thompson order formula | Statement: [John G. Thompson, knownFor, Thompson order formula]

Target entity: Thompson order formula
Context triple: [John G. Thompson, knownFor, Thompson order formula]

• A. Szekeres–Lindström theorem
  The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
• B. Legendre’s formula for valuations of factorials
  Legendre’s formula for valuations of factorials is a number-theoretic result that expresses the exponent of a prime in the prime factorization of n! as a sum of integer divisions of n by successive powers of that prime.
• C. Thompson's algorithm
  Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical analysis.
• D. Sylvester’s theorem on partitions
  Sylvester’s theorem on partitions is a result in number theory that provides a systematic way to count integer partitions subject to certain congruence or restriction conditions, forming part of the foundational work in partition theory.
• E. Hardy–Ramanujan asymptotic formula
  The Hardy–Ramanujan asymptotic formula is a landmark result in number theory that gives an approximate expression for the partition function p(n), describing how the number of integer partitions of n grows rapidly with n.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Thompson order formula
Triple: [John G. Thompson, knownFor, Thompson order formula]

The Thompson order formula is a result in finite group theory that provides a way to compute the order of a finite group using data from its local subgroups, particularly centralizers of elements of prime order.

Target entity: Thompson order formula
Target entity description: The Thompson order formula is a result in finite group theory that provides a way to compute the order of a finite group using data from its local subgroups, particularly centralizers of elements of prime order.

• A. Szekeres–Lindström theorem
  The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
• B. Legendre’s formula for valuations of factorials
  Legendre’s formula for valuations of factorials is a number-theoretic result that expresses the exponent of a prime in the prime factorization of n! as a sum of integer divisions of n by successive powers of that prime.
• C. Thompson's algorithm
  Thompson's algorithm is a classic computer science method for converting regular expressions into nondeterministic finite automata (NFAs), widely used in pattern matching and lexical analysis.
• D. Sylvester’s theorem on partitions
  Sylvester’s theorem on partitions is a result in number theory that provides a systematic way to count integer partitions subject to certain congruence or restriction conditions, forming part of the foundational work in partition theory.
• E. Hardy–Ramanujan asymptotic formula
  The Hardy–Ramanujan asymptotic formula is a landmark result in number theory that gives an approximate expression for the partition function p(n), describing how the number of integer partitions of n grows rapidly with n.
• F. None of above. chosen