Search Results for ""

Complete digraphs are digraphs in which every pair of nodes is connected by a bidirectional edge.

A function f(x) is said to be concave on an interval [a,b] if, for any points x_1 and x_2 in [a,b], the function -f(x) is convex on that interval (Gradshteyn and Ryzhik 2000).

An equation of the form f(x)=b (mod m), (1) where the values of 0<=x<m for which the equation holds are sought. Such an equation may have none, one, or many solutions. There ...

The discriminant of the general conic section ax_1^2+bx_2^2+cx_3^2+2fx_2x_3+2gx_1x_3+2hx_1x_2=0 is defined as Delta=|a h g; h b f; g f c|=abc+2fgh-af^2-bg^2-ch^2. If b=a and ...

A proposition which is consistent with known data, but has neither been verified nor shown to be false. It is synonymous with hypothesis.

A function f(x) is said to be constructible if some algorithm F computes it, in binary, within volume O(f(x)), i.e., V_(F(x))=O(f(x)). Here, the volume V_(A(x)) is the ...

The look and say sequence generated from a starting digit of 3, as given by Vardi (1991).

A function that joins univariate distribution functions to form multivariate distribution functions. A two-dimensional copula is a function C:I^2->I such that C(0,t)=C(t,0)=0 ...

Let n objects be picked repeatedly with probability p_i that object i is picked on a given try, with sum_(i)p_i=1. Find the earliest time at which all n objects have been ...

The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.