Search Results for ""

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

The line segment KO^_ joining the symmedian point K and circumcenter O of a given triangle. It is the diameter of the triangle's Brocard circle, and lies along the Brocard ...

The Brocard inellipse is the inconic with parameters x:y:z=1/a:1/b:1/c, (1) giving the trilinear equation ...

A Brocard line is a line from any of the vertices A_i of a triangle DeltaA_1A_2A_3 to the first Omega or second Omega^' Brocard point. Let the angle at a vertex A_i also be ...

The midpoint of the first and second Brocard points Omega and Omega^'. It has equivalent triangle center functions alpha = a(b^2+c^2) (1) alpha = sin(A+omega), (2) where ...

Brown numbers are pairs (m,n) of integers satisfying the condition of Brocard's problem, i.e., such that n!+1=m^2 where n! is the factorial and m^2 is a square number. Only ...

A real-valued stochastic process {B(t):t>=0} is a Brownian motion which starts at x in R if the following properties are satisfied: 1. B(0)=x. 2. For all times ...

If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...

The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...

The nth root of the content of the set sum of two sets in n-dimensional Euclidean space is greater than or equal to the sum of the nth roots of the contents of the individual ...