Related papers: Hilbert quasi-polynomial for order domains and app…
Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…
Well-quasi orders such as homeomorphic embedding are commonly used to ensure termination of program analysis and program transformation, in particular supercompilation. We compare eight well-quasi orders on how discriminative they are and…
Many physical systems can be adequately modelled using a second order approximation. The problem of plant identification reduces to the problem of estimating the position of a single pair of complex conjugate poles. One approach to the…
We devise and analyze hybrid polyhedral methods of arbitrary order for the approximation of div-curl systems on three-dimensional domains featuring non-trivial topology. The div-curl systems we are interested in stem from magnetostatics,…
In this paper we give an effective characterization of Hilbert functions and polynomials of standard algebras over an Artinian equicharacteristic local ring; the cohomological properties of such algebras are also studied. We describe…
The article is devoted to the study of mappings that satisfy the so-called inverse Poletsky inequality. We consider mappings of quasiextremal distance domains, domains with a locally quasiconformal boundary, and domains which are regular in…
This paper presents some new propositions related to the fractional order $h$-difference operators, for the case of general quadratic forms and for the polynomial type, which allow proving the stability of fractional order $h$-difference…
We give a description of biholomorphisms of quasi-Reinhardt domains fixing the origin via Bergman representative coordinates, which are shown to be polynomial mappings with a degree bound given by the so-called "resonance order".
We present a new algorithm by which the Adomian polynomials can be determined for scalar-valued nonlinear polynomial functional in a Hilbert space. This algorithm calculates the Adomian polynomials without the complicated operations such as…
In this paper, we will investigate the jet schemes of determinantal varieties. It is quite often the case that the geometric information concerning the jet schemes of an algebraic variety can be described, but the more refined algebraic…
Algebraic and analytic aspects of self-adjoint operators of order four or more with polynomial coefficients are investigated. As a consequence, a systematic way of constructing such operators is given. The procedure is applied to obtain…
Presented here is a matrix inversion method utilizing quantum searching algorithm. In this method, huge Hilbert space as a whole spanned by myriad of eigen states is searched and evaluated efficiently by sequential reduction in dimension…
Hybrid High-Order methods for elliptic diffusion problems have been originally formulated for loads in the Lebesgue space $L^2(\Omega)$. In this paper we devise and analyze a variant thereof, which is defined for any load in the dual…
In this paper it is shown that higher order quasiconvex functions suitable in the variational treatment of problems involving second derivatives may be extended to the space of all matrices as classical quasiconvex functions. Precisely, it…
We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the…
In this paper, we introduce a new family of codes relevent for rank and sum-rank metrics. These codes are based on an effective Chinese remainders theorem for linearized polynomials over finite fields. We propose a decoding algorithm for…
Partial orders are used extensively for modeling and analyzing concurrent computations. In this paper, we define two properties of partially ordered sets: width-extensibility and interleaving-consistency, and show that a partial order can…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem…
We give an algorithm for the class of second order unification problems in which second order variables have at most one occurrence.