Concept

Ordre monomial

Publications associées (32)

Inhomogeneous minima of mixed signature lattices

Eva Bayer Fluckiger, Martino Borello, Peter Simon Jossen

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 ([ ...

Academic Press Inc Elsevier Science2016

Osmolarity: A hidden factor in Nanotoxicology

Omid Mashinchian

In the field of drug delivery, long circulating nanocarriers in the blood have many advantages such as targeted drug delivery and sustained release. Based on our current knowledge, evaluation of the effect of long circulating nanocarriers in the blood stre ...

Biomed Central Ltd2016

Polynomiality of Hurwitz numbers, Bouchard-Marino conjecture, and a new proof of the ELSV formula

Nicolas Gerson Orantin

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 ...

Academic Press Inc Elsevier Science2015

Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis

Daniel Kressner

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 ...

Wiley-Blackwell2014

Boundary control and shape optimization for the robust design of bypass anastomoses under uncertainty

Alfio Quarteroni, Gianluigi Rozza, Andrea Manzoni, Toni Mikael Lassila

We review the optimal design of an arterial bypass graft following either a (i) boundary optimal control approach, or a (ii) shape optimization formulation. The main focus is quantifying and treating the uncertainty in the residual flow when the hosting ar ...

EDP Sciences2013

ElimLin Algorithm Revisited

Serge Vaudenay, Pouyan Sepehrdad, Petr Susil

ElimLin is a simple algorithm for solving polynomial systems of multivariate equations over small finite fields. It was initially proposed as a single tool by Courtois to attack DES. It can reveal some hidden linear equations existing in the ideal generate ...

Springer2012

Chebyshev interpolation for nonlinear eigenvalue problems

Daniel Kressner, Peter Cedric Effenberger

This work is concerned with numerical methods for matrix eigenvalue problems that are nonlinear in the eigenvalue parameter. In particular, we focus on eigenvalue problems for which the evaluation of the matrix-valued function is computationally expensive. ...

Springer Netherlands2012

A numerical model of the ankle to analyze joint prostheses

Valérie Parvex

The ankle is one of the most injured joint in the body. However, it remains a new field of study in biomedical orthopedics. With the increased life span, more people suffer from arthosis and joint problems. That is why the improvements done in arthroplasty ...

2012

On the Brauer group of diagonal quartic surfaces

Evis Ieronymou

We obtain an easy sufficient condition for the Brauer group of a diagonal quartic surface D over Q to be algebraic. We also give an upper bound for the order of the quotient of the Brauer group of D by the image of the Brauer group of Q. The proof is based ...

2011

On the Reduction of Points on Abelian Varieties and Tori

Antonella Perucca

Let G be the product of an abelian variety and a torus defined over a number field K. Let R-1, ..., R-n be points in G(K). Let l be a rational prime, and let a(1), ..., a(n) be nonnegative integers. Consider the set of primes p of K satisfying the followin ...

2011

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.

Connectez-vous pour utiliser Chat avec Graph Search