Related papers: Generating Plane Quadrangulations and Symmetry-pre…
In this article we introduce three maps, OLG, CLG and LG in LGT-space literature and show that these maps are extension of the continuous function in LGT-spaces and have the almost properties of the continuous functions. Also, it has been…
We present master formulas for the divergent part of the one-loop effective action for an arbitrary (both minimal and nonminimal) operators of any order in the 4-dimensional curved space. They can be considered as computer algorithms,…
In this paper, we establish a three circles type theorem, involving the harmonic area function, for harmonic mappings. Also, we give bounds for length and area distortion for harmonic quasiconformal mappings. Finally, we will study certain…
Automatic generation of level maps is a popular form of automatic content generation. In this study, a recently developed technique employing the {\em do what's possible} representation is used to create open-ended level maps. Generation of…
We compute, for each genus $g\geq 0$, the generating function $L_g\equiv L_g(t;p_1,p_2,\dots)$ of (labelled) bipartite maps on the orientable surface of genus $g$, with control on all face degrees. We exhibit an explicit change of variables…
Constraining motion to a flat surface is a fundamental requirement for equipment across science and engineering. Modern precision robotic motion systems, such as gantries, rely on the flatness of components, including guide rails and…
We develop polynomial-size LP-relaxations for {\em orienteering} and the {\em regret-bounded vehicle routing problem} (\rvrp) and devise suitable LP-rounding algorithms that lead to various new insights and approximation results for these…
In this paper, we show that contraction operations preserve the homology of $n$D generalized maps, under some conditions. Removal and contraction operations are used to propose an efficient algorithm that compute homology generators of $n$D…
Entropic regularization is quickly emerging as a new standard in optimal transport (OT). It enables to cast the OT computation as a differentiable and unconstrained convex optimization problem, which can be efficiently solved using the…
MAP inference for general energy functions remains a challenging problem. While most efforts are channeled towards improving the linear programming (LP) based relaxation, this work is motivated by the quadratic programming (QP) relaxation.…
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
A result is given to find points where a real valued function on the plane is not smooth. Provided this function is induced by a smooth mapping from three dimensions to the plane, from a function on surfaces in three dimensions. This has…
This paper proposes a methodology for the automated construction of rectangular floorplans (RFPs) while addressing dimensional constraints and adjacency relations. Here, adjacency relations are taken in the form of a dimensionless…
An approximate formulation of a robust geometric program (RGP) as a convex program is proposed. Interest in using geometric programs (GPs) to model complex engineering systems has been growing, and this has motivated explicitly modeling the…
New universal invariant operators are introduced in a class of geometries which include the quaternionic structures and their generalisations as well as 4-dimensional conformal (spin) geometries. It is shown that, in a broad sense, all…
This paper is concerned with problems relevant to motion planning in robotics. Configuration spaces are of practical relevance in designing safe control schemes for robots moving on a track. The topological complexity of a configuration…
We study the Quadratic Cycle Cover Problem (QCCP), which aims to find a node-disjoint cycle cover in a directed graph with minimum interaction cost between successive arcs. We derive several semidefinite programming (SDP) relaxations and…
This paper gives simple distributed algorithms for the fundamental problem of computing graph distances in the Congested Clique model. One of the main components of our algorithms is fast matrix multiplication, for which we show an…
Inspired by the artwork of Mark Lombardi, we study the problem of constructing orthogonal drawings where a small number of horizontal and vertical line segments covers all vertices. We study two problems on orthogonal drawings of planar…
Enabling robotic agents to perform complex long-horizon tasks has been a long-standing goal in robotics and artificial intelligence (AI). Despite the potential shown by large language models (LLMs), their planning capabilities remain…