About me

My name is Evangelos Bartzos and I am currently a member of the ΕρΓΑ Lab.
Our lab is part of AROMATH , a joint team affiliated with INRIA Sophia-Antipolis.
We are also affiliated with ATHENA Research Center .

I have finished my Phd at the Department of Telecomuncations and Informatics in University of Athens under the supervision of Prof. Ioannis Z. Emiris.

My Phd was part of Arcades, a Marie Skłodowska-Curie Innovative Training Network.

Here you can find my Orchid ID .

Brief Synopsis of my Phd Thesis

Bounds on the maximal number of graph embeddings

Rigidity theory is the branch of mathematics that studies the embeddings (or equivalently realizations) of graphs in an euclidean space or a manifold. If the number of realizations satisfying edge length constraints is finite up to rigid motions, then the embedding is called rigid, otherwise it is called flexible. These embeddings can be related to the real solutions of certain algebraic systems and their complex solutions extend the notion of rigidity to complex eucledian spaces. One of the major open problems in rigidity theory is to find tight upper bounds on the numbers of rigid graph realizations in an embedding space for a given number of vertices. In this thesis, we display methods that reduce the gap between the existing upper bounds and asymptotic lower bounds on the maximal number of realizations on euclidean spaces or spheres.

Scientific interests and Current Research

Algebraic Modeling, Graph Rigidity, Distance Geometry, Real Algebraic Geometry

Publications

An asymptotic upper bound for graph embeddings.

with Ioannis.Z. Emiris, Charalambos Tzamos

Published in Discrete Applied Mathematics .

2023

New upper bounds for the number of embeddings of minimally rigid graphs.

with Ioannis.Z. Emiris, Raimundas Vidunas

Published in Discrete & Computational Geometry .

2020

On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs.

with Ioannis.Z. Emiris, Josef Schicho

Published in Applicable Algebra in Engineering, Communication and Computing (AAECC).

Source code available in zenodo .

2020

On the maximal number of real embeddings of minimally rigid graphs in $ℝ^2$, $ℝ^3$ and $S^2$.

with Ioannis.Z. Emiris, Jan Legerský, Elias Tsigaridas

Published in Journal of Symbolic Computation (J.S.C.).

Summary of the project and source code is available in Jan's webpage and in zenodo .

2019

An Explicit Isometric Reduction of the Unit Sphere into an Arbitrarily Small Ball

with Vincent Borrelli, Roland Dennis, Francis Lazarus, Damien Rohmer, Boris Thibert

Published in Foundations of Computational Mathematics .

More information about this project can be found in HEVEA webpage.

2017

Conferences/ Workshops

An asymptotic upper bound for graph embeddings

with I.Emiris and C.Tzamos

Graph rigidity and applications .

This presentation included the methods that led to improved upper bounds on graph embedings.

Lancaster, 2023

Bounding the number of Roots for Multi-Homogeneous Systems

with Ioannis.Z. Emiris, Ilias Kotsireas, Charalambos Tzamos

Appears in the proceedings of ISSAC 2022 .

In this presentation we relate the computation of the m-Bézout bound with constrained hypergraph orientations.

Lille, France, 2022

The m-Bézout Bound and Distance Geometry

with Ioannis.Z. Emiris, Charalambos Tzamos

Appears in the proceedings of CASC 2021 .

This presentation included results that generalize the use of graph orientations to compute the multihomogeneous bound of polynomial systems modeled by simple graphs.

Sochi, Russia, 2021

Bounds on the number of embeddings of minimally rigid graphs

part of a joint project with I.Z.Emiris and J.Schicho

French Computational Geometry Days /Journées de Géométrie Algorithmique .

This presentation included results on the multi-homogeneous Bézout bounds for the embeddings of minimally rigid graphs and a conjecture on the degree of their determinantal varieties.

Marseille, 2020

Algebraic and combinatorial methods for bounding the number of the complex embeddings of minimally rigid graphs

part of a joint project with I.Z.Emiris and J.Schicho

Geometric constraint systems: rigidity, flexibility and applications ( slides ).

This presentation included results on the computation of the multi-homogeneous Bézout bound for the embeddings of minimally rigid graphs and its exactness.

Lancaster, 2019

On the maximal number of real embeddings of spatial minimally rigid graphs

with Ioannis.Z. Emiris, Jan Legerský, Elias Tsigaridas

Appears in the proceedings of ISSAC 2018 (see also the slides the presentation).

The results of this work constitute a subset of our publication in J.S.C. .

New York, 2018

Lower bounds on the maximal number of realizations

with G.Grasegger and J.Legerský

Bond-Node Structures .

This presentation is based on our article in J.S.C. and Lower Bounds on the Number of Realizations of Rigid Graphs by G.Grasegger, C.Koutschan & E.Tsigaridas.

Lancaster, 2018

ARCADES events

ARCADES training included a variety of events (doctoral shools, industrial and software workshops and other activities).

An overview of these events can be found here here .

2016 - 2019