Metric hypergraphs and metric-line equivalences

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10493549" target="_blank" >RIV/00216208:11320/24:10493549 - isvavai.cz</a>

Výsledek na webu

<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=u7K6t5Yj7Y" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=u7K6t5Yj7Y</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.disc.2023.113473" target="_blank" >10.1016/j.disc.2023.113473</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Metric hypergraphs and metric-line equivalences

Popis výsledku v původním jazyce

In a metric space with distance function dist, we say that v is between u and w if u, v, w are pairwise distinct and dist(u, w) = dist(u, v) + dist(v, w). All triples {u, v, w} such that v is between u and w constitute a hypergraph induced by this metric space. In answer to a question posed in [3], we construct an infinite family of 3 -uniform hypergraphs induced by no metric space. The line determined by a pair of distinct points x and y in a metric space is the set consisting of x, y, and all points z such that one of x, y, z is between the remaining two. Two pairs of distinct points are said to be equivalent if they determine the same line. The resulting equivalence relation is a metric -line equivalence. We construct an infinite family of genuinely distinct obstacles that prevent an abstract equivalence relation from being a metric -line equivalence. (c) 2023 Elsevier B.V. All rights reserved.

Název v anglickém jazyce

Metric hypergraphs and metric-line equivalences

Popis výsledku anglicky

In a metric space with distance function dist, we say that v is between u and w if u, v, w are pairwise distinct and dist(u, w) = dist(u, v) + dist(v, w). All triples {u, v, w} such that v is between u and w constitute a hypergraph induced by this metric space. In answer to a question posed in [3], we construct an infinite family of 3 -uniform hypergraphs induced by no metric space. The line determined by a pair of distinct points x and y in a metric space is the set consisting of x, y, and all points z such that one of x, y, z is between the remaining two. Two pairs of distinct points are said to be equivalent if they determine the same line. The resulting equivalence relation is a metric -line equivalence. We construct an infinite family of genuinely distinct obstacles that prevent an abstract equivalence relation from being a metric -line equivalence. (c) 2023 Elsevier B.V. All rights reserved.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA22-19073S" target="_blank" >GA22-19073S: Kombinatorická a výpočetní složitost v topologii a geometrii</a><br>

Návaznosti

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

Rok uplatnění

2024

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 periodika

Discrete Mathematics

ISSN

0012-365X

e-ISSN

1872-681X

Svazek periodika

347

Číslo periodika v rámci svazku

8

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

6

Strana od-do

113473

Kód UT WoS článku

001252048100001

EID výsledku v databázi Scopus

2-s2.0-85158056875