Related papers: Algorithms in the classical N\'eron Desingularizat…
We construct a desingularization of the ``main component'' $\bar{\mathfrak M}_{1,k}^0(\Bbb{P}^n,d)$ of the moduli space $\bar{\mathfrak M}_{1,k}(\Bbb{P}^n,d)$ of genus-one stable maps into the complex projective space $\Bbb{P}^n$. As a…
The rigorous approach aimed at providing exact analytical results for hybrid classical-quantum models is elaborated on the grounds of generalized algebraic mapping transformations. This conceptually simple method allows one to obtain novel…
In this work, we generalize the integer enumeration basis. We also construct bijections between the elements of special sets and the elements of some groups, and treat the special case of the hyperoctohedral groups. Then, we find a code…
This paper presents some algorithmic techniques to compute explicitly the noetherian operators associated to a class of ideals and modules over a polynomial ring. The procedures we include in this work can be easily encoded in computer…
Matching is a method of the design of experiments. If we had an even number of patients and wanted to form pairs of patients such that their ages, for example, in each pair be as close as possible, we would use nonbipartite matching. Not…
A simple and natural Gao algorithm for decoding algebraic codes is described. Its relation to the Welch-Berlekamp and Euclidean algorithms is given.
We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in…
We present a simple yet powerful technique for forming iterative methods of various convergence orders. Methods of various convergence orders (four, six, eight and ten) are formed through a modest modification of the classical Newton…
A promising approach to achieve computational supremacy over the classical von Neumann architecture explores classical and quantum hardware as Ising machines. The minimisation of the Ising Hamiltonian is known to be NP-hard problem for…
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…
We present two algorithms for computing what we call the absolute factorization of a difference operator. We also give an algorithm to solve third order difference equations in terms of second order equations, together with applications to…
We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…
Using the notion of generalized weight we improve estimates on the parameters of quantum codes obtained by Steane's construction from binary codes. This yields several new families of quantum codes.
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box, but the aim is to compute function value for arbitrary input using as few queries as possible. In this paper we…
Quantum algorithm is constructed which verifies the formulas of predicate calculus in time $O(\sqrt N)$ with bounded error probability, where $N$ is the time required for classical algorithms. This algorithm uses the polynomial number of…
A simple algorithm to compute all the zeros of a generic polynomial is proposed.
E-generalization computes common generalizations of given ground terms w.r.t. a given equational background theory E. In 2005 [arXiv:1403.8118], we had presented a computation approach based on standard regular tree grammar algorithms, and…
A simple position probability density formulation is presented for the motion of a particle in a spherically symmetric potential. The approach provides an alternative to Newtonian methods for presentation in an elementary course, and…
Tensor expression simplification is an "ancient" topic in computer algebra, a representative of which is the canonicalization of Riemann tensor polynomials. Practically fast algorithms exist for monoterm canonicalization, but not for…
In this paper, we show that a result precisely analogous to the traditional quantum no-cloning theorem holds in classical mechanics. This classical no-cloning theorem does not prohibit classical cloning, we argue, because it is based on a…