Publications related to A note on coloring line arrangements

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

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 completeness of the generalized eigenfunctions and an upper bound for the counting function of the transmission eigenvalue problem for Maxwell equations

Hoài-Minh Nguyên, Jean Louis-Alexandre Fornerod

Cakoni and Nguyen recently proposed very general conditions on the coefficients of Maxwell equations for which they established the discreten ess of the set of eigenvalues of the transmission problem and studied their locations. In this paper, we establish ...

2021

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

On the Hardness of the Strongly Dependent Decision Problem

Martin Biely

We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characterization of the SDD problem based on point-set topology. For partially synchro ...

ASSOC COMPUTING MACHINERY2019

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

Distinct distances between points and lines

Frank de Zeeuw, Adrian Claudiu Valculescu, Shakhar Smorodinsky

We show that for m points and n lines in R-2, the number of distinct distances between the points and the lines is Omega(m(1/5)n(3/5)), as long as m(1/2)

Elsevier Science Bv2018

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

PCB and circuit design for piezoelectric-NEMS characterization

Nanoelectromechanical resonators (NEMS) are being developed from more than two decades from now. The fabrication techniques as well as metrology ones are constantly improving, allowing a possible democratization of their uses in the consumer and industrial ...

2017

A note on coloring line arrangements

Graph Chatbot

Chat with 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

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

A lower bound on opaque sets

On the Hardness of the Strongly Dependent Decision Problem

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

EPFL Library Research Data Management Fastguides

PCB and circuit design for piezoelectric-NEMS characterization

On some algebraic and extremal problems in discrete geometry

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

On Sets Defining Few Ordinary Circles

Distinct distances between points and lines