Related papers: Geometry and complexity of O'Hara's algorithm
We study two recent conjectures for holographic complexity: the complexity=action conjecture and the complexity=volume conjecture. In particular, we examine the structure of the UV divergences appearing in these quantities, and show that…
We present a learning approach for localization and segmentation of objects in an image in a manner that is robust to partial occlusion. Our algorithm produces a bounding box around the full extent of the object and labels pixels in the…
An approach is shown that proves various theorems of plane geometry in an algorithmic manner. The approach affords transparent proofs of a generalization of the Theorem of Morley and other well known results by casting them in terms of…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of…
We discuss issues of problem formulation for algorithms in real algebraic geometry, focussing on quantifier elimination by cylindrical algebraic decomposition. We recall how the variable ordering used can have a profound effect on both…
We study the semistability of quiver representations from an algorithmic perspective. We present efficient algorithms for several fundamental computational problems on the semistability of quiver representations: deciding the semistability…
We present a fast algorithm for computing discrete cubical homology of graphs over finite fields with an appropriate characteristic. This algorithm improves on several computational steps compared to constructions in the existing…
We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality between successive levels of resolution using dynamic…
We investigate factorizability of a quadratic split quaternion polynomial. In addition to inequality conditions for existence of such factorization, we provide lucid geometric interpretations in the projective space over the split…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
We investigate the problem of partitioning a rectilinear polygon $P$ with $n$ vertices and no holes % with no holes into rectangles using disjoint line segments drawn inside $P$ under two optimality criteria. In the minimum ink partition,…
In this thesis we consider a discretization of the Euler top given by Hirota und Kimura. Using the geometric description of the conserved quantities as quadrics in real 3-space, we find that there exist maps on rulings of quadrics in the…
Our research deals with the optimization version of the set partition problem, where the objective is to minimize the absolute difference between the sums of the two disjoint partitions. Although this problem is known to be NP-hard and…
In this paper, we present, to our knowledge, the first known I/O efficient solutions for computing the k-bisimulation partition of a massive directed graph, and performing maintenance of such a partition upon updates to the underlying…
The paper describes a new algorithm of construction of the nonlinear arithmetic triangle on the basis of numerical simulation and the binary system. It demonstrates that the numbers that fill the nonlinear arithmetic triangle may be…
We translate Uchimura's identity for the divisor function and whose generalizations into combinatorics of partitions, and give a combinatorial proof of them. As a by-product of their proofs, we obtain some combinatorial results.
We consider the Minimum Convex Partition problem: Given a set P of n points in the plane, draw a plane graph G on P, with positive minimum degree, such that G partitions the convex hull of P into a minimum number of convex faces. We show…
We present a bijection for toroidal maps that are essentially $3$-connected ($3$-connected in the periodic planar representation). Our construction actually proceeds on certain closely related bipartite toroidal maps with all faces of…
We thoroughly study a novel but basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that every pair of rows in the resulting matrix has a Hamming distance within a specified range.…