Related papers: The Semialgebraic Orbit Problem
We study \emph{sublinear} algorithms that solve linear systems locally. In the classical version of this problem the input is a matrix $S\in \mathbb{R}^{n\times n}$ and a vector $b\in\mathbb{R}^n$ in the range of $S$, and the goal is to…
Given a polynomial $f$ and a semi-algebraic set $S$, we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set $Q$ which is identical to the closure of the image of $S$ under $f$, i.e.,…
In this paper we study reachability verification problems of stochastic discrete-time dynamical systems over the infinite time horizon. The reachability verification of interest in this paper is to certify specified lower and upper bounds…
This paper resolves a famous and longstanding open question in automata theory, i.e., the {\it linear-bounded automata question} (or shortly, LBA question), which can also be phrased succinctly in the language of computational complexity…
The Yang-Baxter equation for a $SU(2)\times U(1)$-symmetric $S=1/2$ spin-orbital chain was solved using the special computer algorithm developed by the author. The 8 new $R$-matrices separated on 5 groups are presented. Among the obtained…
We present subquadratic algorithms in the algebraic decision-tree model for several \textsc{3Sum}-hard geometric problems, all of which can be reduced to the following question: Given two sets $A$, $B$, each consisting of $n$ pairwise…
Reachability analysis is a fundamental problem for safety verification and falsification of Cyber-Physical Systems (CPS) whose dynamics follow physical laws usually represented as differential equations. In the last two decades, numerous…
Explicit formulas for {\sl orbital carriers} of periods $4$, $5$, and $6$ are reported for discrete-time quadratic dynamics. A systematic investigation of {\sl orbital inheritance} for periods as high as $k\leq 12$ is also reported.…
We study elliptic and parabolic problems governed by the singular elliptic operators \begin{align*} \mathcal L=y^{\alpha_1}\mbox{Tr }\left(QD^2_xu\right)+2y^{\frac{\alpha_1+\alpha_2}{2}}q\cdot \nabla_xD_y+\gamma y^{\alpha_2}…
The nonrelativistic motion of a charged particle around a dyon in (9+1) spacetime is known as the nine-dimensional MICZ-Kepler problem. This problem has been solved exactly by the variables-separation method in three different coordinate…
This Ph.D. thesis contains original contributions to several areas within the disciplines of disordered systems, numerical linear algebra, and scientific computing: (1) Theoretical and numerical study of the errors caused by using certain…
In its most general form, the optimal transport problem is an infinite-dimensional optimization problem, yet certain notable instances admit closed-form solutions. We identify the common source of this tractability as \textit{symmetry} and…
String theory contains various extended objects. Among those, objects of codimension two (such as the D7-brane) are particularly interesting. Codimension two objects carry non-Abelian charges which are elements of a discrete U-duality group…
In many kinds of infinite-state systems, the coverability problem has significantly lower complexity than the reachability problem. In order to delineate the border of computational hardness between coverability and reachability, we propose…
The Separating Hyperplane theorem is a fundamental result in Convex Geometry with myriad applications. Our first result, Random Separating Hyperplane Theorem (RSH), is a strengthening of this for polytopes. $\rsh$ asserts that if the…
This paper considers a fractional programming problem (P) which minimizes a ratio of quadratic functions subject to a two-sided quadratic constraint. As is well-known, the fractional objective function can be replaced by a parametric family…
A set of lines in $\mathbb{R}^d$ passing through the origin is called equiangular if any two lines in the set form the same angle. We proved an alternative version of the three-point semidefinite constraints developed by Bachoc and…
Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…
Let $B$ be a set of $n$ axis-parallel boxes in $\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of…
We study the problem of learning a high-density region of an arbitrary distribution over $\mathbb{R}^d$. Given a target coverage parameter $\delta$, and sample access to an arbitrary distribution $D$, we want to output a confidence set $S…