Computing Roots of Polynomials over Function Fields of Curves
Related publications (66)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We show that, in a restricted range, the divisor function of integers in residue classes modulo a prime follows a Gaussian distribution, and a similar result for Hecke eigenvalues of classical holomorphic cusp forms. Furthermore, we obtain the joint distri ...
We show that the transcendence degree of a real function field over an arbitrary real base field is a strict lower bound for its Pythagoras number and a weak lower bound for all its higher Pythagoras numbers. ...
Let B-M : C x C -> C be a bilinear form B-M(p, q) - p(T)Mq, with an invertible matrix M is an element of C-2x2. We prove that any finite set S contained in an irreducible algebraic curve C of degree d in C determines Omega(d)(vertical bar S vertical bar(4/ ...
We state conditions under which the set S(k) of k-rational points on a del Pezzo surface S of degree 1 over an infinite field k of characteristic not equal to 2 or 3 is Zariski dense. For example, it suffices to require that the elliptic fibration S -> P-1 ...
Our motivation is the design of efficient algorithms to process closed curves represented by basis functions or wavelets. To that end, we introduce an inner-product calculus to evaluate correlations and L2 distances between such curves. In partic ...
We consider the problem of sampling at unknown locations. We prove that, in this setting, if we take arbitrarily many samples of a polynomial or real bandlimited signal, it is possible to find another function in the same class, arbitrarily far away from t ...
Formal verification utilizing symbolic computer algebra has demonstrated the ability to formally verify large Galois field arithmetic circuits and basic architectures of integer arithmetic circuits. The technique models the circuit as Gröbner basis polynom ...
The article begins with a quantitative version of the martingale central limit theorem, in terms of the Kantorovich distance. This result is then used in the study of the homogenization of discrete parabolic equations with random i.i.d. coefficients. For s ...
We establish exponential convergence of the hp-version of isogeometric analysis for second order elliptic problems in one spacial dimension. Specifically, we construct, for functions which are piecewise analytic with a finite number of algebraic singularit ...
Novel memory-efficient Arnoldi algorithms for solving matrix polynomial eigenvalue problems are presented. More specifically, we consider the case of matrix polynomials expressed in the Chebyshev basis, which is often numerically more appropriate than the ...