Search Results for ""

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...

Given a compact manifold M and a transversely orientable codimension-one foliation F on M which is tangent to partialM, the pair (M,F) is called a generalized Reeb component ...

The term "recursive function" is often used informally to describe any function that is defined with recursion. There are several formal counterparts to this informal ...

The reversal of a positive integer abc...z is z...cba. The reversal of a positive integer n is implemented in the Wolfram Language as IntegerReverse[n]. A positive integer ...

The extension ring obtained from a commutative unit ring (other than the trivial ring) when allowing division by all non-zero divisors. The ring of fractions of an integral ...

The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...

Given a Hilbert space H, a *-subalgebra A of B(H) is said to be a von Neumann algebra in H provided that A is equal to its bicommutant A^('') (Dixmier 1981). Here, B(H) ...

Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 and m=2,3, but only a small ...

A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...

A collection of equations satisfies the Hasse principle if, whenever one of the equations has solutions in R and all the Q_p, then the equations have solutions in the ...