Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao COMBINATORICAarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
COMBINATORICA
Article . 1991 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
DBLP
Article . 1991
Data sources: DBLP
versions View all 3 versions
addClaim

On modp transversals

On mod \(p\) transversals
Authors: Jeff Kahn 0001; Roy Meshulam;

On modp transversals

Abstract

A mod-\(p\) transversal in a affine space over the field \(Z/2Z\) is a set whose intersection with any hyperplane which does not contain the origin contains a number of points not divisible by \(p\). The author provides an estimate on the minimal size \(f(p,n)\) of such a transversal in terms of the prime \(p\) and the dimension \(n\) of the affine space. The result as given by theorem 1 reads: \[ e^{-1}(p-1)^{(n/p-1)}-(p-1)\leq f(p,n)\leq(p-1)2^{\lceil(n/p-1)\rceil}-(p-1). \] The upper bound is proven by means of a simple direct construction. The lower bound is obtained by means of techniques involving the finite Fourier transform. It involves a so-called uncertainty inequality for finite Abelian groups which states that the for a nonzero function the product of the sizes of the supports for a function and its transform exceeds the order of the group. The problem is motivated by its usage in the theory of lower bounds for circuit complexity. More in particular the possibility and/or complexity of replacing unbounded fan in or gates by mod-\(n\) gates is discussed.

Related Organizations
Keywords

Analysis of algorithms and problem complexity, Combinatorics in computer science, mod-\(p\) circuits, uncertainty inequality, circuit complexity, lower bounds, Transversal (matching) theory, Switching theory, application of Boolean algebra; Boolean functions, Fourier transform, Combinatorial aspects of finite geometries, transversals, affine space

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    9
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
9
Average
Top 10%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!