Related papers: About Gordan's algorithm for binary forms
In this paper we develop the formalism of the Grothendieck six operations on o-minimal sheaves. The Grothendieck formalism allows us to obtain o-minimal versions of: (i) derived projection formula; (ii) universal coefficient formula; (iii)…
The covariantization procedure is usually referred to the translation operator, that is the derivative. Here we introduce a general method to covariantize arbitrary differential operators, such as the ones defining the fundamental group of…
The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is of significant interest to describe it in the most efficient mathematical formalism. We show firstly, that Clifford's formalism…
The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…
We calculate the degree of the algebra of covariants $\mathcal{C}_d$ for binary $d$-form. Also, for the degree we obtain its integral representation and asymptotic behavior.
In this paper we study a geometric coding algorithm for indefinite binary quadratic forms Q for the congruence subgroup \Gamma^0(N), with respect to the usual fundamental domain FN, where N is assumed prime. The cycles Q_1, . . ., Q_n that…
We associate a bivariant theory to any suitable oriented Borel-Moore homology theory on the category of algebraic schemes or the category of algebraic G-schemes. Applying this to the theory of algebraic cobordism yields operational…
In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of…
We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach allows us to derive fundamental aspects of the theory of Riordan arrays as immediate consequences of the umbral version of the classical…
We obtain a combinatorial formula related to the shear transformation for semi-invariants of binary forms, which implies the classical characterization of semi-invariants in terms of a differential operator. Then, we present a combinatorial…
The efficiency of top-K item recommendation based on implicit feedback are vital to recommender systems in real world, but it is very challenging due to the lack of negative samples and the large number of candidate items. To address the…
This paper stands at the intersection of two distinct lines of research. One line is "holographic algorithms," a powerful approach introduced by Valiant for solving various counting problems in computer science; the other is "normal factor…
In this paper, the author present reliable symbolic algorithms for solving a general bordered tridiagonal linear system. The first algorithm is based on the LU decomposition of the coefficient matrix and the computational cost of it is…
In this paper, we describe a method for obtaining the nonabelian Seiberg-Witten map for any gauge group and to any order in theta. The equations defining the Seiberg-Witten map are expressed using a coboundary operator, so that they can be…
We develop a new algorithm to compute a basis for $M_k(\Gamma_0(N))$, the space of weight $k$ holomorphic modular forms on $\Gamma_0(N)$, in the case when the graded algebra of modular forms over $\Gamma_0(N)$ is generated at weight two.…
We present a variation of a quantum algorithm for the machine learning task of classification with graph-structured data. The algorithm implements a feature extraction strategy that is based on Gaussian boson sampling (GBS) a near term…
We consider the question of determining whether two binary cubic forms over an arbitrary field $K$ whose characteristic is not $2$ or $3$ are equivalent under the actions of either GL$(2,K)$ or SL$(2,K)$, deriving two necessary and…
Given a finitely presented group $G$, Hopf's formula expresses the second integral homology of $G$ in terms of generators and relators. We give an algorithm that exploits Hopf's formula to estimate $H_2(G;k)$, with coefficients in a finite…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
This is the second paper in the series to introduce a graphical method to loop quantum gravity. We employ the graphical method as a powerful tool to calculate the actions of the Euclidean Hamiltonian constraint operator and the so-called…