Name
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. (C) 1999 John Wiley & Sons, Inc. |
Year | DOI | Venue |
|---|---|---|
1999 | 3.0.CO;2-3" target="_self" class="small-link-text"10.1002/(SICI)1098-2418(199905)14:33.0.CO;2-3 | Random Struct. Algorithms |
Keywords | Field | DocType |
finite field,abelian group,random matrix,rank | Discrete mathematics,Abelian group,Linear independence,Combinatorics,Finite field,Elementary abelian group,Rank of an abelian group,Subsequence,Asymptotic analysis,Mathematics,Random matrix | Journal |
Volume | Issue | ISSN |
14 | 3 | 1042-9832 |
Citations | PageRank | References |
2 | 0.52 | 4 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Colin Cooper | 1 | 287 | 30.73 |