相关论文: A correct proof of the heuristic GCD algorithm

The author in [7] was proved the generalized remainder and quotient theorems of polynomial in one indeterminate where the divisor is complete factorization to linear factors. In this paper we give the formula for the generalized remainder…

Generalized Chinese Remainder Theorem (CRT) has been shown to be a powerful approach to solve the ambiguity resolution problem. However, with its close relationship to number theory, study in this area is mainly from a coding theory…

Coherent errors in quantum operations are ubiquitous. Whether arising from spurious environmental couplings or errors in control fields, such errors can accumulate rapidly and degrade the performance of a quantum circuit significantly more…

Using the description of the category of quasi-coherent sheaves on a root stack given in the paper of N. Borne and A. Vistoli, we study the G-theory of root stacks via localisation methods. We apply our results to the study of equivariant…

In this article, we present a short, non-exhaustive study of an important and well-known property of combinatorial sequences - unimodality. We shall have a look at a sample of classical results on unimodality and related properties, and…

We present a new geometric proof of Pieri's formula, exhibiting an explicit chain of rational equivalences from a suitable sum of distinct Schubert varieties to the intersection of a Schubert variety with a special Schubert variety. The…

French translation, by Henri Lombardi and Stefan Neuwirth, of the article "Did Euclid need the Euclidean algorithm to prove unique factorization?", American Mathematical Monthly 113 (2006), pages 196-205.

In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path…

In this short note we have proved an enhanced version of a theorem of Lorentz [1] and its generalization to the multivariate case which gives a non- uniform estimate of degree of approximation by a polynomial with positive coefficients. The…

Methods are described for the solution of linear inference problems subject to deterministic constraints. The approach builds on work by Backus (1970a,b,c) and Parker (1977), but a range useful advances are suggested to address both…

The paper by G. Liu [arxiv:2109.02561] contains an error. In this note, I give a brief review of the problem and indicate what the error is.

An elementary proof of the attainability of random coding exponent with linear codes for additive channels is presented. The result and proof are from Hamada (Proc. ITW, Chendu, China, 2006), and the present material explains the proof in…

In this methodological article on experimental-yet-rigorous enumerative combinatorics, we use two instructive case studies, to show that often, just like Alexander the Great before us, the simple, "cheating" solution to a hard problem is…

A detailed and rigorous analysis of G\"odel's proof of his first incompleteness theorem is presented. The purpose of this analysis is two-fold. The first is to reveal what G\"odel actually proved to provide a clear and solid foundation upon…

In 1990 Lazard proposed an improved projection operation for cylindrical algebraic decomposition (CAD). For the proof he introduced a certain notion of valuation of a multivariate Puiseux series at a point. However a gap in one of the key…

In this paper, we derive a valid Edgeworth expansions for the Bessel corrected empirical variance when data are generated by a strongly mixing process whose distribution can be arbitrarily. The constraint of strongly mixing process makes…

We provide a sound and relatively complete Hoare-like proof system for reasoning about partial correctness of recursive procedures in presence of local variables and the call-by-value parameter mechanism, and in which the correctness proofs…

In this work, we introduce a novel variant of the multivariate quadratic problem, which is at the core of one of the most promising post-quantum alternatives: multivariate cryptography. In this variant, the solution of a given multivariate…

This paper presents a theory of error in cross-validation testing of algorithms for predicting real-valued attributes. The theory justifies the claim that predicting real-valued attributes requires balancing the conflicting demands of…

We give simple necessary and sufficient conditions for the $\frac{\partial}{\partial t}$-transcendence of the solutions to a parameterized second order linear differential equation of the form \frac{\partial^2 Y}{\partial x^2} - p…