Related papers: Lower Bounds for Electrical Reduction on Surfaces

Let $G$ be a connected graph. The edge-connectivity of $G$, denoted by $\lambda(G)$, is the minimum number of edges whose removal renders $G$ disconnected. Let $\delta(G)$ be the minimum degree of $G$. It is well-known that $\lambda(G) \leq…

We prove that any Markov chain that performs local, reversible updates on randomly chosen vertices of a bounded-degree graph necessarily has mixing time at least $\Omega(n\log n)$, where $n$ is the number of vertices. Our bound applies to…

We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the…

We show that every triangulation (maximal planar graph) on $n\ge 6$ vertices can be flipped into a Hamiltonian triangulation using a sequence of less than $n/2$ combinatorial edge flips. The previously best upper bound uses $4$-connectivity…

Given a graph $G$, an {\em obstacle representation} of $G$ is a set of points in the plane representing the vertices of $G$, together with a set of connected obstacles such that two vertices of $G$ are joined by an edge if and only if the…

We study vertex sparsification for distances, in the setting of planar graphs with distortion: Given a planar graph $G$ (with edge weights) and a subset of $k$ terminal vertices, the goal is to construct an $\varepsilon$-emulator, which is…

A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…

The classic lower bound of Kuhn, Moscibroda and Wattenhofer [JACM 2016] states that approximate maximum matching and approximate vertex cover (among other problems) in the LOCAL model require $\Omega(\min\{\sqrt{\frac{\log n}{\log\log n}},…

We describe an algorithm that morphs between two planar orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$, while preserving planarity and orthogonality. Necessarily $\Gamma_I$ and $\Gamma_O$ share the same combinatorial…

Achieving efficient nonlinear optical frequency conversion in small volumes is key for future on-chip photonic devices that would provide a higher-speed alternative to modern electronics. However, the already intrinsically low conversion…

We dress bare quantum graphs with finite delta function potentials and calculate optical nonlinearities that are found to match the fundamental limits set by potential optimization. We show that structures whose first hyperpolarizability is…

We investigate the behavior of non-Euclidean plates with constant negative Gaussian curvature using the F\"oppl-von K\'arm\'an reduced theory of elasticity. Motivated by recent experimental results, we focus on annuli with a periodic…

Electromagnetic metasurfaces have attracted significant interest recently due to their low profile and advantageous applications. Practically, many metasurface designs start with a set of constraints for the radiated far-field, such as…

It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…

We show that by restricting the degrees of the vertices of a graph to an arbitrary set \( \Delta \), the threshold point $ \alpha(\Delta) $ of the phase transition for a random graph with $ n $ vertices and $ m = \alpha(\Delta) n $ edges…

We study the Laplacian with zero magnetic field acting on complex functions of a planar domain $\Omega$, with magnetic Neumann boundary conditions. If $\Omega$ is simply connected then the spectrum reduces to the spectrum of the usual…

Every now and then one can hear in the molecular electronics community that asymmetric couplings ($\Gamma_{s} \neq \Gamma_{t}$) of the dominant level (molecular orbital) to electrodes ($s$ and $t$) which typically have shapes different of…

Given a complete graph $K_{n}=(V, E)$ with non-negative edge costs $c\in {\mathbb R}^{E}$, the problem $2EC$ is that of finding a 2-edge connected spanning multi-subgraph of $K_{n}$ of minimum cost. The integrality gap $\alpha\text{2EC}$ of…

For a given family of smooth closed curves $\gamma^1,...,\gamma^\alpha\subset\mathbb{R}^3$ we consider the problem of finding an elastic \emph{connected} compact surface $M$ with boundary $\gamma=\gamma^1\cup...\cup\gamma^\alpha$. This is…

We consider edge insertion and deletion operations that increase the connectivity of a given planar straight-line graph (PSLG), while minimizing the total edge length of the output. We show that every connected PSLG $G=(V,E)$ in general…