Related papers: Lower Bounds for Electrical Reduction on Surfaces

The Bandwidth Theorem of B\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this…

In this paper we study the rank of planar rigidity matrix of 4-valent graphs, both in case of generic realizations and configurations in general position, under various connectivity assumptions on the graphs. For each case considered, we…

Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of…

A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge…

We improve the lower bound on worst case trace reconstruction from $\Omega\left(\frac{n^{5/4}}{\sqrt{\log n}}\right)$ to $\Omega\left(\frac{n^{3/2}}{\log^{7} n}\right)$. As a consequence, we improve the lower bound on average case trace…

The equilibrium properties and interminiband transitions for Hartree-interacting two-dimensional electron gas in a one-dimensional chain of planar quantum rings subjected to a transverse homogeneous magnetic field are examined theoretically…

We prove a microlocal lower bound on the mass of high energy eigenfunctions of the Laplacian on compact surfaces of negative curvature, and more generally on surfaces with Anosov geodesic flows. This implies controllability for the…

Let $R$ be a Hermitian matrix. The energy of $R$, $\mathcal{E}(R)$, corresponds to the sum of the absolute values of its eigenvalues. In this work it is obtained two lower bounds for $\mathcal{E}(R).$ The first one generalizes a lower bound…

We give a lower bound for the $\ell^p$-distortion $c_p(X)$ of finite graphs $X$, depending on the first eigenvalue $\lambda_1^{(p)}(X)$ of the $p$-Laplacian and the maximal displacement of permutations of vertices. For a $k$-regular…

For a smooth closed embedded planar curve $\Gamma$, we consider the minimization problem of the Willmore energy among immersed surfaces of a given genus $\mathfrak{g}\geq1$ having the curve $\Gamma$ as boundary, without any prescription on…

Given two-dimensional Riemannian manifolds $\mathcal{M},\mathcal{N}$, we prove a lower bound on the distortion of embeddings $\mathcal{M} \to \mathcal{N}$, in terms of the areas' discrepancy $V_{\mathcal{N}}/V_{\mathcal{M}}$, for a certain…

We develop a theory of "minimal $\theta$-graphs" and characterize the behavior of limit laminations of such surfaces, including an understanding of their limit leaves and their curvature blow-up sets. We use this to prove that it is…

One of the fundamental results in graph minor theory is that for every planar graph $H$, there is a minimum integer $f(H)$ such that graphs with no minor isomorphic to $H$ have treewidth at most $f(H)$. A lower bound for ${f(H)}$ can be…

Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem for over 40 years. An early result by Morgenstern from 1973, provides an $\Omega(n…

This paper develops a new technique for proving amortized, randomized cell-probe lower bounds on dynamic data structure problems. We introduce a new randomized nondeterministic four-party communication model that enables "accelerated",…

A hypergraph $H$ is hamiltonian-connected if for any distinct vertices $x$ and $y$, $H$ contains a hamiltonian Berge path from $x$ to $y$. We find for all $3\leq r<n$, exact lower bounds on minimum degree $\delta(n,r)$ of an $n$-vertex…

It is well known that lipid membranes respond to a threshold transmembrane electric field through a reversible mechanism called electroporation, where hydrophilic water pores form across the membrane, an effect widely used in biological…

The classical Crossing Lemma by Ajtai et al.~and Leighton from 1982 gave an important lower bound of $c \frac{m^3}{n^2}$ for the number of crossings in any drawing of a given graph of $n$ vertices and $m$ edges. The original value was $c=…

While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of…

We give an improved lower bound of 10/3 on the competitive ratio for the exploration of an undirected, edge-weighted graph with a single agent that needs to return to the starting location after visiting all vertices. We assume that the…