Related papers: Corrigendum for "Almost vanishing polynomials and …

I withdraw my paper from arXiv because there is a technical error in the proof of Theorem 1.1. And because of this error, all the results in the paper are untrue. I am very sorry for this.

In this paper, we introduce a novel a posteriori error estimator for the conforming finite element approximation to the H(curl) problem with inhomogeneous media and with the right-hand side only in L^2. The estimator is of the recovery…

We correct an error in the second part of Theorem 3 of our original paper (arXiv:1512.07161).

This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). This paper shows that P…

In this paper we are concerned with the vanishing of $\textnormal{Tor}$ over complete intersection rings. Building on results of C. Huneke, D. Jorgensen and R. Wiegand, and, more recently, H. Dao, we obtain new results showing that good…

Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…

The preliminary material of the monograph (arXiv:1607.03852) written by the first two authors contains two major imprecisions that necessitates a number of (in the end harmless) changes throughout the entire text. One is about…

Let $P$ be a polynomial that depends on two variables $X$ and $Y$ and has algebraic coefficients. If $x$ and $y$ are algebraic numbers with $P(x,y)=0$, then by work of N\'eron $h(x)/q$ is asymptotically equal to $h(y)/p$ where $p$ and $q$…

Recently Hashemi and Kapur published an algorithm [1] for Groebner basis conversion by truncating polynomials according to a source and a target monomial order. Here we present a counterexample to this algorithm.

This paper has been withdrawn by the authors, due to a flaw in the proof of Theorem 1. This preprint is superseded by quant-ph/0610027, where a correct proof can be found. Thanks to Rainer Siegmund-Schultze for spotting the error.

In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thom{\'e}, a quasi-polynomial time algorithm (QPA) is proposed for the discrete logarithm problem over finite fields of small characteristic. The time complexity analysis of…

We consider Hilbert-type functions associated with difference (not necessarily inversive) field extensions and systems of algebraic difference equations in the case when the translations are assigned some integer weights. We will show that…

For more than a century and a half it has been widely-believed (but was never rigorously shown) that the physics of diffraction imposes certain fundamental limits on the resolution of an optical system. However our understanding of what…

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

In this correspondence, it is given a correction to Theorem 4 in Y. Hu, and G. Xiao, "Generalized Self-Shrinking Generator," IEEE Transactions on Information Theory, vol. 50, No. 4, pp. 714-719, April 2004.

This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…

The construction of link polynomials associated with finite dimensional representations of ribbon quasi-Hopf algebras is discussed in terms of the formulation of an appropriate Markov trace. We then show that this Markov trace is invariant…

We describe some examples of classical and explicit h-transforms as particular cases of a general mechanism, which is related to the existence of symmetric diffusion operators having orthogonal polynomials as spectral decomposition.

We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…

In this paper, a detrimental mathematical mistake is pointed out in the proof of \textit{Theorem 1} presented in the paper\textit{ [Generalization of the gradient method with fractional order gradient direction, J. Franklin Inst., 357…