Concept

Point d'accumulation (mathématiques)

Publications associées (53)

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

No Evidence for Association of beta-Defensin Genomic Copy Number with HIV Susceptibility, HIV Load during Clinical Latency, or Progression to AIDS

Jacques Fellay

Common single-nucleotide variation in the host accounts for 25% of the variability in the plasma levels of HIV during the clinical latency stage (viral load set point). However, the role of rare variants and copy number variants remains relatively unexplor ...

Wiley-Blackwell2017

Point and sensor estimation from images

Martin Vetterli, Adam James Scholefield, Alireza Ghasemi

System comprising at least one sensor configured to take a set of images from different viewpoints of a scene; a processor configured to identifying a point source represented in the images of a set of images; computing for each image of the set of images ...

2017

Separation with restricted families of sets

János Pach, Gábor Tardos, Márton Naszódi, Zsolt Langi

Given a finite n-element set X, a family of subsets F subset of 2(X) is said to separate X if any two elements of X are separated by at least one member of F. It is shown that if vertical bar F vertical bar > 2(n-1), then one can select vertical bar log n ...

Academic Press Inc Elsevier Science2016

On The Number Of Ordinary Conics

Frank de Zeeuw, Adrian Claudiu Valculescu

We prove a lower bound on the number of ordinary conics determined by a finite point set in R-2. An ordinary conic for S subset of R-2 is a conic that is determined by five points of S and contains no other points of S. Wiseman and Wilson proved the Sylves ...

Siam Publications2016

Non-autonomous functionals, borderline cases and related function classes

Maria Colombo

The class of non-autonomous functionals under study is characterized by the fact that the energy density changes its ellipticity and growth properties according to the point; some regularity results are proved for related minimizers. These results are the ...

2016

Bisector Energy and Few Distinct Distances

Frank de Zeeuw

We define the bisector energy E(P) of a set P in R-2 to be the number of quadruples (a, b, c, d) is an element of P-4 such that a, b determine the same perpendicular bisector as c, d. Equivalently, E(P) is the number of isosceles trapezoids determined by P ...

Springer2016

Few distinct distances implies no heavy lines or circles

Frank de Zeeuw

We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set of n points determines o(n) distinct distances, then no line contains Omega(n (7/8)) points of and no circle contains Omega ...

Springer Heidelberg2016

Comparative studies of electrostatic turbulence induced transport in presence of resonant magnetic perturbations in RFX-mod

Nicola Vianello

Three-dimensional non-axisymmetric magnetic fields are purposely applied to toroidally symmetric fusion plasmas in order to modify transport of heat and particle fluxes to the plasma-facing components (PFCs), and specifically to control and suppress edge l ...

Iop Publishing Ltd2015

Stable blow up dynamics for energy supercritical wave equations

Roland Donninger

We study the semilinear wave equation

\displaystyle \partial _t^2 \psi -\Delta \psi =\vert\psi \vert^{p-1}\psi

for

p > 3

with radial data in three spatial dimensions. There exists an explicit solution which blows up at

t=T>0

given by $\displaystyl ...

American Mathematical Society2014

The visible perimeter of an arrangement of disks

János Pach, Gábor Tardos, Gabriel Nivasch

Given a collection of n opaque unit disks in the plane, we want to find a stacking order for them that maximizes their visible perimeter, the total length of all pieces of their boundaries visible from above. We prove that if the centers of the disks form ...

Elsevier Science Bv2014