✦ LIBER ✦

A natural lower bound for the size of nodal sets

✍ Scribed by Hezari, Hamid; Sogge, Christopher

Book ID: 120015839
Publisher: Mathematical Sciences Publishers
Year: 2012
Tongue: English
Weight: 960 KB
Volume: 5
Category: Article
ISSN: 2157-5045
DOI: 10.2140/apde.2012.5.1133

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds for Nodal Sets of Eigenfunc

Lower Bounds for Nodal Sets of Eigenfunctions

✍ Tobias H. Colding; William P. Minicozzi 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 159 KB

Lower Bounds for Nodal Sets of Dirichlet

Lower Bounds for Nodal Sets of Dirichlet and Neumann Eigenfunctions

✍ Sinan Ariturk 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 162 KB

Lower Bounds on Nodal Sets of Eigenfunct

Lower Bounds on Nodal Sets of Eigenfunctions via the Heat Flow

✍ Steinerberger, Stefan 📂 Article 📅 2014 🏛 Taylor and Francis Group 🌐 English ⚖ 304 KB

A superlinear lower bound for the size o

A superlinear lower bound for the size of a critical set in a latin square

✍ Nicholas J. Cavenagh 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

## Abstract A critical set is a partial latin square that has a unique completion to a latin square, and is minimal with respect to this property. Let __scs__(__n__) denote the smallest possible size of a critical set in a latin square of order __n__. We show that for all __n__, $scs(n)\geq n\lfloo

A lower bound for the hitting set size f

A lower bound for the hitting set size for combinatorial rectangles and an application

✍ L.Sunil Chandran 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 87 KB

We prove a lower bound of ( 1 ε (m + log(da)) where a = log m ( 1 4ε ) for the hitting set size for combinatorial rectangles of volume at least ε in 9 ] and d > 2.

A probabilistic lower bound for checking

A probabilistic lower bound for checking disjointness of sets

✍ Udi Manber 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 283 KB