532 search results - page 6 / 107 » Graphically abelian groups |
ENDM
2007
14 years 9 months ago
2007
For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not c...
APAL
2005
14 years 9 months ago
2005
Abstract. Let n be a positive integer and FA (n) be the free abelian latticeordered group on n generators. We prove that FA (m) and FA (n) do not satisfy the same first-order sente...
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
109
click to vote
COCO
2011
Springer
13 years 9 months ago
2011
Springer
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
APAL
2008
14 years 9 months ago
2008
We study Dedekind cuts on ordered Abelian groups. We introduce a monoid structure on them, and we characterise, via a suitable representation theorem, the universal part of the th...