Related papers: Polynomial time algorithms in invariant theory for…
Partially ordered models of time occur naturally in applications where agents or processes cannot perfectly communicate with each other, and can be traced back to the seminal work of Lamport. In this paper we consider the problem of…
This paper studies a class of multi-robot coordination problems where a team of robots aim to reach their goal regions with minimum time and avoid collisions with obstacles and other robots. A novel numerical algorithm is proposed to…
Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in…
The Team Orienteering Problem (TOP) is an attractive variant of the Vehicle Routing Problem (VRP). The aim is to select customers and at the same time organize the visits for a vehicle fleet so as to maximize the collected profits and…
Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…
Knot concordance plays a crucial role in the low dimensional topology. We propose a very elementary techniques which allows one to construct a lot of sliceness obstructions for knots in the full torus. Our approach deals with group…
In this paper we implement a numerical algorithm to compute codimension-one tori in three-dimensional, volume-preserving maps. A torus is defined by its conjugacy to rigid rotation, which is in turn given by its Fourier series. The…
We consider synchrony patterns in coupled phase oscillator networks that correspond to invariant tori. For specific nongeneric coupling, these tori are equilibria relative to a continuous symmetry action. We analyze how the invariant tori…
We consider the problem of planning a collision-free path of a robot in the presence of risk zones. The robot is allowed to travel in these zones but is penalized in a super-linear fashion for consecutive accumulative time spent there. We…
We consider constrained optimization problems defined in the tropical algebra setting on a linearly ordered, algebraically complete (radicable) idempotent semifield (a semiring with idempotent addition and invertible multiplication). The…
There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…
For various values of n, d, and the phase space dimension, we construct simple examples of Hamiltonian and reversible systems possessing smooth d-parameter families of invariant n-tori carrying conditionally periodic motions. In the…
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…
In order to solve complex, long-horizon tasks, intelligent robots need to carry out high-level, abstract planning and reasoning in conjunction with motion planning. However, abstract models are typically lossy and plans or policies computed…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
Coordinating the motion of multiple agents in constrained environments is a fundamental challenge in robotics, motion planning, and scheduling. A motivating example involves $n$ robotic arms, each represented as a line segment. The…
We give a constructive proof of the existence of lower dimensional elliptic tori in nearly integrable Hamiltonian systems. In particular we adapt the classical Kolmogorov's normalization algorithm to the case of planetary systems, for which…
Devising efficient algorithms that track the optimizers of continuously varying convex optimization problems is key in many applications. A possible strategy is to sample the time-varying problem at constant rate and solve the resulting…
We consider a class of quasi-integrable Hamiltonian systems obtained by adding to a non-convex Hamiltonian function of an integrable system a perturbation depending only on the angle variables. We focus on a resonant maximal torus of the…
We study a class of orbit recovery problems in which we observe independent copies of an unknown element of $\mathbb{R}^p$, each linearly acted upon by a random element of some group (such as $\mathbb{Z}/p$ or $\mathrm{SO}(3)$) and then…