相关论文: Finding the theta-Guarded Region

Given a partition of a graph into connected components, the membership oracle asserts whether any two vertices of the graph lie in the same component or not. We prove that for $n\ge k\ge 2$, learning the components of an $n$-vertex hidden…

We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in general position (with no three points collinear): perfect…

In this paper, we study the static cell probe complexity of non-adaptive data structures that maintain a subset of $n$ points from a universe consisting of $m=n^{1+\Omega(1)}$ points. A data structure is defined to be non-adaptive when the…

In this paper we show that there exists a family of domains $\Omega_{\varepsilon}\subseteq\mathbb{R}^N$ with $N\ge2$, such that the $stable$ solution of the problem \[ \begin{cases} -\Delta u= g(u)&\hbox{in }\Omega_\varepsilon\\…

Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault-tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be…

A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…

The equations of a planar elastica under pressure can be rewritten in a useful form by parametrising the variables in terms of the local orientation angle, $\theta$, instead of the arc length. This ``$\theta$-formulation'' lends itself to a…

An $\omega$-wedge is the closed set of points contained between two rays that are emanating from a single point (the apex), and are separated by an angle $\omega < \pi$. Given a convex polygon $P$, we place the $\omega$-wedge such that $P$…

Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique…

We consider the problem of finding an edge in a hidden undirected graph $G = (V, E)$ with $n$ vertices, in a model where we only allowed queries that ask whether or not a subset of vertices contains an edge. We study the non-adaptive model…

Let $P$ be a polytope defined by the system $A x \leq b$, where $A \in R^{m \times n}$, $b \in R^m$, and $\text{rank}(A) = n$. We give a short geometric proof of the following tight upper bound on the number of vertices of $P$: $$ n! \cdot…

Given an equivalence class $[A]$ in the measure algebra of the Cantor space, let $\hat\Phi([A])$ be the set of points having density 1 in $A$. Sets of the form $\hat\Phi([A])$ are called $\mathcal{T}$-regular. We establish several results…

The number of two-dimensional percolation clusters whose external hulls enclose an area greater than A, in a system of area Omega, behaves at the critical point as C \Omega /A for large A, where C = 1/(8 pi sqrt(3)). Here we show that away…

A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial set $S$ of vertices such that every vertex can be reached…

Let $(S, \mathfrak n) $ be a regular local ring and let $I \subseteq \mathfrak n^2 $ be a perfect ideal of $S. $ Sharp upper bounds on the minimal number of generators of $I$ are known in terms of the Hilbert function of $R=S/I. $ Starting…

The thickness $\theta(G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. It is a topological invariant of a graph, which was defined by W.T. Tutte in 1963 and also has important…

Given $n$ points in a circular region $C$ in the plane, we study the problems of moving the $n$ points to its boundary to form a regular $n$-gon such that the maximum (min-max) or the sum (min-sum) of the Euclidean distances traveled by the…

Let $\mathcal{B}$ be a compact convex planar domain with smooth boundary of finite type and $\mathcal{B}_\theta$ its rotation by an angle $\theta$. We prove that for almost every $\theta\in[0, 2\pi]$ the remainder…

Topological data analysis (TDA) allows us to explore the topological features of a dataset. Among topological features, lower dimensional ones have recently drawn the attention of practitioners in mathematics and statistics due to their…

A terrain T is an x-monotone polygonal chain in the plane; T is orthogonal if each edge of T is either horizontal or vertical. In this paper, we give an exact algorithm for the problem of guarding the convex vertices of an orthogonal…