A construction of digital \((0,s)\)-sequences involving finite-row generator matrices (Q413562): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / review text
 
One of the most powerful methods of constructing low-discrepancy sequences is the theory of \((t,m,s)\)-nets and \((t,s)\)-sequences by Niederreiter and the proper digital construction methods (that generalize widely the classical Van-der-Corput sequence). The purpose to the present paper is to provide a generalization of an explicit construction method for digital \((0,s)\)-sequences over \(\mathbb{F}_q\). A special feature of this construction method is the so-called finite row property (for those matrices that are used in the the digital construction method. Previously, explicit examples of finite-row digital \((0,s)\)-sequences have been only known for finite prime fields. An important ingredient of the constructions is a hyperderivative of polynomials over \(\mathbb{F}_q\).
Property / review text: One of the most powerful methods of constructing low-discrepancy sequences is the theory of \((t,m,s)\)-nets and \((t,s)\)-sequences by Niederreiter and the proper digital construction methods (that generalize widely the classical Van-der-Corput sequence). The purpose to the present paper is to provide a generalization of an explicit construction method for digital \((0,s)\)-sequences over \(\mathbb{F}_q\). A special feature of this construction method is the so-called finite row property (for those matrices that are used in the the digital construction method. Previously, explicit examples of finite-row digital \((0,s)\)-sequences have been only known for finite prime fields. An important ingredient of the constructions is a hyperderivative of polynomials over \(\mathbb{F}_q\). / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Michael Drmota / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11K38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11K31 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11B83 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6031175 / rank
 
Normal rank
Property / zbMATH Keywords
 
digital \((0,s)\)-sequences
Property / zbMATH Keywords: digital \((0,s)\)-sequences / rank
 
Normal rank
Property / zbMATH Keywords
 
finite-row generator matrices
Property / zbMATH Keywords: finite-row generator matrices / rank
 
Normal rank
Property / zbMATH Keywords
 
low-discrepancy sequences
Property / zbMATH Keywords: low-discrepancy sequences / rank
 
Normal rank
Property / zbMATH Keywords
 
finite fields
Property / zbMATH Keywords: finite fields / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ffa.2011.12.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039233691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3160669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences, discrepancies and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrépance de suites associées à un système de numération (en dimension s) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution properties of Niederreiter-Halton sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On existence and discrepancy of certain digital Niederreiter–Halton sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2893506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4767350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized (t, s)-Sequences, Kronecker-Type Sequences, and Diophantine Approximations of Formal Laurent Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo and quasi-Monte Carlo sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point sets and sequences with small discrepancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-discrepancy and low-dispersion sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003879 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:25, 5 July 2024

scientific article
Language Label Description Also known as
English
A construction of digital \((0,s)\)-sequences involving finite-row generator matrices
scientific article

    Statements

    A construction of digital \((0,s)\)-sequences involving finite-row generator matrices (English)
    0 references
    0 references
    7 May 2012
    0 references
    One of the most powerful methods of constructing low-discrepancy sequences is the theory of \((t,m,s)\)-nets and \((t,s)\)-sequences by Niederreiter and the proper digital construction methods (that generalize widely the classical Van-der-Corput sequence). The purpose to the present paper is to provide a generalization of an explicit construction method for digital \((0,s)\)-sequences over \(\mathbb{F}_q\). A special feature of this construction method is the so-called finite row property (for those matrices that are used in the the digital construction method. Previously, explicit examples of finite-row digital \((0,s)\)-sequences have been only known for finite prime fields. An important ingredient of the constructions is a hyperderivative of polynomials over \(\mathbb{F}_q\).
    0 references
    digital \((0,s)\)-sequences
    0 references
    finite-row generator matrices
    0 references
    low-discrepancy sequences
    0 references
    finite fields
    0 references

    Identifiers