Graph coloring applied to secure computation in non-Abelian groups

We study the natural problem of secure n-party computation (in the computationally unbounded attack model) of circuits over an arbitrary finite non-Abelian group (G,⋅), which we call G-circuits. Besides its intrinsic interest, this problem is also motivating by a completeness result of Barrington, stating that such protocols can be applied for general secure computation of arbitrary functions. For flexibility, we are interested in protocols which only require black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our investigations focus on the passive adversarial model, where up to t of the n participating parties are corrupted.

Sheaf representations of MV-algebras and lattice-ordered abelian groups via duality

We study representations of MV-algebras -- equivalently, unital lattice-ordered abelian groups -- through the lens of Stone-Priestley duality, using canonical extensions as an essential tool. Specifically, the theory of canonical extensions implies that the (Stone-Priestley) dual spaces of MV-algebras carry the structure of topological partial commutative ordered semigroups. We use this structure to obtain two different decompositions of such spaces, one indexed over the prime MV-spectrum, the other over the maximal MV-spectrum. These decompositions yield sheaf representations of MV-algebras, using a new and purely duality-theoretic result that relates certain sheaf representations of distributive lattices to decompositions of their dual spaces. Importantly, the proofs of the MV-algebraic representation theorems that we obtain in this way are distinguished from the existing work on this topic by the following features: (1) we use only basic algebraic facts about MV-algebras; (2) we show that the two aforementioned sheaf representations are special cases of a common result, with potential for generalizations; and (3) we show that these results are strongly related to the structure of the Stone-Priestley duals of MV-algebras. In addition, using our analysis of these decompositions, we prove that MV-algebras with isomorphic underlying lattices have homeomorphic maximal MV-spectra. This result is an MV-algebraic generalization of a classical theorem by Kaplansky stating that two compact Hausdorff spaces are homeomorphic if, and only if, the lattices of continuous [0, 1]-valued functions on the spaces are isomorphic.

Isomorphism of Commutative Group Algebras of Finite Abelian Groups

Let a commutative ring R be a direct product of indecomposable rings with identity and let G be a finite abelian p-group. In the present paper we give a complete system of invariants of the group algebra RG of G over R when p is an invertible element in R. These investigations extend some classical results of Berman (1953 and 1958), Sehgal (1970) and Karpilovsky (1984) as well as a result of Mollov (1986).

Universal Abelian topological groups

A topological group G is said to be universal in a class K of topological groups if G is an element of K and if for every group H is an element of K there is a subgroup K of G that is isomorphic to H as a topological group. A group is constructed that is universal in the class of separable metrizable topological Abelian groups.

Abelian torsion groups with a countably compact group topology

Comfort and Remus [W.W. Comfort, D. Remus, Abelian torsion groups with a pseudo-compact group topology, Forum Math. 6 (3) (1994) 323-337] characterized algebraically the Abelian torsion groups that admit a pseudocompact group topology using the Ulm-Kaplansky invariants. We show, under a condition weaker than the Generalized Continuum Hypothesis, that an Abelian torsion group (of any cardinality) admits a pseudocompact group topology if and only if it admits a countably compact group topology. Dikranjan and Tkachenko [D. Dikranjan. M. Tkachenko, Algebraic structure of small countably compact Abelian groups, Forum Math. 15 (6) (2003) 811-837], and Dikranjan and Shakhmatov [D. Dikranjan. D. Shakhmatov, Forcing hereditarily separable compact-like group topologies on Abelian groups, Topology Appl. 151 (1-3) (2005) 2-54] showed this equivalence for groups of cardinality not greater than 2(c). We also show, from the existence of a selective ultrafilter, that there are countably compact groups without non-trivial convergent sequences of cardinality kappa(omega), for any infinite cardinal kappa. In particular, it is consistent that for every cardinal kappa there are countably compact groups without non-trivial convergent sequences whose weight lambda has countable cofinality and lambda > kappa. (C) 2009 Elsevier B.V. All rights reserved.

Linear time algorithms for Abelian group isomorphism and related problems

We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(n log n) [Narayan Vikas, An O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism, J. Comput. System Sci. 53 (1996) 1-9] known for this problem. We solve a more general problem of computing the orders of all the elements of any group (not necessarily Abelian) of size n in O(n) time. Our algorithm for isomorphism testing of Abelian groups follows from this result. We use the property that our order finding algorithm works for any group to design a simple O(n) algorithm for testing whether a group of size n, described by its multiplication table, is nilpotent. We also give an O(n) algorithm for determining if a group of size n, described by its multiplication table, is Abelian. (C) 2007 Elsevier Inc. All rights reserved.

On spectra of abelian group rings

In this paper we study the spectrum of integral group rings of finitely generated abelian groups G from the scheme-theoretic viewpoint. We prove that the (closed) singular points of Spec Z[G], the (closed) intersection points of the irreducible components of Spec Z[G] and the (closed) points over the prime divisors of vertical bar t(G)vertical bar coincide. We also determine the formal completion of Spec Z[G] at a singular point.

Hamilton decompositions of 6-regular abelian Cayley graphs

In 1969, Lovasz asked whether every connected, vertex-transitive graph has a Hamilton path. This question has generated a considerable amount of interest, yet remains vastly open. To date, there exist no known connected, vertex-transitive graph that does not possess a Hamilton path. For the Cayley graphs, a subclass of vertex-transitive graphs, the following conjecture was made: Weak Lovász Conjecture: Every nontrivial, finite, connected Cayley graph is hamiltonian. The Chen-Quimpo Theorem proves that Cayley graphs on abelian groups flourish with Hamilton cycles, thus prompting Alspach to make the following conjecture: Alspach Conjecture: Every 2k-regular, connected Cayley graph on a finite abelian group has a Hamilton decomposition. Alspach’s conjecture is true for k = 1 and 2, but even the case k = 3 is still open. It is this case that this thesis addresses. Chapters 1–3 give introductory material and past work on the conjecture. Chapter 3 investigates the relationship between 6-regular Cayley graphs and associated quotient graphs. A proof of Alspach’s conjecture is given for the odd order case when k = 3. Chapter 4 provides a proof of the conjecture for even order graphs with 3-element connection sets that have an element generating a subgroup of index 2, and having a linear dependency among the other generators. Chapter 5 shows that if Γ = Cay(A, {s1, s2, s3}) is a connected, 6-regular, abelian Cayley graph of even order, and for some1 ≤ i ≤ 3, Δi = Cay(A/(si), {sj1 , sj2}) is 4-regular, and Δi ≄ Cay(ℤ3, {1, 1}), then Γ has a Hamilton decomposition. Alternatively stated, if Γ = Cay(A, S) is a connected, 6-regular, abelian Cayley graph of even order, then Γ has a Hamilton decomposition if S has no involutions, and for some s ∈ S, Cay(A/(s), S) is 4-regular, and of order at least 4. Finally, the Appendices give computational data resulting from C and MAGMA programs used to generate Hamilton decompositions of certain non-isomorphic Cayley graphs on low order abelian groups.

Abelian varieties.

Bibliography: p. 245-252.

Fundamental Investigations on the Unit Groups of Commutative Group Algebras in Bulgaria

In this paper we give the first investigations and also some basic results on the unit groups of commutative group algebras in Bulgaria. These investigations continue some classical results. Namely, it is supposed that the cardinality of the starting group is arbitrary.

Sylow P-Subgroups of Abelian Group Rings

2000 Mathematics Subject Classification: Primary 20C07, 20K10, 20K20, 20K21; Secondary 16U60, 16S34.

“Varopoulos paradigm”: Mackey property versus metrizability in topological groups.

The class of all locally quasi-convex (lqc) abelian groups contains all locally convex vector spaces (lcs) considered as topological groups. Therefore it is natural to extend classical properties of locally convex spaces to this larger class of abelian topological groups. In the present paper we consider the following well known property of lcs: “A metrizable locally convex space carries its Mackey topology ”. This claim cannot be extended to lqc-groups in the natural way, as we have recently proved with other coauthors (Außenhofer and de la Barrera Mayoral in J Pure Appl Algebra 216(6):1340–1347, 2012; Díaz Nieto and Martín Peinador in Descriptive Topology and Functional Analysis, Springer Proceedings in Mathematics and Statistics, Vol 80 doi:10.1007/978-3-319-05224-3_7, 2014; Dikranjan et al. in Forum Math 26:723–757, 2014). We say that an abelian group G satisfies the Varopoulos paradigm (VP) if any metrizable locally quasi-convex topology on G is the Mackey topology. In the present paper we prove that in any unbounded group there exists a lqc metrizable topology that is not Mackey. This statement (Theorem C) allows us to show that the class of groups satisfying VP coincides with the class of finite exponent groups. Thus, a property of topological nature characterizes an algebraic feature of abelian groups.

Mackey topology on locally convex spaces and on locally quasi-convex groups. Similarities and historical remarks

A counterpart of the Mackey–Arens Theorem for the class of locally quasi-convex topological Abelian groups (LQC-groups) was initiated in Chasco et al. (Stud Math 132(3):257–284, 1999). Several authors have been interested in the problems posed there and have done clarifying contributions, although the main question of that source remains open. Some differences between the Mackey Theory for locally convex spaces and for locally quasi-convex groups, stem from the following fact: The supremum of all compatible locally quasi-convex topologies for a topological abelian group G may not coincide with the topology of uniform convergence on the weak quasi-convex compact subsets of the dual groupG∧. Thus, a substantial part of the classical Mackey–Arens Theorem cannot be generalized to LQC-groups. Furthermore, the mentioned fact gives rise to a grading in the property of “being a Mackey group”, as defined and thoroughly studied in Díaz Nieto and Martín-Peinador (Proceedings in Mathematics and Statistics 80:119–144, 2014). At present it is not known—and this is the main open question—if the supremum of all the compatible locally quasi-convex topologies on a topological group is in fact a compatible topology. In the present paper we do a sort of historical review on the Mackey Theory, and we compare it in the two settings of locally convex spaces and of locally quasi-convex groups. We point out some general questions which are still open, under the name of Problems.

A subexponential construction of graph coloring for multiparty computation

We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any tAbelian groups can be reduced to finding a t-reliable n-coloring of planar graphs, we show the construction of such a graph which allows a path from the input nodes to the output nodes when any t-party subset is in the possession of the adversary. Unlike the deterministic constructions from Desmedt et al. (2012) our construction has subexponential complexity and is optimal at the same time, i.e., it is secure for any t