Related papers: Solving systems of equations in supernilpotent alg…
Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…
Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…
The condition of nilpotency is studied in the general linear Lie algebra $\mathfrak{gl}_{n}(\mathbb{K})$ and the symplectic Lie algebra $\mathfrak{sp}_{2m}(\mathbb{K})$ over an algebraically closed field of characteristic 0. In particular,…
The multiplicities a_{lambda,mu} of simple modules L(mu) in the composition series of Kac modules V(lambda) for the Lie superalgebra gl(m/n) were described by Serganova, leading to her solution of the character problem for gl(m/n). In…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
To any pair of commuting n x n nilpotent matrices it is associated a pair of partitions of n. We describe a maximal nilpotent subalgebra of the centralizer of a given nilpotent n x n matrix and prove a conjecture of Polona Oblak which…
We refine a method for finding a canonical form for symmetry operators of arbitrary order for the Schroedinger eigenvalue equation on any 2D Riemannian manifold, real or complex, that admits a separation of variables in some orthogonal…
This paper considers submodular function minimization (SFM) restricted to a family of subsets. We show that SFM over complements of families with certain hierarchical structures can be solved in polynomial-time. This yields a…
We give a brief overview of a simple and unified way, called the prepotential approach, to treat both exact and quasi-exact solvabilities of the one-dimensional Schr\"odinger equation. It is based on the prepotential together with Bethe…
The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…
Clustering with most objective functions is NP-Hard, even to approximate well in the worst case. Recently, there has been work on exploring different notions of stability which lend structure to the problem. The notion of stability,…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
We extend recent work by Tremblay, Turbiner, and Winternitz which analyzes an infinite family of solvable and integrable quantum systems in the plane, indexed by the positive parameter k. Key components of their analysis were to demonstrate…
Mahler equations arise in a wide range of contexts including the study of finite automata, regular sequences, algebraic series over Fp(z), and periods of Drinfeld modules. Introduced a century ago by K. Mahler to study the transcendence of…
We study modular theory in hyperfinite von Neumann algebras, i.e. in those of type II or type III, from the viewpoint of a subregion charge sector decomposition. We address this symmetry resolution by considering infinite tensor products of…
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NP-complete problems. In this paper we study a new approach to quantum algorithm…
A roadmap for a semi-algebraic set $S$ is a curve which has a non-empty and connected intersection with all connected components of $S$. Hence, this kind of object, introduced by Canny, can be used to answer connectivity queries (with…
We revisit the MIC-harmonic oscillator in flat space with monopole interaction and derive the polynomial algebra satisfied by the integrals of motion and its energy spectrum using the ad hoc recurrence approach. We introduce a…
In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup of square matrices of size $k \times k$ with non-negative…
It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kampen diagrams, which represent groups as quotients of…