Frontière (topologie) | EPFL Graph Search

En topologie, la frontière d'un ensemble (aussi appelé parfois "le bord d'un ensemble") est constituée des points qui, de façon intuitive, sont « situés au bord » de cet ensemble, c’est-à-dire qui peuvent être « approchés » à la fois par l'intérieur et l'extérieur de cet ensemble. Définition Soit S un sous-ensemble d'un espace topologique (E, T). Il est possible de définir la frontière de S (souvent notée ∂S ou Fr S) de plusieurs façons équivalentes :

l'adhérence de S privée de l'intérieur de S :\partial S = \overline{S}\setminus \stackrel{\circ}{S}~;
l'ensemble des points adhérents à la fois à S et à son complémentaire : \partial S = \overline S \cap \overline{E\setminus S}~;
l'ensemble de tous les « points frontières » de S, c'est-à-dire des points p de E pour lesquels tout voisinage de p — ou simplement tous ceux d'une base de voisinages — contient au moins un point dans S et un point hors de S.
l'ensemble des points de E qui n'appa

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 any set of

e(n)

points in general position in the plane contains

n

points in convex position. In 1935, Erd\H{o}s and Szekeres proved that

e(n) \le {2n-4 \choose n-2}+1

and later in 1961, they obtained the lower bound

2^{n-2}+1 \le e(n)

, which they conjectured to be optimal. We prove that

e(n) \le {2n-5 \choose n-2}-{2n-8 \choose n-3}+2

. In a recent breakthrough, Suk proved that

e(n) \le 2^{n+O\left(n^{2/3}\log n\right)}

. We strengthen this result by extending it to pseudo-configurations and also improving the error term. Combining our results with a theorem of Dobbins et al., we significantly improve the best known upper bounds on the following two functions, introduced by Bisztriczky and Fejes T'{o}th and by Pach and T'{o}th, respectively. Let

c(n)

(and

c'(n)

) denote the smallest positive integer

N

such that any family of

N

pairwise disjoint convex bodies in general position (resp.,

N

convex bodies in general position, any pair of which share at most two boundary points) has an

n

members in convex position. We show that

c(n)\le c'(n)\le 2^{n+O\left(\sqrt{n\log n}\right)}

. Given a point set

P

in the plane, an ordinary circle for

P

is defined as a circle containing exactly three points of

P

. We prove that any set of

n

points in the plane, not all on a line or a circle, determines at least

\frac{1}{4}n^2-O(n)

ordinary circles. We determine the exact minimum number of ordinary circles for all sufficiently large

n

, and characterize all point sets that come close to this minimum. We also consider the orchard problem for circles, where we determine the maximum number of circles containing four points of a given set and describe the extremal configurations. A special case of the Schwartz-Zippel lemma states that given an algebraic curve

C\subset \mathbb{C}^2

of degree

d

and two finite sets

A,B\subset \mathbb{C}

, we have

|C\cap (A\times B)|=O_d(|A|+|B|)

. We establish a two-dimensional version of this result, and prove upper bounds on the size of the intersection

|X\cap (P\times Q)|

for a variety

X\subset \mathbb{C}^4

and finite sets

P,Q\subset \mathbb{C}^2

. A key ingredient in our proofs is a two-dimensional version of a special case of Alon's combinatorial Nullstellensatz. As corollaries, we generalize the Szemer'edi-Trotter point-line incidence theorem and several known bounds on repeated and distinct Euclidean distances. We use incidence geometry to prove some sum-product bounds over arbitrary fields. First, we give an explicit exponent and improve a recent result of Bukh and Tsimerman by proving that

\max \{ |A+A|, |f(A, A)|\}\gg |A|^{6/5}

for any small set

A\subset \mathbb{F}_p

and quadratic non-degenerate polynomial

f(x, y)\in \mathbb{F}_p[x, y]

. This generalizes the result of Roche-Newton et al. giving the best known lower bound for the term

\max \{ |A+A|, |A \cdot A |\}

. Secondly, we improve and generalize the sum-product results of Hegyv'{a}ri and Hennecart on

\max\{ |A+B|, |f(B,C)|\}

, for a specific type of function

f

. Finally, we prove that the number of distinct cubic distances generated by any small set

A\times A\subset \mathbb{F}_p^2

\Omega(|A|^{8/7})

, which improves a result of Yazici et al.

EPFL2017

New Moduli For Banach Spaces

Grigory Ivanov

Modifying the moduli of supporting convexity and supporting smoothness, we introduce new moduli for Banach spaces which occur, for example, as lengths of catheti of right-angled triangles (defined via so-called quasiorthogonality). These triangles have two boundary points of the unit ball of a Banach space as endpoints of their hypotenuse, and their third vertex lies in a supporting hyperplane of one of the two other vertices. Among other things, it is our goal to quantify via such triangles the local deviation of the unit sphere from its supporting hyperplanes. We prove respective Day-Nordlander-type results involving generalizations of the modulus of convexity and the modulus of Banas.

Tusi Mathematical Research Group2017

Real-Time Self-Collision Avoidance in Joint Space for Humanoid Robots

Aude Billard, Nadia Barbara Figueroa Fernandez, Mikhail Koptev

In this letter, we propose a real-time self-collision avoidance approach for whole-body humanoid robot control. To achieve this, we learn the feasible regions of control in the humanoid's joint space as smooth self-collision boundary functions. Collision-free motions are generated online by treating the learned boundary functions as constraints in a Quadratic Program based Inverse Kinematic solver. As the geometrical complexity of a humanoid robot joint space grows with the number of degrees-of-freedom (DoF), learning computationally efficient and accurate boundary functions is challenging. We address this by partitioning the robot model into multiple lower-dimensional submodels. We compare performance of several state-of-the-art machine learning techniques to learn such boundary functions. Our approach is validated on the 29-DoF iCub humanoid robot, demonstrating highly accurate real-time self-collision avoidance.

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021