The 13th International Conference on Discrete Mathematics:
Discrete Geometry and Convex Bodies

is planned to take place in Bucharest (September 4 – 7, 2017).
Updated on: 8 September 2017  —  Contact: tuzamfirescu@gmail.com

Lien à la version française de cette page.

The lectures of the conference will take place at the University of Bucharest, Faculty of Mathematics and Computer Science (a red circle on the map below). For evenings: In walking distance (500 m south) is old Bucharest (Lipscani) with small restaurants and bars. 500 m further south, still in walking distance, is Calea Șerban Vodă 36 (a blue Z on the map below), where we can meet (as earlier usual in the Hilbert space). The university hotel “Academica”, Bd. M. Kogălniceanu 36–46, is adjacent to Facultatea de Drept (a green star on the map below).

Tentative Programme

Monday, September 4 Tuesday, September 5 Wednesday, September 6 Thursday, September 7
09:00–09:30
FRETTLÖH
Bounded distance equivalence of
cut-and-project sets
HORJA
Applications of zonotopes to
resolutions of singularities
HERBURT
Intrinsic geometry in hyperspaces
GUȚU
Convex sets, IFS and Borsuk's conjecture
09:40–10:10
ROUYER
Generic properties of length spaces
ITOH
The total mixed curvature of open curves in E³
BOGDEWICZ
A spherical projection of a convex body and the related quotient space
STUPARIU
A comparison of discrete curvature schemes applied for triangle meshes derived from geo-spatial data
10:10–10:40
Coffee   ☕
Coffee   ☕
Coffee   ☕
fin
10:40–11:10
KINCSES
On the representation of finite convex geometries with convex sets
VÎLCU
Envelopes of α-sections
PRUNESCU
Homomorphisms of abelian p-groups and p-automatic sequences
11:10–11:40
RIVIÈRE
About endpoints of convex surfaces
11:40–16:00
Lunch   🍽
Lunch   🍽
Lunch   🍽
16:00–16:30
BÖRÖCZKY
Locally inhomogeneous packings of
incongruent circles in the Eulidean plane
Protz-up
FÜREDI
Coin-weighting, vector sums and
different directions of lines
16:40–17:10
ZAMFIRESCU
Transformation and intersection digraphs
and applications
Protz-up
CALUDE
A quantum polynomial Time Algorithm for the Graph Isomorphism problem


List of Participants
S. Stupariu (RO)
M. Prunescu (RO)
K. Böröczky (H)
J. Rouyer (F)
J. Kincses (H)
T. Albu (RO)
R. Horja (USA)
V. Guţu (MD)
Ю. Зелинский (UA)
C. Calude (NZ)
Z. Füredi (USA)
J. Itoh (J)
C. Nara (J)
C. Gherghe (RO)
L. Ornea (RO)
I. Herburt (PL)
A. Bogdewicz (PL)
A. Rivière (F)
C. Vîlcu (RO)
D. Frettlöh (D)
Ch. Zamfirescu (USA)
V. Căzănescu (RO)
V. Brînzănescu (RO)
A. Turtoi (RO)



We acknowledge financial support from the
Centre Francophone de Mathématiques,
organized by IMAR in cooperation with the
Agence Universitaire de la Francophonie,
and also from Bitdefender.

We also acknowledge logistic help from the
Faculty of Mathematics and Computer Science,
University of Bucharest
.

Organisers:
Mihai Prunescu
Costin Vîlcu (costin_v@yahoo.com) 00407712 53886
Tudor Zamfirescu (tuzamfirescu@gmail.com) 00407621 88088