Search Results for ""

There are a number of point processes which are called Hawkes processes and while many of these notions are similar, some are rather different. There are also different ...

Let L_n be the n×n matrix whose (i,j)th entry is 1 if j divides i and 0 otherwise, let Phi_n be the n×n diagonal matrix diag(phi(1),phi(2),...,phi(n)), where phi(n) is the ...

Define q=e^(2piitau) (cf. the usual nome), where tau is in the upper half-plane. Then the modular discriminant is defined by ...

A class of curve defined at integer values which hops from one value to another. Their name derives from the Greek word betaalphataurhoalphachiiotaomicronnu batrachion, which ...

A map is called bijective if it is both injective and surjective. A bijective map is also called a bijection. A function f admits an inverse f^(-1) (i.e., "f is invertible") ...

If {a_j} subset= D(0,1) (with possible repetitions) satisfies sum_(j=1)^infty(1-|a_j|)<=infty, where D(0,1) is the unit open disk, and no a_j=0, then there is a bounded ...

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 ...

In machine learning theory and artificial intelligence, a concept c over a domain X is a Boolean function c:X->{0,1}. A collection of concepts is called a concept class. In ...

Given a subset S subset R^n and a point x in S, the contingent cone K_S(x) at x with respect to S is defined to be the set K_S(x)={h:d_S^-(x;h)=0} where d_S^- is the upper ...

A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...