Computing roots of polynomials over function fields of curves
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
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 ...
In this paper we give a new proof of the ELSV formula. First, we refine an argument of Okounkov and Pandharipande in order to prove (quasi-)polynomiality of Hurwitz numbers without using the ELSV formula (the only way to do that before used the ELSV formul ...
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 ...
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 presence of focus-focus singularities in semi-toric integrables Hamiltonian systems is one of the reasons why there cannot exist global Action-Angle coordinates on such systems. At focus-focus critical points, the Liouville-Arnold-Mineur theorem does n ...
Interpolatory basis functions are helpful to specify parametric curves or surfaces that can be modified by simple user-interaction. Their main advantage is a characterization of the object by a set of control points that lie on the shape itself (i.e., curv ...
A recently found local-global principle for quadratic forms over function fields of curves over a complete discretely valued field is applied to the study of quadratic forms, sums of squares, and related field invariants. ...
We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a non-terminating execution exis ...
In this article, we present some new properties of representations of Yang-Mills algebras. We first show that any free Lie algebra with m generators is a quotient of the Yang-Mills algebra ym(n) on n generators, for n ≥ 2m. We derive from this that any sem ...
We analyse the problem of approximating a multivariate function by discrete least-squares projection on a polynomial space starting from random, noise-free observations. An area of possible application of such technique is Uncertainty Quantification (UQ) f ...
