Search Results for ""

There are no fewer than two closely related but somewhat different notions of gerbe in mathematics. For a fixed topological space X, a gerbe on X can refer to a stack of ...

Let lambda be (possibly complex) eigenvalues of a set of random n×n real matrices with entries independent and taken from a standard normal distribution. Then as n->infty, ...

Let a tree S be a subgraph of a cubic graph G. The graph excision G circleminus S is the graph resulting from removing the tree, then merging the edges. For example, if in ...

The graph tensor product, also called the graph cardinal product (Imrich 1998), graph categorical product, graph conjunction, graph direct product (Hammack et al. 2016), ...

The determination of whether a Turing machine will come to a halt given a particular input program. The halting problem is solvable for machines with less than four states. ...

An identity graph, sometimes also known as an asymmetric graph or rigid graph (Albertson and Collins 1996), is a graph possessing a single graph automorphism. The numbers of ...

A class of illusion in which an object which is physically unrealizable is apparently depicted. More than 100 papers have been written about impossible figures (Kulpa 1987), ...

The infimum is the greatest lower bound of a set S, defined as a quantity m such that no member of the set is less than m, but if epsilon is any positive quantity, however ...

A general integral transform is defined by g(alpha)=int_a^bf(t)K(alpha,t)dt, where K(alpha,t) is called the integral kernel of the transform.

The computation of points or values between ones that are known or tabulated using the surrounding points or values. In particular, given a univariate function f=f(x), ...