https://wiki.lojban.io/index.php?action=history&feed=atom&title=utkamtauutkamtau - Revision history2026-04-28T13:04:50ZRevision history for this page on the wikiMediaWiki 1.45.3https://wiki.lojban.io/index.php?title=utkamtau&diff=20454&oldid=prevNalvaizmiku: Import words via API2026-01-13T17:05:42Z<p>Import words via API</p>
<p><b>New page</b></p><div>==== valsi ====<br />
utkamtau<br />
==== type ====<br />
fu'ivla<br />
==== creator ====<br />
[[personal/krtisfranks|krtisfranks]]<br />
==== time entered ====<br />
Thu Jan 14 20:08:42 2021<br />
<br />
== English ==<br />
=== Definition #72365 - Preferred ===<br />
<br />
==== definition ====<br />
x<sub>1</sub> and x<sub>2</sub> are path-linked by binary predicate x<sub>3</sub> (ka; possibly non-symmetric/non-commutative) via some from-x<sub>1</sub>-to-x<sub>2</sub>-directed path of length x<sub>4</sub> (li; nonnegative integer or positive infinity) in/through graph x<sub>5</sub> (default: maximal) which is generated by relation x<sub>3</sub>.<br />
==== notes ====<br />
Like ".[[utka'au|utka'au]]" but primarily without the constraint that a geodesic path be chosen. The requirement simply is that there exists at least one path from x<sub>1</sub> to x<sub>2</sub> via steps related by x<sub>3</sub> in x<sub>5</sub> such that the path has total length x<sub>4</sub>. Notice that this does not interact well if the directed graph is connected to at least one cycle. Otherwise, as appropriate, this word and all of its notes are equivalent to those of ".utka'au".<br />
==== gloss words ====<br />
<br />
<ul><li>[[natlang/en/path-linked by n steps|path-linked by n steps]]</li></ul><br />
<br />
==== created by ====<br />
[[personal/krtisfranks|krtisfranks]]<br />
==== vote information ====<br />
1<br />
<br />
==== time ====<br />
Thu Jan 14 20:08:42 2021<br />
<br />
<br />
<br />
<br/><font size="+1">Examples</font><br />
<hr/><br />
<dl><br />
</dl><br />
<br />
=== Etymology ===</div>Nalvaizmiku