We consider strongly regular graphs r = (V, E) on an even number, say 2n, of vertices which admit an automorphism group G of order n which has two orbits on V. Such graphs will be called strongly regular semi-Cayley graphs. For instance, the Petersen graph, the Hoffman-Singleton graph, and the triangular graphs T(q) with q = 5 mod 8 provide examples which cannot be obtained as Cayley graphs. We...

A finitely generated $R$-module is said to be a module of type ($F_r$) if its $(r-1)$-th Fitting ideal is the zero ideal and its $r$-th Fitting ideal is a regular ideal. Let $R$ be a commutative ring and $N$ be a submodule of  $R^n$ which is generated by columns of  a matrix $A=(a_{ij})$ with $a_{ij}in R$ for all $1leq ileq n$, $jin Lambda$, where $Lambda $ is a (possibly infinite) index set.  ...

We consider strongly regular graphs defined on a finite field by taking the union of some cyclotomic classes as difference set. Several new examples are found.

Hara [Ha3] and Smith [Sm2] independently proved that in a normal Q-Gorenstein ring of characteristic p ≫ 0, the test ideal coincides with the multiplier ideal associated to the trivial divisor. We extend this result for a pair (R,∆) of a normal ring R and an effective Q-Weil divisor ∆ on SpecR. As a corollary, we obtain the equivalence of strongly F-regular pairs and klt pairs.

A left almost semigroup (LA-semigroup) or an Abel-Grassmann’s groupoid (AG-groupoid) is investigated in several papers. In this paper we have discussed ideals in LA-semigroups. Specifically, we have shown that every ideal in an LA-semigroup S with left identity e is prime if and only if it is idempotent and the set of ideals of S is totally ordered under inclusion. We have shown that an ideal o...

In this paper, we examine the structure of vertexand edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using the Classification of Finite Simple Groups) that no graph in this family has a holomorphic simple automorphism group. We also find some constraints on the parame...

Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m, 2m +m, m +m, m +m). Strongly regular graphs with these parameters have been called max energy graphs, because they have maximal energy (as defined by ...