Quasi-random subsets of \(\mathbb{Z}_ n\)

DOI10.1016/0097-3165(92)90053-WzbMath0779.05046OpenAlexW2160519701MaRDI QIDQ1194750

Fan R. K. Chung, Ronald L. Graham

Publication date: 5 October 1992

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(92)90053-w

zbMATH Keywords

quasi-random propertiesquasi-random subsets

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Descriptive set theory (03E15)

Related Items

Popular progression differences in vector spaces II, Quasirandom permutations are characterized by 4-point densities, On multi-dimensional pseudorandom subsets, Constructing quasi-random subsets of \(\mathbb Z_N\) by using elliptic curves, Quasirandom-Forcing Orientations of Cycles, Quasirandom Latin squares, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Quasirandom Groups, FORCING QUASIRANDOMNESS WITH TRIANGLES, On pseudo-random subsets of the set of the integers not exceeding \(N\), Quasirandomness in hypergraphs, Linear quasi-randomness of subsets of abelian groups and hypergraphs, Linear quasi-randomness of subsets of abelian groups and hypergraphs, Quasi-random words and limits of word sequences, Characterization of quasirandom permutations by a pattern sum, Effective generation of subjectively random binary sequences, On pseudo-random subsets of \({\mathbb{Z}}_n\), Quasirandom permutations, Quasirandom arithmetic permutations, No additional tournaments are quasirandom-forcing

Cites Work

• Intersection theorems for vector spaces
• On universality of graphs with uniformly distributed edges
• The number of submatrices of a given type in a Hadamard matrix and related results
• Some Ramsey-Turán type results for hypergraphs
• Graphs which contain all small graphs
• Pseudo-random hypergraphs
• Intersection theorems and mod \(p\) rank of inclusion matrices
• A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
• On Ramsey - Turan type theorems for hypergraphs
• Cyclotomy and difference families in elementary Abelian groups
• Dense expanders and pseudo-random bipartite graphs
• Quasi-random tournaments
• Quasi-random hypergraphs
• A note on constructive methods for ramsey numbers
• Szemerédi's partition and quasirandomness
• Quasi‐random classes of hypergraphs
• Communication Complexity and Quasi Randomness
• A Constructive Solution to a Tournament Problem
• Quasi-random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item