Related papers: Finding the theta-Guarded Region

The theta dependent of pure gauge theories in four dimensions can be studied using a duality of large N gauge theories with string theory on a certain spacetime. Via this duality, one can argue that for every theta, there are infinitely…

A graph is almost self-centered (ASC) if all but two of its vertices are central. An almost self-centered graph with radius $r$ is called an $r$-ASC graph. The $r$-ASC index $\theta_r(G)$ of a graph $G$ is the minimum number of vertices…

The clique cover number of a graph G is the minimum number of cliques required to cover the edges of graph G. In this paper we consider the random graph G(n,p), for p constant. We prove that with probability 1-o(1), the clique number of…

An orthogonal polygon is called an ortho-unit polygon if its vertices have integer coordinates, and all of its edges have length one. In this paper we prove that any ortho-unit polygon with $n \geq 12$ vertices can be guarded with at most…

The paper presents two edge grouping algorithms for finding a closed contour starting from a particular edge point and enclosing a fixation point. Both algorithms search a shortest simple cycle in \textit{an angularly ordered graph} derived…

For the ternary quadratic form Q(x) = x^2 + y^2 - z^2 and a non-zero Pythagorean triple x_0 in Z^3 lying on the cone Q(x) = 0, we consider an orbit O = x_0 Gamma of a finitely generated subgroup Gamma < SO_Q(Z) with critical exponent…

The theta cycle of a modular form modulo a prime $p\geq 5$ is well understood. By contrast, the theta cycle modulo a power of $p$ is still mysterious and experimentally erratic. Here we completely determine the theta cycle of a weight $k <…

Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be seen as a generalization of Kakeya's problem of finding a…

Let $\X$ be an irreducible, smooth, projective curve of genus $g \geq 2$ defined over the complex field $\C.$ Then there is a covering $\pi: \X \longrightarrow \P^1,$ where $\P^1$ denotes the projective line. The problem of expressing…

To any generic curve in an oriented surface there corresponds an oriented chord diagram, and any oriented chord diagram may be realized by a curve in some oriented surface. The genus of an oriented chord diagram is the minimal genus of an…

We consider a partially overdetermined problem in a sector-like domain $\Omega$ in a cone $\Sigma$ in $\mathbb{R}^N$, $N\geq 2$, and prove a rigidity result of Serrin type by showing that the existence of a solution implies that $\Omega$ is…

For a set $Q$ of points in the plane and a real number $\delta \ge 0$, let $\mathbb{G}_\delta(Q)$ be the graph defined on $Q$ by connecting each pair of points at distance at most $\delta$. We consider the connectivity of…

Any generic closed curve in the plane can be transformed into a simple closed curve by a finite sequence of local transformations called homotopy moves. We prove that simplifying a planar closed curve with $n$ self-crossings requires…

This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…

Terrain Guarding Problem(TGP), which is known to be NP-complete, asks to find a smallest set of guard locations on a terrain $T$ such that every point on $T$ is visible by a guard. Here, we study this problem on 1.5D orthogonal terrains…

We consider the problem of computing, given a set S of n points in the plane, which points of S are vertices of the convex hull of S. For certain variations of this problem, different proofs exist that the complexity of this problem in the…

The theta--fan F_theta is the quotient space obtained by identifying the non--isolated points of the product theta \times (omega+1) with a single point \infty. (Here, theta has the discrete topology and omega+1 has the order topology.) We…

We consider an area minimizing current $T$ in a $C^2$ submanifold $\Sigma$ of $\mathbb{R}^{m+n}$, with arbitrary integer boundary multiplicity $\partial T = Q [\![ \Gamma ]\!]$ where $\Gamma$ is a $C^2$ submanifold of $\Sigma$. We show that…

Let $\mathcal L$ be a set of $n$ lines in the plane, and let $C$ be a convex curve in the plane, like a circle or a parabola. The "zone" of $C$ in $\mathcal L$, denoted $\mathcal Z(C,\mathcal L)$, is defined as the set of all cells in the…

In this paper, we use a new method to decrease the parameterized complexity bound for finding the minimum vertex cover of connected max-degree-3 undirected graphs. The key operation of this method is reduction of the size of a particular…