Publications associées (18)

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer n3n\ge 3, we define e(n)e(n) to be the minimum positive integer such that an ...
EPFL2017

Cocycle growth for the Steinberg representation

Thibaut Dumont

This thesis investigates the growth of the natural cocycle introduced by Klingler for the Steinberg representation. When possible, we extend the framework of simple algebraic groups over a local field to arbitrary Euclidean buildings. In rank one, the grow ...
EPFL2016

Mixed strain-displacement finite elements for landslide and avalanche release prediction

Lorenzo Benedetti

Determination of the initial detaching volume is one of the major challenges in snow avalanche and debris flow forecast. Soil liquefaction due to loss of cohesion results in landslides, whereas quasi-brittle failure triggers the release of snow avalanches. ...
2015

Mixed stabilized finite element methods in nonlinear solid mechanics. Part III: Compressible and incompressible plasticity

Lorenzo Benedetti

This paper presents the application of a stabilized mixed strain/displacement finite element formulation for the solution of nonlinear solid mechanics problems involving compressible and incompressible plasticity. The variational multiscale stabilization i ...
Elsevier2015

The number of distinct distances from a vertex of a convex polygon

János Pach, Rom Pinchasi, Gabriel Nivasch

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is 13n/36 - O(1). I ...
2013

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.