相关论文: A constructive algorithm for the Cartan decomposit…

The problem of polynomial regression in which the usual monomial basis is replaced by the Bernstein basis is considered. The coefficient matrix A of the overdetermined system to be solved in the least squares sense is then a rectangular…

We apply the new method for constructing integrable Hamiltonian hierarchies of Lax type equations developed in our previous paper, to show that all W-algebras W(gl_N,f) carry such a hierarchy. As an application, we show that all vector…

We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…

The aim of the paper is to demonstrate the superiority of Cartan's method over direct methods based on differential elimination for handling otherwise intractable equivalence problems. In this sens, using our implementation of Cartan's…

We introduce the notion of set-decomposition of a normal G-flat chain. We show that any normal rectifiable $G$-flat chain admits a decomposition in set-indecomposable sub-chains. This generalizes the decomposition of sets of finite…

In this note, we show that the decomposition group $Dec(I)$ of a zero-dimensional radical ideal $I$ in ${\bf K}[x_1,\ldots,x_n]$ can be represented as the direct sum of several symmetric groups of polynomials based upon using Gr\"{o}bner…

Construction of superintegrable systems based on Lie algebras have been introduced over the years. However, these approaches depend on explicit realisations, for instance as a differential operators, of the underlying Lie algebra. This is…

Let U be the tautological subbundle on the Grassmannian $\mathrm{Gr}(k, n)$. There is a natural morphism $\mathrm{Tot}(U) \to \mathbb{A}^n$. Using it, we give a semiorthogonal decomposition for the bounded derived category…

An important problem in computational arithmetic geometry is to find changes of coordinates to simplify a system of polynomial equations with rational coefficients. This is tackled by a combination of two techniques, called minimisation and…

Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…

Let $G$ be a finite reductive group defined over $\mathbb{F}_q$, with $q$ a power of a prime $p$. Motivated by a problem recently posed by C. Curtis, we first develop an algorithm to express each element of $G$ into a canonical form in…

Let $Y=\{f(x,y)=0\}$ be the germ of an irreducible plane curve. We present an algorithm to obtain polynomials, whose valuations coincide with the semigroup generators of $Y$. These polynomials are obtained sequentially, adding terms to the…

Given an n x n matrix A, we present a simple, element-wise sparsification algorithm that zeroes out all sufficiently small elements of A and then retains some of the remaining elements with probabilities proportional to the square of their…

For all n > 0 there is a homomorphism from the smooth concordance group of knots in dimension 2n + 1 to an algebraically defined group called the rational algebraic concordance group. This algebraic concordance group splits as a direct sum…

The Cartan control problem of the quantum circuits discussed from the differential geometry point of view. Abstract unitary transformations of $SU(2^n)$ are realized physically in the projective Hilbert state space $CP(2^n-1)$ of the…

Boson realizations map operators and states of groups to transformations and states of bosonic systems. We devise a graph-theoretic algorithm to construct the boson realizations of the canonical SU$(n)$ basis states, which reduce the…

In the 3rd episode of the serial exposition, quotient algebra partitions of rank zero earlier introduced undergo further partitions generated by bi-subalgebras of higher ranks. The refined versions of quotient algebra partitions admit not…

In this paper, we introduce an $N\times N$ matrix $\epsilon^{a\bar{b}}$ in the quantum groups $SU_{q}(N)$ to transform the conjugate representation into the standard form so that we are able to compute the explicit forms of the important…

We present efficient algorithms to calculate the color factors for the $SU(N)$ gauge group and to evaluate $\gamma$ traces. The aim of these notes is to give a self-contained, proved account of the basic results with particular emphasis on…

We describe a new method to compute general cubature formulae. The problem is initially transformed into the computation of truncated Hankel operators with flat extensions. We then analyse the algebraic properties associated to flat…