English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

For a given subcritical discrete Schrödinger operator  on a weighted infinite graph , we construct a Hardy-weight  which is  in the following sense. The operator  − λ is subcritical in  for all  < 1, null-critical in  for  = 1, and supercritical near any neighborhood of infinity in  for any  > 1. Our results rely on a criticality theory for Schrödinger operators on general weighted graphs.

Optimal Hardy inequalities for Schrödinger operators on graphs