On semiring complexity of Schur polynomials

Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number of variables is fixed, the semiring complexity of a Schur polynomial \(s_\lambda\) is \(O(log(\lambda_1))\); here \(\lambda_1\) is the larges...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Fomin, Sergey, Grigoriev, Dima, Nogneng, Dorian, Schost, Eric
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 19.05.2018
Subjects
Circuits
Complexity
Mathematical analysis
Multiplication
Polynomials
Online AccessGet full text

Cover

Abstract Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number of variables is fixed, the semiring complexity of a Schur polynomial \(s_\lambda\) is \(O(log(\lambda_1))\); here \(\lambda_1\) is the largest part of the partition \(\lambda\).
AbstractList Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number of variables is fixed, the semiring complexity of a Schur polynomial \(s_\lambda\) is \(O(log(\lambda_1))\); here \(\lambda_1\) is the largest part of the partition \(\lambda\).
Author Nogneng, Dorian
Grigoriev, Dima
Fomin, Sergey
Schost, Eric
Author_xml – sequence: 1
  givenname: Sergey
  surname: Fomin
  fullname: Fomin, Sergey
– sequence: 2
  givenname: Dima
  surname: Grigoriev
  fullname: Grigoriev, Dima
– sequence: 3
  givenname: Dorian
  surname: Nogneng
  fullname: Nogneng, Dorian
– sequence: 4
  givenname: Eric
  surname: Schost
  fullname: Schost, Eric
BookMark eNrjYmDJy89LZWLgNDI2NtS1MDEy4mDgLS7OMjAwMDIzNzI1NeZk0PbPUyhOzc0sysxLV0jOzy3ISa3ILKlUyE9TCE7OKC1SKMjPqczLz81MzCnmYWBNA1KpvFCam0HZzTXE2UO3oCi_sDS1uCQ-K7-0KA8oFW9kYG5iYGhubG5uTJwqAJeaM1Q
ContentType Paper
Copyright 2018. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2018. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PIMPY
PQEST
PQQKQ
PQUKI
PRINS
PTHSS
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central
SciTech Premium Collection (Proquest) (PQ_SDU_P3)
ProQuest Engineering Collection
Engineering Database
Publicly Available Content Database
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest One Academic
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PIMPY
PQEST
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-proquest_journals_20740173773
IEDL.DBID 8FG
IngestDate Thu Oct 10 16:56:00 EDT 2024
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-proquest_journals_20740173773
OpenAccessLink https://www.proquest.com/docview/2074017377?pq-origsite=%requestingapplication%
PQID 2074017377
PQPubID 2050157
ParticipantIDs proquest_journals_2074017377
PublicationCentury 2000
PublicationDate 20180519
PublicationDateYYYYMMDD 2018-05-19
PublicationDate_xml – month: 05
  year: 2018
  text: 20180519
  day: 19
PublicationDecade 2010
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2018
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 3.143986
SecondaryResourceType preprint
Snippet Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Circuits
Complexity
Mathematical analysis
Multiplication
Polynomials
Title On semiring complexity of Schur polynomials
URI https://www.proquest.com/docview/2074017377
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LS8QwEB50i-DNJz7WJaA36SFpm7QnQWldBNfFB-xtyaso6Lbb7oJe_O1OQlcPwh5DIAkhzPfNN18YgIvMGKm55CFNrcYEhetQIZCFKqNlLKMkjpV3-Y748CW-mySTTnBrO1vlKib6QG0q7TRyp4RgKiAiIa7qeei6RrnqatdCYxMCyoRwyVda3P5qLIwLZMzRvzDrsaPYgWAsa9vswoad7cGWt1zqdh8uH2aktR9vTlgj3tltP5ESk6okT_p12ZC6ev9yn4bxgRzAeZE_3wzD1Q7T7g20078TR4fQw2TeHgGRVmhFbcwVEhHJROY4jmQlswk1pUmPob9upZP106ewjYCeuuo2zfrQWzRLe4aguVADfzMDCK7z0fgRR_ff-Q8PQXcR
link.rule.ids 783,787,12777,21400,33385,33756,43612,43817
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1NS8QwEB10F9Gbn_ixakBv0kOaNGlPHsRadV0FV9hbSdIUBd3Wdhf03zsJXT0Iew4kIQzz3rx5QwDOk6JQRigR0NgaLFCECTQCWaATWnLFIs61d_mORPbC7ybRpBPc2s5WuciJPlEXlXEauVNCsBSQTMrL-jNwv0a57mr3hcYq9DlDrHaT4unNr8YSComMmf1Lsx470k3oP6naNluwYqfbsOYtl6bdgYvHKWntx5sT1oh3dtsvpMSkKsmzeZ03pK7ev93QMAbILpyl1-OrLFickHcx0OZ_N2Z70MNi3u4DUVYaTS0XGomICmXiOI4Ky9BGtCiL-AAGy3Y6XL58CuvZ-GGYD29H90ewgeAeu043TQbQmzVze4wAOtMn_pV-ACzndyg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+semiring+complexity+of+Schur+polynomials&rft.jtitle=arXiv.org&rft.au=Fomin%2C+Sergey&rft.au=Grigoriev%2C+Dima&rft.au=Nogneng%2C+Dorian&rft.au=Schost%2C+Eric&rft.date=2018-05-19&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422