Results 271 to 280 of about 23,182 (295)
Some of the next articles are maybe not open access.
IEEE Transactions on Computers, 1981
Summary: Those bases which permit the realization of a planar crossover are characterized.
openaire +2 more sources
Summary: Those bases which permit the realization of a planar crossover are characterized.
openaire +2 more sources
Journal of Knot Theory and Its Ramifications, 2002
Let S be a connected open subset of 2-sphere S2 which is identified with the extended plane R2 ∪ {∞}. We assume that S contains the n segments {1, 2, …, n} × [-1, 1]. An n-lace ℓ (in S) is the union ℓ1 ∪ … ∪ ℓn of disjoint simple arcs in S such that ∂ ℓi = {(i, 1), (π (i),-1)}, i = 1, …, n, for some permutation π of {1, 2, …, n}.
Jin, GT Jin, Gyo Taek, Kim, H
openaire +2 more sources
Let S be a connected open subset of 2-sphere S2 which is identified with the extended plane R2 ∪ {∞}. We assume that S contains the n segments {1, 2, …, n} × [-1, 1]. An n-lace ℓ (in S) is the union ℓ1 ∪ … ∪ ℓn of disjoint simple arcs in S such that ∂ ℓi = {(i, 1), (π (i),-1)}, i = 1, …, n, for some permutation π of {1, 2, …, n}.
Jin, GT Jin, Gyo Taek, Kim, H
openaire +2 more sources
Communications in Contemporary Mathematics, 2000
An embedding of a space Y into the 3-sphere S 3 is said to be strictly achiral if its image is pointwise fixed by an orientation reversing homeomorphism of S 3 . A space Y is said to be abstractly planar if it can be embedded into the 2-sphere S
Jiang, Boju, Wang, Shicheng
openaire +1 more source
An embedding of a space Y into the 3-sphere S 3 is said to be strictly achiral if its image is pointwise fixed by an orientation reversing homeomorphism of S 3 . A space Y is said to be abstractly planar if it can be embedded into the 2-sphere S
Jiang, Boju, Wang, Shicheng
openaire +1 more source
Journal of Chromatography A, 2004
Recent developments in planar electrochromatography (PEC) in both the normal-phase and the reversed-phase modes, and at both atmospheric and elevated pressure, are reviewed. Other forced-flow techniques in planar chromatography are also briefly covered.
openaire +2 more sources
Recent developments in planar electrochromatography (PEC) in both the normal-phase and the reversed-phase modes, and at both atmospheric and elevated pressure, are reviewed. Other forced-flow techniques in planar chromatography are also briefly covered.
openaire +2 more sources
Canadian Journal of Mathematics, 1975
A finite partially ordered set (poset) P is customarily represented by drawing a small circle for each point, with a lower than b whenever a < b in P, and drawing a straight line segment from a to b whenever a is covered by b in P (see, for example, G. Birkhoff [2, p. 4]). A poset P is planar if such a diagram can be drawn for P in which none of the
Kelly, David, Rival, Ivan
openaire +2 more sources
A finite partially ordered set (poset) P is customarily represented by drawing a small circle for each point, with a lower than b whenever a < b in P, and drawing a straight line segment from a to b whenever a is covered by b in P (see, for example, G. Birkhoff [2, p. 4]). A poset P is planar if such a diagram can be drawn for P in which none of the
Kelly, David, Rival, Ivan
openaire +2 more sources
Results in Mathematics, 1996
All rings that are planar near-rings are characterized and constructed. For each vector space over a nontrivial division ring there is precisely one isomorphism class of such rings.
openaire +2 more sources
All rings that are planar near-rings are characterized and constructed. For each vector space over a nontrivial division ring there is precisely one isomorphism class of such rings.
openaire +2 more sources
On boolean characterizations of planarity and planar embeddings of graphs
Annals of Operations Research, 1990The author introduces a new planarity characterization for graphs, involving the solution of a quadratic Boolean equation. He then discusses seven combinatorially distinct configurations, called planarity obstacles, which lead to a graph whose order and size are linear functions of those of the original graph. Testing for planarity and finding a planar
openaire +2 more sources
A new perspective on clustered planarity as a combinatorial embedding problem
Theoretical Computer Science, 2016Ignaz Rutter
exaly