Publications associées à A note on coloring line arrangements

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

A note on coloring line arrangements

Graph Chatbot

Chattez avec Graph Search

On the boundedness of n-folds with κ(X) = n - 1

The completeness of the generalized eigenfunctions and an upper bound for the counting function of the transmission eigenvalue problem for Maxwell equations

A lower bound on opaque sets

Cross-sections of line configurations in R-3 and (d-2)-flat configurations in R-d

On the Hardness of the Strongly Dependent Decision Problem

EPFL Library Research Data Management Fastguides

On Sets Defining Few Ordinary Circles

Distinct distances between points and lines

On some algebraic and extremal problems in discrete geometry

PCB and circuit design for piezoelectric-NEMS characterization

A lower bound on opaque sets

The completeness of the generalized eigenfunctions and an upper bound for the counting function of the transmission eigenvalue problem for Maxwell equations

PCB and circuit design for piezoelectric-NEMS characterization

On the boundedness of n-folds with κ(X) = n - 1

Cross-sections of line configurations in R-3 and (d-2)-flat configurations in R-d

EPFL Library Research Data Management Fastguides

Distinct distances between points and lines

On the Hardness of the Strongly Dependent Decision Problem

On some algebraic and extremal problems in discrete geometry

On Sets Defining Few Ordinary Circles