Previous Page 2

Displaying 21 – 40 of 40

Showing per page

The small Ree group 2 G 2 ( 3 2 n + 1 ) and related graph

Alireza K. Asboei, Seyed S. S. Amiri (2018)

Commentationes Mathematicae Universitatis Carolinae

Let G be a finite group. The main supergraph 𝒮 ( G ) is a graph with vertex set G in which two vertices x and y are adjacent if and only if o ( x ) o ( y ) or o ( y ) o ( x ) . In this paper, we will show that G 2 G 2 ( 3 2 n + 1 ) if and only if 𝒮 ( G ) 𝒮 ( 2 G 2 ( 3 2 n + 1 ) ) . As a main consequence of our result we conclude that Thompson’s problem is true for the small Ree group 2 G 2 ( 3 2 n + 1 ) .

The strong persistence property and symbolic strong persistence property

Mehrdad Nasernejad, Kazem Khashyarmanesh, Leslie G. Roberts, Jonathan Toledo (2022)

Czechoslovak Mathematical Journal

Let I be an ideal in a commutative Noetherian ring R . Then the ideal I has the strong persistence property if and only if ( I k + 1 : R I ) = I k for all k , and I has the symbolic strong persistence property if and only if ( I ( k + 1 ) : R I ( 1 ) ) = I ( k ) for all k , where I ( k ) denotes the k th symbolic power of I . We study the strong persistence property for some classes of monomial ideals. In particular, we present a family of primary monomial ideals failing the strong persistence property. Finally, we show that every square-free monomial ideal has the...

Towards a geometric theory for left loops

Karla Baez (2014)

Commentationes Mathematicae Universitatis Carolinae

In [Mwambene E., Multiples of left loops and vertex-transitive graphs, Cent. Eur. J. Math. 3 (2005), no. 2, 254–250] it was proved that every vertex-transitive graph is the Cayley graph of a left loop with respect to a quasi-associative Cayley set. We use this result to show that Cayley graphs of left loops with respect to such sets have some properties in common with Cayley graphs of groups which can be used to study a geometric theory for left loops in analogy to that for groups.

Travel groupoids

Ladislav Nebeský (2006)

Czechoslovak Mathematical Journal

In this paper, by a travel groupoid is meant an ordered pair ( V , * ) such that V is a nonempty set and * is a binary operation on V satisfying the following two conditions for all u , v V : ( u * v ) * u = u ; if ( u * v ) * v = u , then u = v . Let ( V , * ) be a travel groupoid. It is easy to show that if x , y V , then x * y = y if and only if y * x = x . We say that ( V , * ) is on a (finite or infinite) graph G if V ( G ) = V and E ( G ) = { { u , v } u , v V and u u * v = v } . Clearly, every travel groupoid is on exactly one graph. In this paper, some properties of travel groupoids on graphs are studied.

T-Rickart modules

S. Ebrahimi Atani, M. Khoramdel, S. Dolati Pish Hesari (2012)

Colloquium Mathematicae

We introduce the notions of T-Rickart and strongly T-Rickart modules. We provide several characterizations and investigate properties of each of these concepts. It is shown that R is right Σ-t-extending if and only if every R-module is T-Rickart. Also, every free R-module is T-Rickart if and only if R = Z ( R R ) R ' , where R’ is a hereditary right R-module. Examples illustrating the results are presented.

Currently displaying 21 – 40 of 40

Previous Page 2