Search Results for ""

A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.

The three circular triangles A^'B^'C^', AB^'C^', A^'BC^', and A^'B^'C obtained by extending the arcs of a circular triangle ABC into complete circles.

An augmented polyhedron is a polyhedron formed from a base polyhedron via the augmentation operation on one or more of its faces. Augmentation is implemented under the ...

"Aut" is the term applied in propositional calculus to the XOR connective. "Aut" is Latin form for "either/or (but not both)," e.g., "Aut Caesar aut nihil" (Cesare Borgia; ...

Axiomatic set theory is a version of set theory in which axioms are taken as uninterpreted rather than as formalizations of pre-existing truths.

A line that simultaneously bisects a triangle's perimeter and area.

All triangles are bicentric, i.e., possess both an incircle and a circumcircle. This is not necessarily the case for polygons with four or more sides. The inradius r and ...

If two complementary Plücker characteristics are equal, then each characteristic is equal to its complement except in four cases where the sum of order and class is 9.

A convex planar domain in which the minimal generalized diameter is >1 always contains a circle of radius 1/3.

Let G=SL(n,C). If lambda in Z^n is the highest weight of an irreducible holomorphic representation V of G, (i.e., lambda is a dominant integral weight), then the G-map ...