Return-path: Envelope-to: jbovlaste-admin@lojban.org Delivery-date: Thu, 14 Jan 2021 12:01:00 -0800 Received: from [192.168.123.254] (port=44424 helo=web.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.94) (envelope-from ) id 1l08nh-009OJY-Qf for jbovlaste-admin@lojban.org; Thu, 14 Jan 2021 12:01:00 -0800 Received: by web.digitalkingdom.org (sSMTP sendmail emulation); Thu, 14 Jan 2021 20:00:57 +0000 From: "Apache" To: curtis289@att.net Reply-To: webmaster@lojban.org Subject: [jvsw] Definition Edited At Word utkakpu -- By krtisfranks Date: Thu, 14 Jan 2021 20:00:57 +0000 MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Message-Id: X-Spam-Score: -2.9 (--) X-Spam_score: -2.9 X-Spam_score_int: -28 X-Spam_bar: -- In jbovlaste, the user krtisfranks has edited a definition of "utkakpu" in the language "English". Differences: 5,5c5,5 < All paths in the graph that pass through $x_1$ must at some point also pass through $x_2$. Note that they may also contain $x_2$ earlier; for example, cycles do this. It just must be the case that any path which at some point comes from $x_1$ via relation $x_3$ must, at some later point, go to $x_2$ (and then they may continue on); in other words, the web from $x_1$ 'bunches' up at node $x_2$ and no path from $x_1$ does not eventually go to $x_2$. All other notes from ".{utka}" apply, although $.utka_4$ is missing (and, thus, those notes are irrelevant), because it does not in general make sense to discuss intermediates nodes in this case (because no particular path is chosen). In a sense, this word captures the idea in the phrase "All roads lead to Rome", except that it would be rephrased as "All one-way roads from $x_1$ lead to Rome". Diagrammatically, see: https://drive.google.com/file/d/14oSV_0ypJpIyKjEsOXVe684f6c-4jZBL/view?usp=drivesdk . The subgraph of paths from $x_1$ 'bunches' up at $x_2$; but this does not imply that it bunches up only at $x_2$, nor that $x_2$ is the root node thereof, nor that the said subgraph does not have multiple paths out of $x_2$. This word is intended to be equivalent to "{.utkakpu}", which accidentally has a separate entry in this dictionary. --- > All paths in the graph that pass through $x_1$ must at some point also pass through $x_2$. Note that they may also contain $x_2$ earlier; for example, cycles do this. It just must be the case that any path which at some point comes from $x_1$ via relation $x_3$ must, at some later point, go to $x_2$ (and then they may continue on); in other words, the web from $x_1$ 'bunches' up at node $x_2$ and no path from $x_1$ does not eventually go to $x_2$. All other notes from ".{utka}" apply, although $.utka_4$ is missing (and, thus, those notes are irrelevant), because it does not in general make sense to discuss intermediates nodes in this case (because no particular path is chosen). In a sense, this word captures the idea in the phrase "All roads lead to Rome", except that it would be rephrased as "All one-way roads from $x_1$ lead to Rome". Diagrammatically, see: https://drive.google.com/file/d/14oSV_0ypJpIyKjEsOXVe684f6c-4jZBL/view?usp=drivesdk . The subgraph of paths from $x_1$ 'bunches' up at $x_2$; but this does not imply that it bunches up only at $x_2$, nor that $x_2$ is the root node thereof, nor that the said subgraph does not have multiple paths out of $x_2$. In other words, $x_2$ is the ancestor of $x_1$ in all possible ways/along all paths. This word is intended to be equivalent to "{.utkakpu}", which accidentally has a separate entry in this dictionary. 11,11d10 < Word: path-connection hub, In Sense: \n12a12,12 \n> Word: path-connection hub, In Sense: Old Data: Definition: $x_1$ and $x_2$ are path-connected by ordered binary relation/predicate $x_3$ (ka), such that all paths which satisfy condition(s) $x_4$ (ka; default: no additional conditions) in the relevant graph ($x_5$) linking nodes by said relation $x_3$ in a directed manner and which contain $x_1$ must also (later in the path) contain $x_2$. Notes: All paths in the graph that pass through $x_1$ must at some point also pass through $x_2$. Note that they may also contain $x_2$ earlier; for example, cycles do this. It just must be the case that any path which at some point comes from $x_1$ via relation $x_3$ must, at some later point, go to $x_2$ (and then they may continue on); in other words, the web from $x_1$ 'bunches' up at node $x_2$ and no path from $x_1$ does not eventually go to $x_2$. All other notes from ".{utka}" apply, although $.utka_4$ is missing (and, thus, those notes are irrelevant), because it does not in general make sense to discuss intermediates nodes in this case (because no particular path is chosen). In a sense, this word captures the idea in the phrase "All roads lead to Rome", except that it would be rephrased as "All one-way roads from $x_1$ lead to Rome". Diagrammatically, see: https://drive.google.com/file/d/14oSV_0ypJpIyKjEsOXVe684f6c-4jZBL/view?usp=drivesdk . The subgraph of paths from $x_1$ 'bunches' up at $x_2$; but this does not imply that it bunches up only at $x_2$, nor that $x_2$ is the root node thereof, nor that the said subgraph does not have multiple paths out of $x_2$. This word is intended to be equivalent to "{.utkakpu}", which accidentally has a separate entry in this dictionary. Jargon: Gloss Keywords: Word: path-connection hub, In Sense: Word: bunching point in subgraph, In Sense: Place Keywords: New Data: Definition: $x_1$ and $x_2$ are path-connected by ordered binary relation/predicate $x_3$ (ka), such that all paths which satisfy condition(s) $x_4$ (ka; default: no additional conditions) in the relevant graph ($x_5$) linking nodes by said relation $x_3$ in a directed manner and which contain $x_1$ must also (later in the path) contain $x_2$. Notes: All paths in the graph that pass through $x_1$ must at some point also pass through $x_2$. Note that they may also contain $x_2$ earlier; for example, cycles do this. It just must be the case that any path which at some point comes from $x_1$ via relation $x_3$ must, at some later point, go to $x_2$ (and then they may continue on); in other words, the web from $x_1$ 'bunches' up at node $x_2$ and no path from $x_1$ does not eventually go to $x_2$. All other notes from ".{utka}" apply, although $.utka_4$ is missing (and, thus, those notes are irrelevant), because it does not in general make sense to discuss intermediates nodes in this case (because no particular path is chosen). In a sense, this word captures the idea in the phrase "All roads lead to Rome", except that it would be rephrased as "All one-way roads from $x_1$ lead to Rome". Diagrammatically, see: https://drive.google.com/file/d/14oSV_0ypJpIyKjEsOXVe684f6c-4jZBL/view?usp=drivesdk . The subgraph of paths from $x_1$ 'bunches' up at $x_2$; but this does not imply that it bunches up only at $x_2$, nor that $x_2$ is the root node thereof, nor that the said subgraph does not have multiple paths out of $x_2$. In other words, $x_2$ is the ancestor of $x_1$ in all possible ways/along all paths. This word is intended to be equivalent to "{.utkakpu}", which accidentally has a separate entry in this dictionary. Jargon: Gloss Keywords: Word: bunching point in subgraph, In Sense: Word: path-connection hub, In Sense: Place Keywords: You can go to to see it.