Related papers: A correct proof of the heuristic GCD algorithm
Some errors contained in the author's previous article "An example of Bautin-type bifurcation in a delay differential equation", JMAA, 329(2007), 777-789, are listed and corrected. Original abstract: In a previous paper we gave sufficient…
We show that the equations underlying the $GW$ approximation have a large number of solutions. This raises the question: which is the physical solution? We provide two theorems which explain why the methods currently in use do, in fact,…
The seminal book of Gusfield and Irving [GI89] provides a compact and algorithmically useful way to represent the collection of stable matches corresponding to a given set of preferences. In this paper, we reinterpret the main results of…
This note contains a new combinatorial proof of Cramer's rule based on the Gessel-Viennot-Lindstrom Lemma.
In this note we document a gap in an argument in the above paper, and point to new work in the literature giving a complete proof of the main result.
We present an elementary and explicit proof of the separability criterion for continuous variable two-party Gaussian systems. Our proof is based on an elementary formulation of uncertainty relations and an explicit determination of…
We provide an explanation of the main ideas underlying G\"otze's main result in using Stein's method. We also provide detailed derivations of various intermediate estimates. Curiously, we are led to a different dimensional dependence of the…
We study here several variants of the covariates fine balance problem where we generalize some of these problems and introduce a number of others. We present here a comprehensive complexity study of the covariates problems providing…
We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded…
By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.
The article derives multivariate Generalized Gram-Charlier (GGC) series that expands an unknown joint probability density function (\textit{pdf}) of a random vector in terms of the differentiations of the joint \textit{pdf} of a reference…
The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].
I present the proof of Goedel's First Incompleteness theorem in an intuitive manner, while covering all technically challenging steps. I present generalizations of Goedel's fixed point lemma to two-sentence and multi-sentence versions,…
If $G$ is a bipartite graph, Hall's theorem \cite{H35} gives a condition for the existence of a matching of $G$ covering one side of the bipartition. This theorem admits a well-known algorithmic proof involving the repeated search of…
This paper develops a bias correction scheme for a multivariate heteroskedastic errors-in-variables model. The applicability of this model is justified in areas such as astrophysics, epidemiology and analytical chemistry, where the…
I analyse the frequentist regret of the famous Gittins index strategy for multi-armed bandits with Gaussian noise and a finite horizon. Remarkably it turns out that this approach leads to finite-time regret guarantees comparable to those…
In this paper, we address the normal mean inference problem, which involves testing multiple means of normal random variables with heteroscedastic variances. Most existing empirical Bayes methods for this setting are developed under…
We consider an algorithm by Tijdeman and Zamboni constructing a word of a given length that has a given set of periods, and the richest possible alphabet. We show that this algorithm can be easily stated and its correctness briefly proved…
A new viewpoint of the G\"odel's incompleteness theorem be given in this article which reveals the deep relationship between the logic and computation. Upon the results of these studies, an algorithm be given which shows how to search a…
Based on the work of Romano and Shaikh (2006) and Lehmann and Romano (2005) we give a sufficient criterion for controlling generalised error rates for arbitrarily dependent p-values. This criterion is formulated in terms of matrices…