Related papers: Divisible design graphs from symplectic graphs ove…
Symplectic (respectively orthogonal) triple systems provide constructions of Lie algebras (resp. superalgebras). However, in characteristic 3, it is shown that this role can be interchanged and that Lie superalgebras (resp. algebras) can be…
In this paper we define two infinite families of graphs called C-$\delta$ graphs and $\delta$- graph and prove that $\delta$-graphs satisfy $\delta$ conjecture. Also we introduce a family of C-$\delta$ graphs from which we can identify…
Using cyclotomic classes of order twelve for certain finite fields, we construct an infinite family of almost difference sets and normally regular graphs applying the theory of cyclotomy. We show that in each of these fields neither the…
We study a family of graphs with diameter two and asymptotically optimal order for their maximum degree, obtained from perfect difference sets. We show that for all known examples of perfect difference sets, the graph we obtain is…
Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…
Divisible design graphs were introduced in 2011 by Haemers, Kharaghani and Meulenberg. Further, divisible design graphs which can be obtained as Cayley graphs were recently studied by Kabanov and Shalaginov. In this paper we give new…
We provide an infinite family of diffeomorphic symplectic forms on ruled surfaces, which are pairwise non-isotopic. This answers a uniqueness question regarding symplectic structures up to isotopy on closed symplectic four-manifolds.
We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…
In this paper, we introduce a flip operation on self-complementary ideals of chain product posets and study the resulting flip graphs. We give asymptotics for the number of vertices in these graphs, compute their diameters, and give bounds…
This paper presents a novel approach to constructing finite generating sets for infinitely generated ideals. By integrating algebraic and computational techniques, we provide a method to identify finite generators, demonstrated through…
We introduce a new infinite family of regular graphs admitting nested solutions in the edge-isoperimetric problem for all their Cartesian powers. The obtained results include as special cases most of previously known results in this area.
We want to introduce a construction of spherical designs from finite graphs with the theory of crystal lattice. We start from a finite graph, and we consider standard realization of the crystal lattices as the maximal Abelian covering of…
In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters…
The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. A basic property of the critical ideals of graphs asserts that the graphs with at most k trivial critical ideals,…
Distance ideals generalize the Smith normal form of the distance matrix of a graph. The family of graphs with 2 trivial distance ideals contains the family of graphs whose distance matrix has at most 2 invariant factors equal to 1. Here we…
We construct explicit families of graphs whose eigenvalues are asymptotically distributed according to Wigner's semicircle law; in other words, that are spectrally indistinguishable from random graphs. However, in other respects they are…
Let $S$ be a semigroup with $0$ and $R$ be a ring with $1$. We extend the definition of the zero-divisor graphs of commutative semigroups to not necessarily commutative semigroups. We define an annihilating-ideal graph of a ring as a…
We find new constructions of infinite families of skew Hadamard difference sets in elementary abelian groups under the assumption of the existence of cyclotomic strongly regular graphs. Our construction is based on choosing cyclotomic…
In this paper, we introduce some particular families of graphicable algebras obtained by following a relatively new line of research, initiated previously by some of the authors. It consists of the use of certain objects of Discrete…
A $k$-regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbors, and two…