Related papers: A correct proof of the heuristic GCD algorithm

An extension of the Gaussian correlation conjecture (GCC) is proved for multivariate gamma distributions (in the sense of Krishnamoorthy and Parthasarathy). The classical GCC for Gaussian probability measures is obtained by the special case…

We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to multiple polynomial inputs. For a given pair of polynomials and a degree, our algorithm…

In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important heuristic developed by statistical physicists that has lead to…

We propose a modification of the GPGCD algorithm, which has been presented in our previous research, for calculating approximate greatest common divisor (GCD) of more than 2 univariate polynomials with real coefficients and a given degree.…

We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to polynomials with the complex coefficients. For a given pair of polynomials and a…

We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real or the complex coefficients. For a given pair of polynomials and a degree, our algorithm finds a pair of…

In this paper, we tackle the parametric complete multiplicity problem for a univariate polynomial. Our approach to the parametric complete multiplicity problem has a significant difference from the classical method, which relies on repeated…

In the paper [P. Achar, "On the equivariant $K$-theory of the nilpotent cone in the general linear group," Represent. Theory 8 (2004), 180-211], the author gave a combinatorial algorithm for computing the Lusztig-Vogan bijection for…

We introduce Generalized Integrated Gradients (GIG), a formal extension of the Integrated Gradients (IG) (Sundararajan et al., 2017) method for attributing credit to the input variables of a predictive model. GIG improves IG by explaining a…

In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over…

A simple heuristic proof of an integral identity recently derived (Glasser ML 2011 J. Phys. A: Math. Theor. 44 225202) is presented.

We present a short new proof of the canonical polynomial van der Waerden theorem, recently established by Girao [arXiv:2004.07766].

We fix a gap in the proof of a result in our earlier paper arXiv:1908.09548

We provide a correction to the expression for scoring Gaussian directed acyclic graphical models derived in Geiger and Heckerman [Ann. Statist. 30 (2002) 1414-1440] and discuss how to evaluate the score efficiently.

I provide the algorithm that solves the challenge proposed by Wm. G. Hoover and Carol G. Hoover in their recent paper "Time-Reversible Random Number Generators", arXiv:1305.0961, with an explanation on how to derive it analytically.

We provide a geometric proof of the Schubert calculus interpretation of the Horn conjecture, and show how the saturation conjecture follows from it. The geometric proof gives a strengthening of Horn and saturation conjectures. We also…

Considering the set cover problem, by modifying the approach that gives a logarithmic approximation guarantee for the greedy algorithm, we obtain an estimation of the greedy algorithm's accuracy for a particular input. We compare the…

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

In this article, we rigorously establish the consistency of generalized cross-validation as a parameter-choice rule for solving inverse problems. We prove that the index chosen by leave-one-out GCV achieves a non-asymptotic, order-optimal…

A notion of gcd chain has been introduced by the author at ISSAC 2017 for two univariate monic polynomials with coefficients in a ring R = k[x_1, ..., x_n ]/(T) where T is a primary triangular set of dimension zero. A complete algorithm to…