Related papers: Polynomial time algorithms in invariant theory for…
Invariant theory is concerned with functions that do not change under the action of a given group. Here we communicate an approach based on tensor networks to represent polynomial local unitary invariants of quantum states. This graphical…
This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…
We consider actions of reductive groups on a varieties with finitely generated Cox ring, e.g., the classical case of a diagonal action on a product of projective spaces. Given such an action, we construct via combinatorial data in the Cox…
We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…
In this paper we consider $m$ ($m \geq 1$)conjunctions of Max-atoms that is atoms of the form $\max(z,y) + r \geq x$, where the offset $r$ is a real constant and $x,y,z$ are variables. We show that the Max-atom problem (MAP) belongs to…
We consider a particular class of equations of motion, generalizing to n degrees of freedom the "dissipative spin--orbit problem", commonly studied in Celestial Mechanics. Those equations are formulated in a pseudo-Hamiltonian framework…
The purpose of this paper is to present a method to compute parameterizations of invariant tori and bundles in non-autonomous quasi-periodic Hamiltonian systems. We generalize flow map parameterization methods to the quasi-periodic setting.…
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the…
The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…
In this paper, we study cohomology rings and cohomological pairings over Abelian symplectic quotients of special Hamiltonian tori manifolds. The Hamiltonian group actions appear in quantum information theory where the tori are maximal tori…
We present a method for computing invariant tori of dimension greater than one. The method uses a single short trajectory of a dynamical system without any continuation or initial guesses. No preferred coordinate system is required, meaning…
In this paper we present a deterministic polynomial time algorithm for testing if a symbolic matrix in non-commuting variables over $\mathbb{Q}$ is invertible or not. The analogous question for commuting variables is the celebrated…
A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…
In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running…
In this thesis, we aim to improve the performance of TAMP algorithms from three complementary perspectives. First, we investigate the integration of discrete task planning with continuous trajectory optimization. Our main contribution is a…
We analyze the breakup of invariant tori in Hamiltonian systems with two degrees of freedom using a combination of KAM theory and renormalization-group techniques. We consider a class of Hamiltonians quadratic in the action variables that…
We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…
This paper focuses on distinguishing classes of dynamical behavior for one- and two-dimensional torus maps, in particular between orbits that are incommensurate, resonant, periodic, or chaotic. We first consider Arnold's circle map, for…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…