Hypergraphs, quasi-randomness, and conditions for regularity (Q1604564): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059456505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐random classes of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Random Set Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity and Quasi Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On characterizing hypergraph regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On testing the `pseudo-randomness' of a hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclotomy and difference families in elementary Abelian groups / rank
 
Normal rank

Latest revision as of 10:34, 4 June 2024

scientific article
Language Label Description Also known as
English
Hypergraphs, quasi-randomness, and conditions for regularity
scientific article

    Statements

    Hypergraphs, quasi-randomness, and conditions for regularity (English)
    0 references
    0 references
    0 references
    0 references
    4 July 2002
    0 references
    The study of quasi-randomness is a flourishing topic on uniform hypergraphs. F. R. K. Chung and R. L. Graham (among others) investigated thoroughly quasi-random uniform hypergraphs of density 1/2, showing a series of important equivalent statements about these structures. In this investigations the notion of deviation plays a central role. Chung and Graham explicitly asked to extend these investigations to the case where the fixed density differs from 1/2. This extensive paper starts this investigation. Its main aim is to show a series of relevant equivalent statements about quasi-random uniform hypergraphs of fixed (but not 1/2) density. The authors developed a new technique based on the notion of discrepancy and their delicate proofs are quite different from the ones used by Chung and Graham.
    0 references
    quasi-random
    0 references
    random-like
    0 references
    deviation
    0 references
    discrepancy
    0 references
    density
    0 references
    spectrum of subhypergraphs
    0 references

    Identifiers