 Home
 Get A Printable Dictionary
 Search Best Words
 Recent Changes
 How You Can Help
 valsi  All
 valsi  Preferred Only
 natlang  All
 natlang  Preferred Only
 Languages
 XML Export
 user Listing
 Report Bugs
 Utilities
 Status
 Help
 Admin Request
 Create Account

valsi 
grafnseljimcnkipliiu 
type 
fu'ivla 
creator 
krtisfranks 
time entered 
Thu Mar 2 19:16:36 2017 
Examples


English


Definition #69402
 Preferred
[edit]


definition 
x_{1} is a 'quipyew' tree graph with special node x_{2}, on nodes x_{3} (set of points; includes x_{2}), with edges x_{4} (set of ordered pairs of nodes), and with other properties x_{5}. 
notes 
Such a graph is the essence of a biological family tree along (for example) the matrilineal line if one selects a special individual, reduces all other individuals in the tree according to their relation to the first while ignoring gender (so, the various other branches are folded along the ancestral line of the selected individual, which is taken to be the stem, and all overlapping nodes are made equivalent; in other words, all nonancestral or nonself nodes of the selected indivodual, are contracted via siblinghood (all siblings are counted the same) at the leaves and then similar contractions sequentially occur up the tree); in other words, all nonself siblings are the same, all nonself parents are the same, all nonself ith cousins jtimes removed are the same (for each i and j), all aunts and uncles are the same, all kthgreatgrandparents are the same (for each k>1), all nonself children are the same, all lthgreatgrandchildren are the same (for each l>1), etc. A quipyew tree graph (terminology invented by .krtisfranks.) is defined as follows: Define an ordered relation R on a collection of points (which will become x_{3}) such that R is ordered, nonreflexive for any point, nonsymmetric for any pair of points, nontransitive for any pair of ordered pairs of points (this requirement is guaranteed by the next condition), and generates a tree on the nodes (with the edges being ordered pairs of points which satisfy R). For any treegenerating ordered relation S: if x S y, then x is a parent of y and y is a child of x; if x S y and y S z, then x is an ancestor of z and z is a descendant of x; "x is a nonself parent of y" means that x S y and xâ y, and likewise for the other relations just described when modified by the descriptor "nonself". A quipyew tree T is a directed tree graph generated by the reflexive closure of R, such that T is totally connected (in the symmetric closure of R), every node in the vertex set (x_{3}) of T has at most two nonself children and at most one nonself parent, and there exists exactly one special node x_{2} (usually denoted "0") in the vertex set of T with the property that for any node n in the vertex set of T, n has two nonself children only if (but not necessarily if) n is a strict ancestor of x_{2} according to the transitive closure of R. See also: grafmseljimca, tseingu, takni.

gloss words 

created by 
krtisfranks 
vote information 
1

time 
Thu Mar 2 19:57:40 2017 



Examples



krtisfranks  {grafnseljimca} + "quipyew" (a neologism by .krtisfranks. which references the quipu, the yew tree, and the letters "Y" and "U") + "l" (in reference to Greek lambda ("λ"), which also has such a shape (allowing for selfsimilarity/iteration)).  [edit] 

