Skip to main content Accessibility help
×
Home
Hostname: page-component-5d6d958fb5-w6vhv Total loading time: 0.358 Render date: 2022-11-29T19:36:25.662Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "displayNetworkTab": true, "displayNetworkMapGraph": false, "useSa": true } hasContentIssue true

Sparse 0−1 Matrices and Forbidden Hypergraphs

Published online by Cambridge University Press:  01 September 1999

CLAUDIA BERTRAM-KRETZBERG
Affiliation:
Lehrstuhl Informatik 2, Universität Dortmund, D–44221 Dortmund, Germany (e-mail: bertram@Ls2.cs.uni-dortmund.de, hofmeist@Ls2.cs.uni-dortmund.de, lefmann@Ls2.cs.uni-dortmund.de)
THOMAS HOFMEISTER
Affiliation:
Lehrstuhl Informatik 2, Universität Dortmund, D–44221 Dortmund, Germany (e-mail: bertram@Ls2.cs.uni-dortmund.de, hofmeist@Ls2.cs.uni-dortmund.de, lefmann@Ls2.cs.uni-dortmund.de)
HANNO LEFMANN
Affiliation:
Lehrstuhl Informatik 2, Universität Dortmund, D–44221 Dortmund, Germany (e-mail: bertram@Ls2.cs.uni-dortmund.de, hofmeist@Ls2.cs.uni-dortmund.de, lefmann@Ls2.cs.uni-dortmund.de)

Abstract

We consider the problem of determining the maximum number N(m, k, r) of columns of a 0−1 matrix with m rows and exactly r ones in each column such that every k columns are linearly independent over ℤ2. For fixed integers k[ges ]4 and r[ges ]2, where k is even and gcd(k−1, r) = 1, we prove the lower bound N(m, k, r) = Ω(mkr/2(k−1) ·(ln m)1/k−1). This improves on earlier results from [14] by a factor Θ((ln m)1/k−1). Moreover, we describe a polynomial time algorithm achieving this new lower bound.

Type
Research Article
Copyright
1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This research was supported by the Deutsche Forschungsgemeinschaft as part of the Collaborative Research Center ‘Computational Intelligence’ (SFB 531).This paper was submitted to the Special Issue (Volume 8, Number 4) devoted to papers from the Oberwolfach meeting on Random Graphs and Combinatorial Structures, but was inadvertently omitted from that Issue.
3
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Sparse 0−1 Matrices and Forbidden Hypergraphs
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Sparse 0−1 Matrices and Forbidden Hypergraphs
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Sparse 0−1 Matrices and Forbidden Hypergraphs
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *