Related papers: Hilbert quasi-polynomial for order domains and app…
A quasi-ordinary polynomial is a monic polynomial with coefficients in the power series ring such that its discriminant equals a monomial up to unit. In this paper we study higher derivatives of quasi-ordinary polynomials, also called…
In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main result gives a quasi-polynomial heuristic complexity for the…
In this paper, we introduce the notion of a $w$-Hilbert domain and investigate its basic properties. More precisely, we explore its relationship with Hilbert domains, strong Mori domains, and UMT domains by providing various examples using…
We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…
Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of…
We describe families of nonassociative finite unital rings that occur as quotients of natural nonassociative orders in generalized nonassociative cyclic division algebras over number fields. These natural orders have already been used to…
We investigate the roots of Hilbert quasipolynomials arising from certain rational generating functions.
We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…
We propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speedup of the decoding process of Bose-Chaudhuri-Hocquenghem, Reed-Solomon, and some other error-correcting codes.
In this paper, in terms of three types of generalized second-order derivatives of a nonsmooth function, we mainly study the corresponding second-order optimality conditions in a Hilbert space and prove the equivalence among these optimality…
We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an explicit form of the Chinese Remainder Theorem. Under the Generalized Riemann Hypothesis, the algorithm uses…
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
Let $\cl{M}$ be a Hilbert module of holomorphic functions over a natural function algebra $\mathcal{A}(\Omega)$, where $\Omega \subseteq \bb{C}^m$ is a bounded domain. Let $\cl{M}_0\subseteq \cl{M}$ be the submodule of functions vanishing…
Many existing algorithms for model checking of infinite-state systems operate on constraints which are used to represent (potentially infinite) sets of states. A general powerful technique which can be employed for proving termination of…
In this paper, we analyze the algebraic invariants for two classes of multivariate quadratic systems: systems made by OV quadratic polynomials and systems made by both OV polynomials and fully quadratic ones. For such systems, we explicitly…
We introduce symmetrizing operators of the polynomial ring $A[x]$ in the varible $x$ over a ring $A$. When $A$ is an algebra over a field $k$ these operators are used to characterize the monic polynomials $F(x)$ of degree $n$ in $A[x]$ such…
Algorithms are proposed for the computation of set-valued quantiles and the values of the lower cone distribution function for bivariate data sets. These new objects make data analysis possible involving an order relation for the data…
A second-order differential (q-difference) eigenvalue equation is constructed whose solutions are generating functions of the dual (q-)Hahn polynomials. The fact is noticed that these generating functions are reduced to the (little…