Related papers: Computing huge Groebner basis like cyclic10 over $…
We review Grover's algorithm by means of a detailed geometrical interpretation and a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are also reviewed. This work is intended for non-specialists which have…
Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…
Linear quasi-cyclic product codes over finite fields are investigated. Given the generating set in the form of a reduced Gr{\"o}bner basis of a quasi-cyclic component code and the generator polynomial of a second cyclic component code, an…
We give a detailed account of a combinatorial construction, due to Cherednik, of cyclic generators for irreducible modules of the affine Hecke algebra of the general linear group with generic parameter q.
We present a new algorithm for computing a truncated Markov basis of a lattice. In general, this new algorithm is faster than existing methods. We then extend this new algorithm so that it solves the linear integer feasibility problem with…
We present a survey on the developments related to Groebner bases, and show explicit examples in CoCoA. The CoCoA project dates back to 1987: its aim was to create a "mathematician"-friendly computational laboratory for studying Commutative…
The dynamic algorithm to compute a Gr\"obner basis is nearly twenty years old, yet it seems to have arrived stillborn; aside from two initial publications, there have been no published followups. One reason for this may be that, at first…
Over the past decade, the Gr\"obner basis theory and automatic solver generation have lead to a large number of solutions to geometric vision problems. In practically all cases, the derived solvers apply a fixed elimination template to…
As quantum computing technology advances, the complexity of quantum algorithms increases, necessitating a shift from low-level circuit descriptions to high-level programming paradigms. This paper addresses the challenges of developing a…
Quantum computers hold great promise to enhance machine learning, but their current qubit counts restrict the realisation of this promise. In an attempt to placate this limitation techniques can be applied for evaluating a quantum circuit…
In recent work, Darmon, Pozzi and Vonk explicitly construct a modular form whose spectral coefficients are $p$-adic logarithms of Gross-Stark units and Stark-Heegner points. Here we describe how this construction gives rise to a practical…
The large-beta_0 limit of QCD is discussed, with the emphasize on simple technical methods of calculating various quantities at the order 1/\beta_0. Many examples, mainly from heavy quark physics, are considered. Some QCD results based on…
Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Grobner bases algorithm is a well-known method to solve this problem. However, a serious drawback exists in the Grobner bases based…
Insa and Pauer presented a basic theory of Groebner basis for differential operators with coefficients in a commutative ring in 1998, and a criterion was proposed to determine if a set of differential operators is a Groebner basis. In this…
We give a presentation of cyclotomic q-Schur algebras by generators and defining relations. As an application, we give an algorithm for computing decomposition numbers of cyclotomic q-Schur algebras.
We reformulate a recently introduced interpolation-based unique decoding algorithm of algebraic geometry codes using the theory of Gr\"obner bases of modules on the coordinate ring of the base curve. With the same decoding performance, the…
In this paper, we present an algorithm to compute a basis of the space of algebraic modular forms on the maximal order of the definite quaternion algebra of discriminant $2$, and provide a database of such bases. One of our motivations is…
In this paper, we describe an algorithm for computing algebraic modular forms on compact inner forms of $\mathrm{GSp}_4$ over totally real number fields. By analogues of the Jacquet-Langlands correspondence for $\mathrm{GL}_2$, this…
We propose a systematic scheme for computing the variation of rearrangement operators arising in the recently developed spectral geometry on noncommutative tori and $\theta$-deformed Riemannian manifolds. It can be summarized as a category…
For a particular experimental design, there is interest in finding which polynomial models can be identified in the usual regression set up. The algebraic methods based on Groebner bases provide a systematic way of doing this. The algebraic…