Department of Geometry |
Bolyai Institute, Faculty of Science, University of Szeged |
Resolving sets and identifying codes in finite geometries
The Department of Geometry is pleased to divulge that
gives a lecture at the Kerékjártó Seminar with title
Date and place of the lecture is:
Abstract of the lecture:
Let $\Gamma=(V,E)$ be a finite, simple, undirected graph.
For $u,v,s\in V$ let $d(u,v)$ denote the distance of $u$ and $v,$ and let $N[s]$
denote the closed neighborhood of $s$.
In this talk resolving sets and identifying codes for graphs arising from finite geometries (e.g. Levi graphs of projective and affine planes and spaces, generalized quadrangles) are considered. We present several constructions and give estimates on the sizes of these objects.
Here are some snapshots of the event:
Information :
events are usually videotaped and audited in the form of mass recordings, and the event is a public press event.
Act V of 2013 on the Civil Code 2:48. § (2), in the case of mass recordings and public appearances, the consent of the participants is not required for the preparation or use of the recording, but the persons concerned must be informed about this in advance.
We are fulfilling our obligation by displaying this text, supplemented by an indication that the recordings will be used to promote the event, for marketing purposes, through our online and print channels.