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: Gelfand–Tsetlin patterns | Statement: [Gelfand–Tsetlin basis, parameterizedBy, Gelfand–Tsetlin patterns]

Target entity: Gelfand–Tsetlin patterns
Context triple: [Gelfand–Tsetlin basis, parameterizedBy, Gelfand–Tsetlin patterns]

• A. Gelfand–Tsetlin basis
  The Gelfand–Tsetlin basis is a canonical, combinatorially defined basis for representations of certain Lie algebras and groups, particularly used in the representation theory of GL(n) and related structures.
• B. Rogers–Ramanujan-type identities
  Rogers–Ramanujan-type identities are a class of deep q-series and partition identities generalizing the classical Rogers–Ramanujan identities, with rich connections to combinatorics, number theory, and modular forms.
• C. Kazhdan–Lusztig theory
  Kazhdan–Lusztig theory is a framework in representation theory and algebraic geometry that studies Hecke algebras and their bases via Kazhdan–Lusztig polynomials, with deep connections to the representation theory of Lie algebras and geometry of Schubert varieties.
• D. Schur–Weyl duality
  Schur–Weyl duality is a fundamental result in representation theory that links representations of the symmetric group and the general linear group via their commuting actions on tensor powers of a vector space.
• E. 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.
• 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: Gelfand–Tsetlin patterns
Triple: [Gelfand–Tsetlin basis, parameterizedBy, Gelfand–Tsetlin patterns]

Gelfand–Tsetlin patterns are triangular arrays of integers satisfying interlacing conditions that combinatorially encode basis vectors in representations of classical Lie groups and Lie algebras.

Target entity: Gelfand–Tsetlin patterns
Target entity description: Gelfand–Tsetlin patterns are triangular arrays of integers satisfying interlacing conditions that combinatorially encode basis vectors in representations of classical Lie groups and Lie algebras.

• A. Gelfand–Tsetlin basis chosen
  The Gelfand–Tsetlin basis is a canonical, combinatorially defined basis for representations of certain Lie algebras and groups, particularly used in the representation theory of GL(n) and related structures.
• B. Rogers–Ramanujan-type identities
  Rogers–Ramanujan-type identities are a class of deep q-series and partition identities generalizing the classical Rogers–Ramanujan identities, with rich connections to combinatorics, number theory, and modular forms.
• C. Kazhdan–Lusztig theory
  Kazhdan–Lusztig theory is a framework in representation theory and algebraic geometry that studies Hecke algebras and their bases via Kazhdan–Lusztig polynomials, with deep connections to the representation theory of Lie algebras and geometry of Schubert varieties.
• D. Schur–Weyl duality
  Schur–Weyl duality is a fundamental result in representation theory that links representations of the symmetric group and the general linear group via their commuting actions on tensor powers of a vector space.
• E. 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.
• F. None of above.