๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Lower Bound for the CenteredL2-Discrepancy on Asymmetric Factorials and its Application

โœ Scribed by Kashinath Chatterjee; Kai-Tai Fang; Hong Qin

Publisher
Springer
Year
2005
Tongue
English
Weight
159 KB
Volume
63
Category
Article
ISSN
0026-1335

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A spectral lower bound for the treewidth
A spectral lower bound for the treewidth of a graph and its consequences
โœ L.Sunil Chandran; C.R. Subramanian ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

We give a lower bound for the treewidth of a graph in terms of the second smallest eigenvalue of its Laplacian matrix. We use this lower bound to show that the treewidth of a d-dimensional hypercube is at least 3 We generalize this result to Hamming graphs. We also observe that every graph G on n v

A new lower bound for the critical proba
A new lower bound for the critical probability of site percolation on the square lattice
โœ J. van den Berg; A. Ermakov ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 705 KB

The critical probability for site percolation on the square lattice is not known exactly. Several authors have given rigorous upper and lower bounds. Some recent lower bounds are (each displayed here with the first three digits) 0.503 (Toth [13]), 0.522 (Zuev [15]), and the best lower bound so far,