相关论文: Stronger bounds on the cost of computing Groebner …
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y} to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner…
The paper deals with planar polynomial vector fields. We aim to estimate the number of orbital topological equivalence classes for the fields of degree n. An evident obstacle for this is the second part of Hilbert's 16th problem. To…
The efficiency of Gr\"obner basis computation, the standard engine for solving systems of polynomial equations, depends on the choice of monomial ordering. Despite a near-continuum of possible monomial orders, most implementations rely on…
In this paper, we show exponential lower bounds for the class of homogeneous depth-$5$ circuits over all small finite fields. More formally, we show that there is an explicit family $\{P_d : d \in \mathbb{N}\}$ of polynomials in…
Fully homomorphic encryption (FHE) allows an untrusted party to evaluate arithmetic cir- cuits, i.e., perform additions and multiplications on encrypted data, without having the decryp- tion key. One of the most efficient class of FHE…
We obtain effective bounds on the heights of algebraic integers whose orbits contain multiplicatively dependent values modulo S-integers. Our method is based on a new upper bound on the so-called S-height of polynomial values over the ring…
The Rank metric decoding problem is the main problem considered in cryptography based on codes in the rank metric. Very efficient schemes based on this problem or quasi-cyclic versions of it have been proposed recently, such as those in the…
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a novel way to compute a lower bound on the positive real…
We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…
Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…
The problem of solving partial differential equations (PDEs) on manifolds can be considered to be one of the most general problem formulations encountered in computational multi-physics. The required covariant forms of balance laws as well…
We study the problem of placing effective upper bounds for the number of zeros of solutions of Fuchsian systems on the Riemann sphere. The principal result is an explicit (non-uniform) upper bound, polynomially growing on the frontier of…
We establish new hardness results for decision tree optimization problems, adding to a line of work that dates back to Hyafil and Rivest in 1976. We prove, under randomized ETH, superpolynomial lower bounds for two basic problems: given an…
The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…
Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special,…
Prime-based ordering which is proved to be admissible, is the encoding of indeterminates in power-products with prime numbers and ordering them by using the natural number order. Using Eiffel, four versions of Buchberger's improved…
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
A high-order numerical method is developed for solving the Cahn-Hilliard-Navier-Stokes equations with the Flory-Huggins potential. The scheme is based on the $Q_k$ finite element with mass lumping on rectangular grids, the second-order…
Binary field extensions are fundamental to many applications, such as multivariate public key cryptography, code-based cryptography, and error-correcting codes. Their implementation requires a foundation in number theory and algebraic…