✦ LIBER ✦

Metrical lower bounds on the discrepancy of digital Kronecker-sequences

✍ Scribed by Larcher, Gerhard; Pillichshammer, Friedrich

Book ID: 122269068
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 345 KB
Volume: 135
Category: Article
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2013.08.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A metrical lower bound on the star discr

A metrical lower bound on the star discrepancy of digital sequences

✍ Gerhard Larcher, Friedrich Pillichshammer 📂 Article 📅 2013 🏛 Springer Vienna 🌐 English ⚖ 274 KB

Metrical results on the discrepancy of H

Metrical results on the discrepancy of Halton–Kronecker sequences

✍ Roswitha Hofer, Gerhard Larcher 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 French ⚖ 213 KB

On the cube-discrepancy of Kronecker-seq

On the cube-discrepancy of Kronecker-sequences

✍ Gerhard Larcher 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 318 KB

Improved lower bounds on the length of D

Improved lower bounds on the length of Davenport-Schinzel sequences

✍ Micha Sharir 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 421 KB

Lower bounds on the lengths of node sequ

Lower bounds on the lengths of node sequences in directed graphs

✍ George Markowsky; Robert Endre Tarjan 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 353 KB

A strong node sequence for a directed graph G = (N, A) is a sequence of nodes containing every cycle-free path of G as a subsequence. A weak node sequence for G is a sequence of nodes containing every basic path in G as a subsequence, where a basic path nt, n~ ..... nj, is a path from Ilt to nk such

Lower Bounds on the Distortion of Embedd

Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs

✍ Y. Rabinovich; R. Raz 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 176 KB