Search Results for ""

An element of an adèle group, sometimes called a repartition in older literature (e.g., Chevalley 1951, p. 25). Adèles arise in both number fields and function fields. The ...

A branch point whose neighborhood of values wrap around the range a finite number of times p as their complex arguments theta varies from 0 to a multiple of 2pi is called an ...

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

In the theory of transfinite ordinal numbers, 1. Every well ordered set has a unique ordinal number, 2. Every segment of ordinals (i.e., any set of ordinals arranged in ...

A dimension also called the fractal dimension, Hausdorff dimension, and Hausdorff-Besicovitch dimension in which nonintegral values are permitted. Objects whose capacity ...

An ordinal number is called an initial ordinal if every smaller ordinal has a smaller cardinal number (Moore 1982, p. 248; Rubin 1967, p. 271). The omega_alphas ordinal ...

Let G be a graph with A and B two disjoint n-tuples of graph vertices. Then either G contains n pairwise disjoint AB-paths, each connecting a point of A and a point of B, or ...

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...

For the rational curve of an unperturbed system with rotation number r/s under a map T (for which every point is a fixed point of T^s), only an even number of fixed points ...

The twinplex graph is the graph illustrated above in a number of embeddings which corresponds to the graph labeled Gamma_2 in Fischer and Little (2011). It is a cubic ...