Lower bounds for Pythagoras numbers of function fields
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 consider the problem of comparing several samples of stochastic processes with respect to their second-order structure, and describing the main modes of variation in this second order structure, if present. These tasks can be seen as an Analysis of Vari ...
The bridge over the Venoge, built in 1966 and extended in 1997, is a composite bridge located on the highway between Lausanne and Geneva. The aim of this thesis will be to develop a digital twin of this bridge, which consist of a digital representation as ...
The real now, which has a duration of about 3 seconds, is the moment in which what happened glides in to the past and becomes already history, whereas the future did not yet arrive. The real now and architecture. ...
This paper focuses on depth of field (DOF) extension through polarization aberrations. The addition of polarizing elements into an optical system allows to exploit the polarization of the incoming light as an additional degree of freedom in the optical sys ...
We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and Swinnerton-Dyer ([ ...
We consider expected performances based on max-stable random fields and we are interested in their derivatives with respect to the spatial dependence parameters of those fields. Max-stable fields, such as the Brown-Resnick and Smith fields, are very popula ...
Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F subset of 2([n]) that does not contain an induced copy of P. It was proved by Methuku and Palvolgyi that there exists a constant C-P (depending only on P) su ...
A long-standing conjecture of Richter and Thomassen states that the total number of intersection points between any n simple closed Jordan curves in the plane, so that any pair of them intersect and no three curves pass through the same point, is at least ...
We consider L1 -TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...
Embeddings of maximal tori in classical groups over fields of characteristic not 2 are the subject matter of several recent papers. The aim of the present paper is to give necessary and sufficient conditions for such an embedding to exist, when the base fi ...
