Related papers: Complexity of Robust Orbit Problems for Torus Acti…
We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…
Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach and evaluation of computational complexity. However in…
The complexity of representing a polynomial by a Read-Once Oblivious Algebraic Branching Program (ROABP) is highly dependent on the chosen variable ordering. Bhargava et al. prove that finding the optimal ordering is NP-hard, and provide…
This paper proposes a thought experiment to search for efficient bounded algorithms of NPC problems by machine enumeration. The key contributions are: -- On Universal Turing Machines, a program's time complexity should be characterized as:…
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…
In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…
Any knot in a solid torus, called a pattern or satellite operator, acts on knots in the 3-sphere via the satellite construction. We introduce a generalization of satellite operators which form a group (unlike traditional satellite…
The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…
The Orbit Problem asks whether the orbit of a point under a matrix reaches a given target set. When the target is a single point, the problem was shown to be decidable in polynomial time by Kannan and Lipton. This decidability result was…
Fueled by algorithmic advances, AI algorithms are increasingly being deployed in settings subject to unanticipated challenges with complex social effects. Motivated by real-world deployment of AI driven, social-network based suicide…
The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X.…
The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…
Covariant or invariant functions under a compact linear group can be expressed in terms of functions defined in the orbit space of the group. The semialgebraic relations defining the orbit spaces of all finite coregular real linear groups…
We deliver a call to arms for probabilistic numerical methods: algorithms for numerical tasks, including linear algebra, integration, optimization and solving differential equations, that return uncertainties in their calculations. Such…
Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases,…
We consider an extended version of Horn's problem: given two orbits $\mathcal{O}_\alpha$ and $\mathcal{O}_\beta$ of a linear representation of a compact Lie group, let $A\in \mathcal{O}_\alpha$, $B\in \mathcal{O}_\beta$ be independent and…
We present a new approach to equivariant version of the topological complexity, called a symmetric topological complexity. It seems that the presented approach is more adequate for the analysis of an impact of symmetry on the the motion…
Studied here is the effect of the presence of symmetry groups in a system of algebraic equations on the numerical resolution with fixed-point algorithms. It is proved that the symmetries imply two important properties of the system: the…
We begin with a review of the notion of a braid group. We then discuss some known solutions to decision problems in braid groups. We then move on to proving new results in braid group algorithmics. We offer a quick solution to the…
Isometries are ubiquitous in nature; isometries of discrete (quantized) objects---abstracted as the group of isometries of $\mathbb{Z}^n$ denoted by $\mathsf{ISO}(\mathbb{Z}^n)$---are important concepts in the computational world. In this…