Related papers: An integral region choice problem on knot projecti…
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…
The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they have a computational advantage over some alternatives and that this makes them successful in real-world applications.…
In a previous paper (q-alg/9501022) we suggested some algorithms that could be useful in solving the problem of knot classification. Here we continue this discussion by answering questions raised in that paper and by commenting on practical…
In this paper, we study the unknotting operation for twisted knots, called arc shift move. First, we find a family of twisted knots with arc shift number $n$ for any given $n \in \mathbb{N}$. Then we define a new unknotting operation,…
In this paper, we formulate a new local move on virtual knot diagram, called arc shift move. Further, we extend it to another local move called region arc shift defined on a region of a virtual knot diagram. We establish that these arc…
We propose a black-box approach to reducing large semidefinite programs to a set of smaller semidefinite programs by projecting to random linear subspaces. We evaluate our method on a set of polynomial optimization problems, demonstrating…
In this paper, we consider the feasibility problem, which aims to find a feasible point for the constraint set $\{x \in \mathbb{R}^n: c(x) = 0\}$ over a possibly non-regular subset $\mathcal{X} \subset \mathbb{R}^n$. Under the constraint…
We study surface knots in 4-space by using generic planar projections. These projections have fold points and cusps as their singularities and the image of the singular point set divides the plane into several regions. The width (or the…
In this paper we present a new algorithmic realization of a projection-based scheme for general convex constrained optimization problem. The general idea is to transform the original optimization problem to a sequence of feasibility…
We consider the problem of deciding, given a sequence of regions, if there is a choice of points, one for each region, such that the induced polyline is simple or weakly simple, meaning that it can touch but not cross itself. Specifically,…
This paper introduces a new framework for constructing the Discrete Empirical Interpolation Method DEIM projection operator. The interpolation node selection procedure is formulated using the QR factorization with column pivoting, and it…
The method of alternating projections involves orthogonally projecting an element of a Hilbert space onto a collection of closed subspaces. It is known that the resulting sequence always converges in norm if the projections are taken…
Using Boolean algebra, we discuss the region unknotting number of a knot, and show that the region unknotting number is less than or equal to (c+1)/2 for any knot with crossing number c. This is a progress from (c+2)/2.
The main goal of this paper is applying the cut-off projection for solving one-dimensional backward heat conduction problem in a two-slab system with a perfect contact. In a constructive manner, we commence by demonstrating the…
Automating the solutions of multiple network information theory problems, stretching from fundamental concerns such as determining all information inequalities and the limitations of linear codes, to applied ones such as designing coded…
Let $\mu$ be a metric on a set T, and let c be a nonnegative function on the unordered pairs of elements of a superset $V\supseteq T$. We consider the problem of minimizing the inner product $c\cdot m$ over all semimetrics m on V such that…
We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…
We discuss representations of the projective line over a ring $R$ with 1 in a projective space over some (not necessarily commutative) field $K$. Such a representation is based upon a $(K,R)$-bimodule $U$. The points of the projective line…
We consider detecting objects in an image by iteratively selecting from a set of arbitrarily shaped candidate regions. Our generic approach, which we term visual chunking, reasons about the locations of multiple object instances in an image…
In this paper we present a new approach based on the heat equation and extension problems to some intertwining formulas arising in conformal CR geometry.