Search Results for ""

An infinite sequence {a_i} of positive integers is called strongly independent if any relation sumepsilon_ia_i, with epsilon_i=0, +/-1, or +/-2 and epsilon_i=0 except ...

A graph is strongly perfect if every induced subgraph H has an independent vertex set meeting all maximal cliques of H (Berge and Duchet 1984, Ravindra 1999). Every strongly ...

A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a ...

Let C be a curve, let O be a fixed point (the pole), and let O^' be a second fixed point. Let P and P^' be points on a line through O meeting C at Q such that P^'Q=QP=QO^'. ...

A generalization of Ramsey theory to mathematical objects in which one would not normally expect structure to be found. For example, there exists a graph with very few ...

A map phi:M->M where M is a manifold is C^r structurally stable if any C^r perturbation is topologically conjugate to phi. Here, C^r perturbation means a function psi such ...

Let L be a language of the first-order logic. Assume that the language L has the following sets of nonlogical symbols: 1. C is the set of constant symbols of L. (These are ...

The structure constant is defined as iepsilon_(ijk), where epsilon_(ijk) is the permutation symbol. The structure constant forms the starting point for the development of Lie ...

The structure factor S_Gamma of a discrete set Gamma is the Fourier transform of delta-scatterers of equal strengths on all points of Gamma, S_Gamma(k)=intsum_(x in ...

In logic, the term "homomorphism" is used in a manner similar to but a bit different from its usage in abstract algebra. The usage in logic is a special case of a "morphism" ...