Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Estimating deep Litt ...
Conference paper

Estimating deep Littlewood-Richardson Coefficients

Hariharan Narayanan (1) (2)
(1) Department of Statistics
(2) Department of Mathematics [Seattle]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2013
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)
Proceedings
DOI
10.46298/dmtcs.2403
License
https://about.hal.science/hal-authorisation-v1
Indicators
559
Views
926
Downloads

Estimating deep Littlewood-Richardson Coefficients

Hariharan Narayanan (1) (2)
(1) Department of Statistics
(2) Department of Mathematics [Seattle]
Abstract
English
Littlewood Richardson coefficients are structure constants appearing in the representation theory of the general linear groups $(GL_n)$. The main results of this paper are: 1. A strongly polynomial randomized approximation scheme for Littlewood-Richardson coefficients corresponding to indices sufficiently far from the boundary of the Littlewood Richardson cone. 2. A proof of approximate log-concavity of the above mentioned class of Littlewood-Richardson coefficients.
French
Coefficients de Littlewood Richardson sont des constantes de structure apparaissant dans la théorie de la représentation des groupes linéaires généraux $(GL_n)$. Les principaux résultats de cette étude sont les suivants: 1. Un schéma d’approximation polynomiale randomisée fortement pour des coefficients de Littlewood-Richardson correspondant aux indices suffisamment loin de la limite du cône Littlewood Richardson. 2. Une preuve de l’approximatif log-concavité de la classe de coefficients de Littlewood-Richardson mentionné ci-dessus.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • Convex polytopes
  • Littlewood-Richardson coefficients
  • Log-concavity
Cited by

Source: OpenCitations

  • Large deviations for random hives and the spectrum of the sum of two random matrices

    The Annals of Probability

    Authors : Hariharan Narayanan ORCID, Scott Sheffield ORCID

    Journal reference : Volume 52, 2024, pp.

    DOI : 10.1214/24-aop1687
  • Sums of GUE matrices and concentration of hives from correlation decay of eigengaps

    Probability Theory and Related Fields

    Authors : Hariharan Narayanan ORCID, Scott Sheffield ORCID, Terence Tao ORCID

    Journal reference : Volume 190, 2023, pp. 1121-1165

    DOI : 10.1007/s00440-023-01250-4
  • Asymptotics of the number of standard Young tableaux of skew shape

    European Journal of Combinatorics

    Authors : Alejandro H. Morales ORCID, Igor Pak ORCID, Greta Panova ORCID

    Journal reference : Volume 70, 2017, pp. 26-49

    DOI : 10.1016/j.ejc.2017.11.007
  • Random Discrete Concave Functions on an Equilateral Lattice with Periodic Hessians

    Journal of Fourier Analysis and Applications

    Authors : Hariharan Narayanan ORCID

    Journal reference : Volume 31, 2025, pp.

    DOI : 10.1007/s00041-025-10185-4
Preview
Loading PDF preview...