Orthogonality graphs of real Cayley–Dickson algebras. Part I: Doubly alternative zero divisors and their hexagons

Author(s):  
Svetlana Zhilina

We study zero divisors whose components alternate strongly pairwise and construct oriented hexagons in the zero divisor graph of an arbitrary real Cayley–Dickson algebra. In case of the algebras of the main sequence, the zero divisor graph coincides with the orthogonality graph, and any hexagon can be extended to a double hexagon. We determine the multiplication table of the vertices of a double hexagon. Then we find a sufficient condition for three elements to generate an alternative subalgebra of an arbitrary Cayley–Dickson algebra. Finally, we consider those zero divisors whose components are both standard basis elements up to sign. We classify them and determine necessary and sufficient conditions under which two such elements are orthogonal.

2018 ◽  
Vol 17 (03) ◽  
pp. 1850050 ◽  
Author(s):  
Avinash Patil ◽  
B. N. Waphare

For a *-ring [Formula: see text], we associate a simple undirected graph [Formula: see text] having all nonzero left zero-divisors of [Formula: see text] as vertices and, two vertices [Formula: see text] and [Formula: see text] are adjacent if [Formula: see text]. In case of Artinian *-rings and Rickart *-rings, characterizations are obtained for those *-rings having [Formula: see text] a complete graph or a star graph, and sufficient conditions are obtained for [Formula: see text] to be connected and also for [Formula: see text] to be disconnected. For a Rickart *-ring [Formula: see text], we characterize the girth of [Formula: see text] and prove a sort of Beck’s conjecture.


2020 ◽  
Vol 18 (1) ◽  
pp. 1540-1551
Author(s):  
Jung Wook Lim ◽  
Dong Yeol Oh

Abstract Let ({\mathrm{\Gamma}},\le ) be a strictly ordered monoid, and let {{\mathrm{\Gamma}}}^{\ast }\left={\mathrm{\Gamma}}\backslash \{0\} . Let D\subseteq E be an extension of commutative rings with identity, and let I be a nonzero proper ideal of D. Set \begin{array}{l}D+[\kern-2pt[ {E}^{{{\mathrm{\Gamma}}}^{\ast },\le }]\kern-2pt] := \left\{f\in [\kern-2pt[ {E}^{{\mathrm{\Gamma}},\le }]\kern-2pt] \hspace{0.15em}|\hspace{0.2em}f(0)\in D\right\}\hspace{.5em}\text{and}\\ \hspace{0.2em}D+[\kern-2pt[ {I}^{{\Gamma }^{\ast },\le }]\kern-2pt] := \left\{f\in [\kern-2pt[ {D}^{{\mathrm{\Gamma}},\le }]\kern-2pt] \hspace{0.15em}|\hspace{0.2em}f(\alpha )\in I,\hspace{.5em}\text{for}\hspace{.25em}\text{all}\hspace{.5em}\alpha \in {{\mathrm{\Gamma}}}^{\ast }\right\}.\end{array} In this paper, we give necessary conditions for the rings D+[\kern-2pt[ {E}^{{{\mathrm{\Gamma}}}^{\ast },\le }]\kern-2pt] to be Noetherian when ({\mathrm{\Gamma}},\le ) is positively ordered, and sufficient conditions for the rings D+[\kern-2pt[ {E}^{{{\mathrm{\Gamma}}}^{\ast },\le }]\kern-2pt] to be Noetherian when ({\mathrm{\Gamma}},\le ) is positively totally ordered. Moreover, we give a necessary and sufficient condition for the ring D+[\kern-2pt[ {I}^{{\Gamma }^{\ast },\le }]\kern-2pt] to be Noetherian when ({\mathrm{\Gamma}},\le ) is positively totally ordered. As corollaries, we give equivalent conditions for the rings D+({X}_{1},\ldots ,{X}_{n})E{[}{X}_{1},\ldots ,{X}_{n}] and D+({X}_{1},\ldots ,{X}_{n})I{[}{X}_{1},\ldots ,{X}_{n}] to be Noetherian.


2000 ◽  
Vol 11 (03) ◽  
pp. 515-524
Author(s):  
TAKESI OKADOME

The paper deals with learning in the limit from positive data. After an introduction and overview of earlier results, we strengthen a result of Sato and Umayahara (1991) by establishing a necessary and sufficient condition for the satisfaction of Angluin's (1980) finite tell-tale condition. Our other two results show that two notions introduced here, the finite net property and the weak finite net property, lead to sufficient conditions for learning in the limit from positive data. Examples not solvable by earlier methods are also given.


2007 ◽  
Vol 7 (7) ◽  
pp. 624-638
Author(s):  
J. de Vicente

We study the separability of bipartite quantum systems in arbitrary dimensions using the Bloch representation of their density matrix. This approach enables us to find an alternative characterization of the separability problem, from which we derive a necessary condition and sufficient conditions for separability. For a certain class of states the necessary condition and a sufficient condition turn out to be equivalent, therefore yielding a necessary and sufficient condition. The proofs of the sufficient conditions are constructive, thus providing decompositions in pure product states for the states that satisfy them. We provide examples that show the ability of these conditions to detect entanglement. In particular, the necessary condition is proved to be strong enough to detect bound entangled states.


Pythagoras ◽  
2010 ◽  
Vol 0 (71) ◽  
Author(s):  
Shunmugam Pillay ◽  
Poobhalan Pillay

The centre of mass G of a triangle has the property that the rays to the vertices from G sweep out triangles having equal areas. We show that such points, termed equipartitioning points in this paper, need not exist in other polygons. A necessary and sufficient condition for a quadrilateral to have an equipartitioning point is that one of its diagonals bisects the other. The general theorem, namely, necessary and sufficient conditions for equipartitioning points for arbitrary polygons to exist, is also stated and proved. When this happens, they are in general, distinct from the centre of mass. In parallelograms, and only in them, do the two points coincide.


2004 ◽  
Vol 134 (6) ◽  
pp. 1177-1197 ◽  
Author(s):  
Martin Krupa ◽  
Ian Melbourne

Systems possessing symmetries often admit robust heteroclinic cycles that persist under perturbations that respect the symmetry. In previous work, we began a systematic investigation into the asymptotic stability of such cycles. In particular, we found a sufficient condition for asymptotic stability, and we gave algebraic criteria for deciding when this condition is also necessary. These criteria are satisfied for cycles in R3.Field and Swift, and Hofbauer, considered examples in R4 for which our sufficient condition for stability is not optimal. They obtained necessary and sufficient conditions for asymptotic stability using a transition-matrix technique.In this paper, we combine our previous methods with the transition-matrix technique and obtain necessary and sufficient conditions for asymptotic stability for a larger class of heteroclinic cycles. In particular, we obtain a complete theory for ‘simple’ heteroclinic cycles in R4 (thereby proving and extending results for homoclinic cycles that were stated without proof by Chossat, Krupa, Melbourne and Scheel). A partial classification of simple heteroclinic cycles in R4 is also given. Finally, our stability results generalize naturally to higher dimensions and many of the higher-dimensional examples in the literature are covered by this theory.


2019 ◽  
Vol 19 (08) ◽  
pp. 2050155
Author(s):  
Gaohua Tang ◽  
Guangke Lin ◽  
Yansheng Wu

In this paper, we introduce the concept of the associate class graph of zero-divisors of a commutative ring [Formula: see text], denoted by [Formula: see text]. Some properties of [Formula: see text], including the diameter, the connectivity and the girth are investigated. Utilizing this graph, we present a new class of counterexamples of Beck’s conjecture on the chromatic number of the zero-divisor graph of a commutative ring.


1972 ◽  
Vol 18 (2) ◽  
pp. 129-136 ◽  
Author(s):  
Ian Anderson

A graph G is said to possess a perfect matching if there is a subgraph of G consisting of disjoint edges which together cover all the vertices of G. Clearly G must then have an even number of vertices. A necessary and sufficient condition for G to possess a perfect matching was obtained by Tutte (3). If S is any set of vertices of G, let p(S) denote the number of components of the graph G – S with an odd number of vertices. Then the conditionis both necessary and sufficient for the existence of a perfect matching. A simple proof of this result is given in (1).


2008 ◽  
Vol 24 (3) ◽  
pp. 823-828 ◽  
Author(s):  
Henghsiu Tsai ◽  
Kung-Sik Chan

We consider the parameter restrictions that need to be imposed to ensure that the conditional variance process of a GARCH(p,q) model remains nonnegative. Previously, Nelson and Cao (1992, Journal of Business ’ Economic Statistics 10, 229–235) provided a set of necessary and sufficient conditions for the aforementioned nonnegativity property for GARCH(p,q) models with p ≤ 2 and derived a sufficient condition for the general case of GARCH(p,q) models with p ≥ 3. In this paper, we show that the sufficient condition of Nelson and Cao (1992) for p ≥ 3 actually is also a necessary condition. In addition, we point out the linkage between the absolute monotonicity of the generalized autoregressive conditional heteroskedastic (GARCH) generating function and the nonnegativity of the GARCH kernel, and we use it to provide examples of sufficient conditions for this nonnegativity property to hold.


2010 ◽  
Vol 1 (3) ◽  
pp. 17-30
Author(s):  
Huiwen Deng ◽  
Huan Jiang

In this paper, the authors investigate the ordering property (OP), , together with the general form of the law of importation(LI), i.e., , whereis a t-norm andis a fuzzy implication for the four main classes of fuzzy implications. The authors give necessary and sufficient conditions under which both (OP) and (LI) holds for S-, R-implications and some specific families of QL-, D-implications. Following this, the paper proposes the sufficient condition under which the equivalence between CRI and triple I method for FMP can be established. Moreover, this conclusion can be viewed as a unified triple I method, a generalized form of the known results proposed by Wang and Pei.


Sign in / Sign up

Export Citation Format

Share Document