✦ LIBER ✦

Orthogonal starters in finite abelian groups

✍ Scribed by J.D. Horton

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 868 KB
Volume: 79
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90335-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite automata presentable abelian grou

Finite automata presentable abelian groups

✍ André Nies; Pavel Semukhin 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 622 KB

Generalized flags in finite Abelian p-gr

Generalized flags in finite Abelian p-groups

✍ Lynne M. Butler 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 852 KB

Addition Theorems for Finite Abelian Gro

Addition Theorems for Finite Abelian Groups

✍ W.D. Gao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Let \(a_{1}, \ldots, a_{k}\) be a sequence of elements in an Abelian group of order \(n\) (repetition allowed). In this paper, we give two sufficient conditions such that an element \(g \in G\) can be written in the form \(g=a_{i_{1}}+a_{i_{2}}+\cdots+a_{i_{n}}, 1 \leqslant i_{1}<i_{2}<\cdots<i_{n}

Thin bases for finite abelian groups

✍ Xing-De Jia 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 115 KB

Circuits in cayley digraphs of finite ab

Circuits in cayley digraphs of finite abelian groups

✍ Anne Marie Wilkinson 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB

## Abstract We find all possible lengths of circuits in Cayley digraphs of two‐generated abelian groups over the two‐element generating sets and over certain three‐element generating sets.

A Combinatorial Problem on Finite Abelia

A Combinatorial Problem on Finite Abelian Groups

✍ W.D. Gao 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 186 KB

In this paper the following theorem is proved. Let G be a finite Abelian group of order n. Then, n+D(G )&1 is the least integer m with the property that for any sequence of m elements a 1 , ..., a m in G, 0 can be written in the form 0= a 1 + } } } +a in with 1 i 1 < } } } <i n m, where D(G) is the