Related papers: On Kronecker's Solvability Theorem
This note was prepared as a handout for the MAT401 course ``Polynomial equations and fields", taught at the University of Toronto in Spring 2026. It presents a proof of a necessary condition for the solvability of algebraic equations by…
Let $K$ be a field, and $A=K[a_1,\ldots ,a_n]$ a solvable polynomial algebra in the sense of [K-RW, {\it J. Symbolic Comput.}, 9(1990), 1--26]. Based on the Gr\"obner basis theory for $A$ and for free modules over $A$, an elimination theory…
On compact Riemannian manifolds, we prove a decomposition theorem for arbitrarily bounded energy sequence of solutions of a singular elliptic equation.
A general method based on the polynomial deformations of the Lie algebra sl(2,R) is proposed in order to exhibit the quasi-exactly solvability of specific Hamiltonians implied by quantum physical models. This method using the…
Given a Schubert variety $\mathcal{S}$ contained in a Grassmannian $\mathbb{G}_{k}(\mathbb{C}^{l})$, we show how to obtain further information on the direct summands of the derived pushforward $R \pi_{*} \mathbb{Q}_{\tilde{\mathcal{S}}}$…
We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…
In this paper, we systematically apply Grothendieck duality theorem to simplify the proofs of several theorems in different papers: Including a vanishing theorem in KMM, a theorem of Koll\'{a}r's paper, a vanishing theorem due to Kov\'{a}cs…
We prove a conjecture of Stembridge concerning stability of Kronecker coefficients that vastly generalizes Murnaghan's theorem. The main idea is to identify the sequences of Kronecker coefficients in question with Hilbert functions of…
We develop a higher order generalization of the LQ decomposition and show that this decomposition plays an important role in likelihood-based estimation and testing for separable, or Kronecker structured, covariance models, such as the…
This paper provides a general solution for the Kronecker product decomposition (KPD) of vectors, matrices, and hypermatrices. First, an algorithm, namely, monic decomposition algorithm (MDA), is reviewed. It consists of a set of projections…
For the solvable polynomial algebras introduced and studied by Kandri-Rody and Weispfenning [J. Symbolic Comput., 9(1990)], a constructive characterization is given in terms of Gr\"obner bases for ideals of free algebras, thereby solvable…
We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.
We show that the Hausdorffized algebraic K-theory of a C*-algebra decomposes naturally as a direct sum of the Hausdorffized unitary algebraic K-theory and the space of continuous affine functions on the trace simplex. Under mild regularity…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
In this short note, it is shown that there is a gap in the proof of Theorem 11 in the paper of Meyer and Neutsch (J. of Algebra, 1993). We prove, nevertheless, that the statement of the theorem is true and fix the proof by using a certain…
A nonlinear generalisation of Schrodinger's equation had previously been obtained using information-theoretic arguments. The nonlinearities in that equation were of a nonpolynomial form, equivalent to the occurence of higher-derivative…
The computation of Kronecker coefficients is a challenging problem with a variety of applications. In this paper we present an approach based on methods from symplectic geometry and residue calculus. We outline a general algorithm for the…
We analyze the decomposition problem of multivariate polynomial-exponential functions from truncated series and present new algorithms to compute their decomposition. Using the duality between polynomials and formal power series, we first…
In this work we proivied a new simpler proof of the global diffeomorphism theorem from [9] which we further apply to consider unique solvability of some abstract semilinear equations. Applications to the second order Dirichlet problem…
We give a new criterion for solvability of group equations, providing proofs of various generalizations of the Kervaire-Laudenbach conjecture for Connes-embeddable groups.