随机向量相依和的渐近性

Random Struct. Algorithms Pub Date : 1999-05-01 DOI:10.1002/(SICI)1098-2418(199905)14:3%3C267::AID-RSA4%3E3.0.CO;2-3

C. Cooper

{"title":"随机向量相依和的渐近性","authors":"C. Cooper","doi":"10.1002/(SICI)1098-2418(199905)14:3%3C267::AID-RSA4%3E3.0.CO;2-3","DOIUrl":null,"url":null,"abstract":"We consider sequences of length m of n-tuples each with k nonzero entries chosen randomly from an Abelian group or finite field. For what values of m does there exist a subsequence which is zero-sum or linearly dependent, respectively? We report some results relating to these problems. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14, 267–292, 1999","PeriodicalId":303496,"journal":{"name":"Random Struct. Algorithms","volume":"91 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Asymptotics for dependent sums of random vectors\",\"authors\":\"C. Cooper\",\"doi\":\"10.1002/(SICI)1098-2418(199905)14:3%3C267::AID-RSA4%3E3.0.CO;2-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider sequences of length m of n-tuples each with k nonzero entries chosen randomly from an Abelian group or finite field. For what values of m does there exist a subsequence which is zero-sum or linearly dependent, respectively? We report some results relating to these problems. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14, 267–292, 1999\",\"PeriodicalId\":303496,\"journal\":{\"name\":\"Random Struct. Algorithms\",\"volume\":\"91 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Random Struct. Algorithms\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/(SICI)1098-2418(199905)14:3%3C267::AID-RSA4%3E3.0.CO;2-3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Random Struct. Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1098-2418(199905)14:3%3C267::AID-RSA4%3E3.0.CO;2-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Asymptotics for dependent sums of random vectors

We consider sequences of length m of n-tuples each with k nonzero entries chosen randomly from an Abelian group or finite field. For what values of m does there exist a subsequence which is zero-sum or linearly dependent, respectively? We report some results relating to these problems. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14, 267–292, 1999

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Random Struct. Algorithms

自引率

0.00%

发文量