Related papers: A deterministic algorithm for Harder-Narasimhan fi…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
In this article, we study the notion of semi-stability and the Harder-Narasimhan filtration from a game-theoretic point of view. This allows us to provide a unified proof for the existence and uniqueness of the Harder-Narasimhan filtration…
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…
A fundamental challenge in multiparameter persistent homology is the absence of a complete and discrete invariant. To address this issue, we propose an enhanced framework that realizes a holistic understanding of a fully commutative…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
We give an algorithm to solve the quantum hidden subgroup problem for maximal cyclic non-normal subgroups of the affine group of a finite field (if the field has order $q$ then the group has order $q(q-1)$) with probability $1-\varepsilon$…
In this thesis we study the relationship between the existence of canonical metrics on a complex manifold and stability in the sense of geometric invariant theory. We introduce a modification of K-stability of a polarised variety which we…
Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…
We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As particular examples, we explicitly give representatives of all equivalence classes of linear determinantal…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…
This survey intends to present the basic notions of Geometric Invariant Theory (GIT) through its paradigmatic application in the construction of the moduli space of holomorphic vector bundles. Special attention is paid to the notion of…
We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of $\mathcal…
We show how to construct in an elementary way the invariant of the KHK discretisation of a cubic Hamiltonian system in two dimensions. That is, we show that this invariant is expressible as the product of the ratios of affine polynomials…
We propose a generalization of Quillen's exact category -- arithmetic exact category and we discuss conditions on such categories under which one can establish the notion of Harder-Narasimhan filtrations and Harder-Narsimhan polygons.…
In this paper, we study high-dimensional nonlinear quantum harmonic oscillator equation. We show the equation admits many time quasi-periodic solutions by establishing an abstract infinite dimensional KAM theorem with multiple normal…
Machine learning (ML) has emerged as a powerful tool in mathematical research in recent years. This paper applies ML techniques to the study of quivers -- a type of directed multigraph with significant relevance in algebra, combinatorics,…
We study a collection of stability conditions (in the sense of Schmitt) for complexes of sheaves over a smooth complex projective variety indexed by a positive rational parameter. We show that the Harder-Narasimhan filtration of a complex…
Algebraic Nahm equations, considered in the paper, are polynomial equations, governing the $q\rightarrow 1$ limit of the $q$-hypergeometric Nahm sums. They make an appearance in various fields: hyperbolic geometry, knot theory, quiver…
We propose a simple iterative algorithm to construct the optimal multi-configuration approximation of an $N$-fermion wave function. That is, $M\geq N $ single-particle orbitals are sought iteratively so that the projection of the given wave…
In this article, we give an explicit construction of the derived moduli stack of Harder-Narasimhan filtrations on a connected projective scheme over an algebraically closed field k of characteristic 0 by using methods by Behrend,…