Publication

The visible perimeter of an arrangement of disks

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

Publications associées à The visible perimeter of an arrangement of disks | EPFL Graph Search

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

Stefano Filipazzi

In this note, we study certain sufficient conditions for a set of minimal klt pairs ( X, triangle) with kappa ( X, triangle) = dim( X ) - 1 to be bounded. ...

European Mathematical Soc-Ems2024

The first Grushin eigenvalue on cartesian product domains

Joachim Stubbe, Luigi Provenzano, Paolo Luzzini

In this paper, we consider the first eigenvalue.1(O) of the Grushin operator.G :=.x1 + |x1|2s.x2 with Dirichlet boundary conditions on a bounded domain O of Rd = R d1+ d2. We prove that.1(O) admits a unique minimizer in the class of domains with prescribed ...

WALTER DE GRUYTER GMBH2023

Typicality results for weak solutions of the incompressible Navier-Stokes equations

Maria Colombo, Luigi De Rosa, Massimo Sorella

In this work we show that, in the class of L-infinity((0,T); L-2(T-3)) distributional solutions of the incompressible Navier-Stokes system, the ones which are smooth in some open interval of times are meagre in the sense of Baire category, and the Leray on ...

EDP SCIENCES S A2022

Chirok: a post-refinement tool to analyse absolute structure

Philip Pattison

Chirok is software for a post-refinement test of the absolute structure. The software allows a user to calculate a distribution of the measure of chirality based on intensity quotients and linked to the Flack parameter. The distribution is fitted by a set ...

2020

A lower bound on opaque sets

János Pach

It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar ...

ELSEVIER SCIENCE BV2019

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

Andres Jacinto Ruiz Vargas

We consider sets L = {l(1),..., l(n)} of n labeled lines in general position in R-3, and study the order types of point sets {p(1),..., p(n)} that stem from the intersections of the lines in L with (directed) planes Pi, not parallel to any line of L, that ...

ELSEVIER SCIENCE BV2019

A proof of a sumset conjecture of Erdős

Florian Karl Richter

In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C of infinite subsets of ℕ , settling a conjecture of Erdős. The proof features two different decompositions of an arbitrary bounded sequence into a structured ...

2019

EPFL Library Research Data Management Fastguides

Francesco Varrato, Antoine Louis Claude Masson, Eliane Ninfa Blumer, Sitthida Samath, Fantin Reichler, Jérôme Julien Chaptinel

This is a set of 11 1-sheet guides, providing abridged notions, advice and references for quick and practical research data management: #01 Research Data: the basics #02 FAIR Data Principles #03 Cost of Research Data Management #04 File Formats #05 Metadat ...

2019

On Sets Defining Few Ordinary Circles

Frank de Zeeuw

An ordinary circle of a set P of n points in the plane is defined as a circle that contains exactly three points of P. We show that if P is not contained in a line or a circle, then P spans at least ordinary circles. Moreover, we determine the exact minimu ...

Springer2018

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