Quasi-random subsets of Z_ n
From MaRDI portal
Publication:1194750
Subsets of the ring of integers modulo \(n\) are considered and several quasi-random properties are shown to be equivalent. Explicit constructions are given for quasi-random subsets.
Cites work
- A Constructive Solution to a Tournament Problem
- A diagonal form for the incidence matrices of t-subsets vs. k- subsets
- A note on constructive methods for ramsey numbers
- Communication Complexity and Quasi Randomness
- Cyclotomy and difference families in elementary Abelian groups
- Dense expanders and pseudo-random bipartite graphs
- Graphs which contain all small graphs
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3756556 (Why is no real title available?)
- scientific article; zbMATH DE number 15664 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 3487460 (Why is no real title available?)
- scientific article; zbMATH DE number 3552764 (Why is no real title available?)
- scientific article; zbMATH DE number 3616470 (Why is no real title available?)
- scientific article; zbMATH DE number 747030 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 3233758 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- Intersection theorems and mod p rank of inclusion matrices
- Intersection theorems for vector spaces
- On Ramsey - Turan type theorems for hypergraphs
- On universality of graphs with uniformly distributed edges
- Pseudo-random hypergraphs
- Quasi-random graphs
- Quasi-random hypergraphs
- Quasi-random tournaments
- Quasi‐random classes of hypergraphs
- Some Ramsey-Turán type results for hypergraphs
- Szemerédi's partition and quasirandomness
- The number of submatrices of a given type in a Hadamard matrix and related results
Cited in
(26)- Effective generation of subjectively random binary sequences
- On pseudo-random subsets of \({\mathbb{Z}}_n\)
- Quasirandom permutations
- Constructing quasi-random subsets of \(\mathbb Z_N\) by using elliptic curves
- On the pseudo-randomness of subsets related to primitive roots
- No additional tournaments are quasirandom-forcing
- Quasirandom permutations are characterized by 4-point densities
- On multi-dimensional pseudorandom subsets
- On pseudo-random subsets of the set of the integers not exceeding \(N\)
- Quasirandom arithmetic permutations
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Characterization of quasirandom permutations by a pattern sum
- Quasirandom Groups
- Forcing quasirandomness with triangles
- Popular progression differences in vector spaces II
- scientific article; zbMATH DE number 7101952 (Why is no real title available?)
- Pseudo-random subsets constructed by using Fermat quotients
- Quasirandomness in hypergraphs
- Linear quasi-randomness of subsets of abelian groups and hypergraphs
- Quasi-random words and limits of word sequences
- Linear quasi-randomness of subsets of abelian groups and hypergraphs
- Quasirandom-Forcing Orientations of Cycles
- Quasirandom Latin squares
- Quasi-random Boolean functions
- The VC dimension of quadratic residues in finite fields
- Forcing generalized quasirandom graphs efficiently (extended abstract)
This page was built for publication: Quasi-random subsets of \(\mathbb{Z}_ n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1194750)
