Related papers: Polynomial time algorithms in invariant theory for…
We study a class of projective transformations of spectraplexes associated with self-dual cones and, on this basis, propose a polynomial-time algorithm for convex feasibility problems with positive definite constraints. At each iteration of…
The phase space of an integrable Hamiltonian system is foliated by invariant tori. For an arbitrary Hamiltonian H such a foliation may not exist, but we can artificially construct one through a parameterised family of surfaces, with the…
Transport in near-integrable, but partially chaotic, $1 1/2$ degree-of-freedom Hamiltonian systems is blocked by invariant tori and is reduced at \emph{almost}-invariant tori, both associated with the invariant tori of a neighboring…
We present a simple and natural extension of the multi-robot motion planning problem where the robots are partitioned into groups (colors), such that in each group the robots are interchangeable. Every robot is no longer required to move to…
The problem of solving tropical linear systems, a natural problem of tropical mathematics, has already proven to be very interesting from the algorithmic point of view: it is known to be in $NP\cap coNP$ but no polynomial time algorithm is…
Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…
This is part I of a book on KAM theory. We start from basic symplectic geometry, review Darboux-Weinstein theorems action angle coordinates and their global obstructions. Then we explain the content of Kolmogorov's invariant torus theorem…
The main theme of this dissertation is the study of the lattice points in a rational convex polyhedron and their encoding in terms of Barvinok's short rational functions. The first part of this thesis looks into theoretical applications of…
We reconsider the classical problem of the continuation of degenerate periodic orbits in Hamiltonian systems. In particular we focus on periodic orbits that arise from the breaking of a completely resonant maximal torus. We here propose a…
We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
One approach to understand the chaotic dynamics of nonlinear dissipative systems is the study of non-chaotic yet dynamically unstable invariant solutions embedded in the system's chaotic attractor. The significance of zero-dimensional…
Often, polynomials or rational functions, orthogonal for a particular inner product are desired. In practical numerical algorithms these polynomials are not constructed, but instead the associated recurrence relations are computed.…
Let $X=X_1\sqcup X_2\sqcup\ldots\sqcup X_k$ be a partitioned set of variables such that the variables in each part $X_i$ are noncommuting but for any $i\neq j$, the variables $x\in X_i$ commute with the variables $x'\in X_j$. Given as input…
We study the existence of infinite-dimensional invariant tori in a mechanical system of infinitely many rotators weakly interacting with each other. We consider explicitly interactions depending only on the angles, with the aim of…
The goal of this paper is to present a methodology for the computation of invariant tori in Hamiltonian systems combining flow map methods, parameterization methods, and symplectic geometry. While flow map methods reduce the dimension of…
Invariants allow to classify images up to the action of a group of transformations. In this paper we introduce notions of the algebras of simultaneous polynomial and rational 2D moment invariants and prove that they are isomorphic to the…
This paper contains an attempt to formulate rigorously and to check predictions in enumerative geometry of curves following from Mirror Symmetry. The main tool is a new notion of stable map. We give an outline of a contsruction of…
We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form. We show that they essentially can be reduced to two computer…
Parity games are games that are played on directed graphs whose vertices are labeled by natural numbers, called priorities. The players push a token along the edges of the digraph. The winner is determined by the parity of the greatest…
This paper studies the distributed optimization problem with possibly nonidentical local constraints, where its global objective function is composed of $N$ convex functions. The aim is to solve the considered optimization problem in a…