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: Young diagrams | Statement: [Gelfand–Tsetlin basis, relatedTo, Young diagrams]

Target entity: Young diagrams
Context triple: [Gelfand–Tsetlin basis, relatedTo, Young diagrams]

• A. Coxeter–Dynkin diagrams
  Coxeter–Dynkin diagrams are graphical representations that encode the structure of reflection groups and root systems, widely used in the classification of regular polytopes, Lie algebras, and symmetries.
• B. 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.
• C. 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.
• D. Macdonald polynomials
  Macdonald polynomials are a family of orthogonal symmetric functions depending on two parameters that generalize several classical symmetric polynomials, such as Schur and Jack polynomials, and play a central role in algebraic combinatorics and representation theory.
• 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: Young diagrams
Triple: [Gelfand–Tsetlin basis, relatedTo, Young diagrams]

Young diagrams are combinatorial diagrams consisting of left-justified rows of boxes that visually represent integer partitions and play a central role in the representation theory of symmetric and general linear groups.

Target entity: Young diagrams
Target entity description: Young diagrams are combinatorial diagrams consisting of left-justified rows of boxes that visually represent integer partitions and play a central role in the representation theory of symmetric and general linear groups.

• A. Coxeter–Dynkin diagrams
  Coxeter–Dynkin diagrams are graphical representations that encode the structure of reflection groups and root systems, widely used in the classification of regular polytopes, Lie algebras, and symmetries.
• B. 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.
• C. 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.
• D. Macdonald polynomials
  Macdonald polynomials are a family of orthogonal symmetric functions depending on two parameters that generalize several classical symmetric polynomials, such as Schur and Jack polynomials, and play a central role in algebraic combinatorics and representation theory.
• 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