English
Related papers

Related papers: Divisible design digraphs and association schemes

200 papers

This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…

Combinatorics · Mathematics 2022-06-24 Mizuki Fukuda , Motoko Kotani , Sonia Mahmoudi

This paper gives a construction of group divisible designs on the binary extension fields with block sizes 3, 4, 5, 6, and 7, respectively, which is motivated from the decoding of binary quadratic residue codes. A conjecture is proposed for…

Combinatorics · Mathematics 2017-01-02 Chong-Dao Lee , Yaotsu Chang , Chia-an Liu

A conjugate skew gain graph is a skew gain graph with the labels (also called, the conjugate skew gains) from the field of complex numbes on the oriented edges such that they get conjugated when we reverse the orientation. In this paper we…

Combinatorics · Mathematics 2023-07-13 Shahul Hameed K , Ramakrishnan K O , Biju K

An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…

Combinatorics · Mathematics 2019-03-05 Darren Glass , Joshua Wagner

In this short paper we outline (mostly without proofs) our new approach to the derived category of sheaves of commutative DG rings. The proofs will appear in a subsequent paper. Among other things, we explain how to form the derived…

Algebraic Geometry · Mathematics 2016-08-16 Amnon Yekutieli

We describe $\sigma$-matching, interchangeable and, as a consequence, totally compatible products on some classes of associative algebras, including unital algebras, the semigroup algebras of rectangular bands, algebras with enough…

Rings and Algebras · Mathematics 2025-10-22 Mykola Khrypchenko

It is proved that association schemes with bipartite basis graphs are exactly 2-schemes. This result follows from a characterization of p-schemes for an arbitrary prime p in terms of basis digraphs.

Combinatorics · Mathematics 2015-05-07 Ilia Ponomarenko , Amir Rahnamai Barghi

We construct Hadamard matrices of orders 4x251 = 1004 and 4x631 = 2524, and skew-Hadamard matrices of orders 4x213 = 852 and 4x631 = 2524. As far as we know, such matrices have not been constructed previously. The constructions use the…

Combinatorics · Mathematics 2014-06-13 Dragomir Z. Djokovic , Oleg Golubitsky , Ilias S. Kotsireas

Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have…

Combinatorics · Mathematics 2014-03-24 Oswin Aichholzer , Andrei Asinowski , Tillmann Miltzow

One of the four well-known series of simple Lie algebras of Cartan type is the series of Lie algebras of Special type, which are divergence-free Lie algebras associated with polynomial algebras and the operators of taking partial…

Quantum Algebra · Mathematics 2007-05-23 Yucai Su , Xiaoping Xu

In this paper, we introduce a corresponding between bipartite graphs with a perfect matching and digraphs, which implicates an equivalent relation between the extendibility of bipartite graphs and the strongly connectivity of digraphs. Such…

Combinatorics · Mathematics 2010-11-22 Zan-Bo Zhang , Dingjun Lou

We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.

Combinatorics · Mathematics 2010-04-30 Matthias Hamann , Fabian Hundertmark

For prime powers $q$ and $q+\varepsilon$ where $\varepsilon\in\{1,2\}$, an affine resolvable design from $\mathbb{F}_q$ and Latin squares from $\mathbb{F}_{q+\varepsilon}$ yield a set of symmetric designs if $\varepsilon=2$ and a set of…

Combinatorics · Mathematics 2019-11-21 Hadi Kharaghani , Sho Suda

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

Combinatorics · Mathematics 2021-08-23 C. M. Mynhardt , A. K. Wright

A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph. In this paper, we completely classify the countable connected-homogeneous digraphs.

Combinatorics · Mathematics 2013-11-26 Matthias Hamann

We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general…

Combinatorics · Mathematics 2013-02-12 F. Hivert , J. -C. Novelli , J. -Y. Thibon

A class of differential calculi is explored which is determined by a set of automorphisms of the underlying associative algebra. Several examples are presented. In particular, differential calculi on the quantum plane, the $h$-deformed…

Mathematical Physics · Physics 2008-11-26 Aristophanes Dimakis , Folkert Muller-Hoissen

We classify the pairwise transitive 2-designs, that is, 2-designs such that a group of automorphisms is transitive on the following five sets of ordered pairs: point-pairs, incident point-block pairs, non-incident point-block pairs,…

Combinatorics · Mathematics 2015-01-07 Alice Devillers , Cheryl E. Praeger

For every odd prime power $q$, a family of pairwise nonisomorphic normal arc-transitive divisible design Cayley digraphs with isomorphic neighborhood designs over a Heisenberg group of order $q^3$ is constructed. It is proved that these…

Combinatorics · Mathematics 2024-11-11 Mikhail Muzychuk , Grigory Ryabov

Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us…

Combinatorics · Mathematics 2020-06-02 Kate Lorenzen
‹ Prev 1 4 5 6 7 8 10 Next ›