Publications associées à Points et parties remarquables de la frontière d'un convexe

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.

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

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

Points et parties remarquables de la frontière d'un convexe

Graph Chatbot

Chattez avec Graph Search

On the number of regions of piecewise linear neural networks

Learning Generalized Nash Equilibria in a Class of Convex Games

Data-Driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations

On some algebraic and extremal problems in discrete geometry

Extreme points in non-positive curvature

Separation with restricted families of sets

On Polygons Excluding Point Sets

Inner approximations of the region of attraction for polynomial dynamical systems

Two and a half billion years of distance research

Sparse projections onto the simplex

On some algebraic and extremal problems in discrete geometry

On the number of regions of piecewise linear neural networks

Extreme points in non-positive curvature

Learning Generalized Nash Equilibria in a Class of Convex Games

Two and a half billion years of distance research

Separation with restricted families of sets

Data-Driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations

Sparse projections onto the simplex

On Polygons Excluding Point Sets

Inner approximations of the region of attraction for polynomial dynamical systems