相关论文: A correct proof of the heuristic GCD algorithm
A rather easy yet rigorous proof of a version of G\"odel's first incompleteness theorem is presented. The version is "each recursively enumerable theory of natural numbers with 0, 1, +, *, =, logical and, logical not, and the universal…
This reply is in response to commentaries by Barnett, Barrett, and Seth (arXiv:1708.08001) and Faes, Stramaglia, and Marinazzo (arXiv:1708.06990) on our paper entitled "A study of problems encountered in Granger causality analysis from a…
The purpose of this note is to advertise an elegant algorithmic proof for the Jordan--Chevalley decomposition of a matrix, following and (slightly) revising the discussion of Couty, Esterle und Zarouf (2011). The basic idea of that method…
We propose a new algorithm solving the extended gcd problem, which provides a solution minimizing one of the two coordinates. The algorithm relies on elementary arithmetic properties.
In this paper, we present a new approach which qualifies or not a solution found by a heuristic as a potential optimal solution. Our approach is based on the following observation: for a minimization problem, the number of admissible…
We present a novel greedy Gauss-Seidel method for solving large linear least squares problem. This method improves the greedy randomized coordinate descent (GRCD) method proposed recently by Bai and Wu [Bai ZZ, and Wu WT. On greedy…
A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…
This note presents some numerical examples worked out in order to show the reader how to implement, within a widely accessible computational setting, the methodology for achieving zero cancellation in linear multivariable systems discussed…
A conjectural expression of the asymptotic gap between the rate-distortion function of an arbitrary generalized Gaussian multiterminal source coding system and that of its centralized counterpart in the high-resolution regime is proposed.…
This paper provides a closed form expression for the pairwise score vector for the multivariate ordered probit model. This result has several implications in likelihood-based inference. It is indeed used both to speed-up gradient based…
In this note we improve the parameter $q$ that appears in Theorem 1 obtained by the author in [Math. Ineq. \& appl., Vol 19 (3) (2016), 1013-1030].
In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…
This document serves as a companion to the paper of the same title, wherein we introduce a Gentzen-style sequent calculus for HXPathD. It provides full technical details and proofs from the main paper. As such, it is intended as a reference…
Greatest Common Divisor (GCD) computation is one of the most important operation of algorithmic number theory. In this paper we present the algorithms for GCD computation of $n$ integers. We extend the Euclid's algorithm and binary GCD…
We present a quantum algorithm solving the greatest common divisor (GCD) problem. This quantum algorithm possesses similar computational complexity with classical algorithms, such as the well-known Euclidean algorithm for GCD. This…
We state and prove a correct version of a theorem presented in an earlier paper.
In the paper [Muhammad Aslam Noor, Khalida Inayat Noor, Three-step iterative methods for nonlinear equations, Applied Mathematics and Computation, 183 (2006), pp. 322-327 ], Authors presented an algorithm (\textbf{Algorithm 2.3}) and stated…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
We propose a method for filling arbitrarily wide gaps in deterministic time series. Crucial to the method is the ability to apply Takens' theorem in order to reconstruct the dynamics underlying the time series. We introduce a functional to…
In the paper Factorisation of division polynomials (H. Verdure, Proc. japan Academy, Ser A. 80 n. 5), Verdure gives the factorisation patterns of division polynomials of elliptic curves defined over a finite field. However, the result given…