Results 341 to 350 of about 1,624,125 (375)
Some of the next articles are maybe not open access.
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
IEEE Transactions on Computers, 1981
Summary: Those bases which permit the realization of a planar crossover are characterized.
openaire +1 more source
Summary: Those bases which permit the realization of a planar crossover are characterized.
openaire +1 more source
Planar and non-planar unsaturation—II
Tetrahedron, 1972Abstract A π-electronic method, adapted to the study of non-planar unsaturated molecules, is used to examine the consequences of twisting about the exocyclic bond in derivatives of fulvene and fulvalene. The geometry, electronic spectrum, ionization and reduction potentials of fulvene, 6,6-disubstituted fulvenes, fulvalene, octachlorofulvalene ...
A.Y. Meyer, H. Yinnon
openaire +1 more source
Evidence of topological superconductivity in planar Josephson junctions
Nature, 2018Majorana zero modes—quasiparticle states localized at the boundaries of topological superconductors—are expected to be ideal building blocks for fault-tolerant quantum computing1,2.
A. Fornieri +16 more
semanticscholar +1 more source
The Road Towards Planar Microbatteries and Micro‐Supercapacitors: From 2D to 3D Device Geometries
Advances in Materials, 2019The rapid development and further modularization of miniaturized and self‐powered electronic systems have substantially stimulated the urgent demand for microscale electrochemical energy storage devices, e.g., microbatteries (MBs) and micro ...
Shuanghao Zheng +4 more
semanticscholar +1 more source
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
Liquid‐Crystal‐Mediated Geometric Phase: From Transmissive to Broadband Reflective Planar Optics
Advances in Materials, 2019Planar optical elements that can manipulate the multidimensional physical parameters of light efficiently and compactly are highly sought after in modern optics and nanophotonics.
Peng Chen +3 more
semanticscholar +1 more source
PlaneNet: Piece-Wise Planar Reconstruction from a Single RGB Image
2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2018This paper proposes a deep neural network (DNN) for piece-wise planar depthmap reconstruction from a single RGB image. While DNNs have brought remarkable progress to single-image depth prediction, piece-wise planar depthmap reconstruction requires a ...
Chen Liu +4 more
semanticscholar +1 more source
Lattices contained in planar orders are planar
Algebra Universalis, 1992The following is the main result of the paper. Let \(P\) be a finite ordered set with planar covering graph and let \(\text{cov}(P)\) be its planar representation. Let \(L\) be a truncated lattice contained in \(P\). Then the covering graph of \(L\) has a representation \(\text{cov}(L)\) in which, whenever \(b\) covers \(a\) in \(L\), the edge joining \
Nowakowski, Richard +2 more
openaire +2 more sources