Combinatorial bounds on relational complexity

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10190365" target="_blank" >RIV/00216208:11320/13:10190365 - isvavai.cz</a>

Výsledek na webu

<a href="http://link.springer.com/chapter/10.1007%2F978-88-7642-475-5_90" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-88-7642-475-5_90</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-88-7642-475-5_90" target="_blank" >10.1007/978-88-7642-475-5_90</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Combinatorial bounds on relational complexity

Popis výsledku v původním jazyce

An ultrahomogeneous structure is a (finite or countable) relational structure for which every partial isomorphism between finite substructures can be extended to a global isomorphism. This very strong symmetry condition implies that there are just a fewultrahomogeneous structures. For example, by [14], there are just countably many ultrahomogeneous undirected graphs. The classification program is one of the celebrated lines of research in the model theory, see [4, 15]. Various measures were introducedin order to modify a structure to an ultrahomogeneous one. A particularly interesting measure is the minimal arity of added relations (i.e. the minimal arity of an extension or lift) which suffice to produce an ultrahomogeneous structure. If these addedrelations are not changing the automorphism group then the problem is called the relational complexity and this is the subject of this paper. In the context of permutation groups, the relational complexity was defined in [5] and was recen

Název v anglickém jazyce

Combinatorial bounds on relational complexity

Popis výsledku anglicky

An ultrahomogeneous structure is a (finite or countable) relational structure for which every partial isomorphism between finite substructures can be extended to a global isomorphism. This very strong symmetry condition implies that there are just a fewultrahomogeneous structures. For example, by [14], there are just countably many ultrahomogeneous undirected graphs. The classification program is one of the celebrated lines of research in the model theory, see [4, 15]. Various measures were introducedin order to modify a structure to an ultrahomogeneous one. A particularly interesting measure is the minimal arity of added relations (i.e. the minimal arity of an extension or lift) which suffice to produce an ultrahomogeneous structure. If these addedrelations are not changing the automorphism group then the problem is called the relational complexity and this is the subject of this paper. In the context of permutation groups, the relational complexity was defined in [5] and was recen

Druh

D - Stať ve sborníku

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

CRM Series

ISBN

978-88-7642-474-8

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

573-578

Název nakladatele

Scuola Normale Superiore

Místo vydání

Itálie

Místo konání akce

Itálie

Datum konání akce

9. 9. 2013

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—