Search Results for ""

Consider the number of sequences that can be formed from permutations of a set of elements such that each partial sum is nonnegative. The number of sequences with nonnegative ...

The set of natural numbers (the positive integers Z-+ 1, 2, 3, ...; OEIS A000027), denoted N, also called the whole numbers. Like whole numbers, there is no general agreement ...

A group automorphism is an isomorphism from a group to itself. If G is a finite multiplicative group, an automorphism of G can be described as a way of rewriting its ...

A sheaf is a presheaf with "something" added allowing us to define things locally. This task is forbidden for presheaves in general. Specifically, a presheaf F on a ...

An algebraic function is a function f(x) which satisfies p(x,f(x))=0, where p(x,y) is a polynomial in x and y with integer coefficients. Functions that can be constructed ...

A product space product_(i in I)X_i is compact iff X_i is compact for all i in I. In other words, the topological product of any number of compact spaces is compact. In ...

In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...

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