Related papers: Isometry Groups of Combinatorial Codes
The paper contains a survey of train constructions for infinite symmetric groups and related groups. For certain pairs (a group $G$, a subgroup $K$), we construct categories, whose morphisms are two-dimensional surfaces tiled by polygons…
It is known that, for the algebra of functions on a Kleinian singularity, the parameter space of deformations and the parameter space of quantizations coincide. We prove that, for a Kleinian singularity of type $\mathbf{A}$ or $\mathbf{D}$,…
We show that Thompson's group F is the symmetry group of the "generic idempotent". That is, take the monoidal category freely generated by an object A and an isomorphism A \otimes A --> A; then F is the group of automorphisms of A.
In this paper, several conjectures proposed in [2] are studied, involving the equivalence and duality of polycyclic codes associated with trinomials. According to the results, we give methods to construct isodual and self-dual polycyclic…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…
An equivalent description of a symmetric monoidal category is introduced in which, instead of separate associator and commutator isomorphisms satisfying the usual coherence axioms, we simply have associo-commutator isomorphisms satisfying…
We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…
We obtain explicit formulas for the rational homotopy groups of generalised symmetric spaces, i.e., the homogeneous spaces for which the isotropy subgroup appears as the fixed point group of some finite order automorphism of the group. In…
This paper investigates the concept of self-dual convolutional code. We derive the basic properties of this interesting class of codes and we show how some of the techniques to construct self-dual linear block codes generalize to self-dual…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…
We give a general criterion for the (bounded) simplicity of the automorphism groups of certain countable structures and apply it to show that the isometry group of the Urysohn space modulo the normal subgroup of bounded isometries is a…
Group codes are right or left ideals in a group algebra of a finite group over a finite field. Following ideas of Bazzi and Mitter on group codes over the binary field, we prove that group codes over finite fields of any characteristic are…
We study the automorphism group of an idempotent evolution algebra, show that any finite group can be the automorphism group of an evolution algebra, and describe certain evolution algebras with given automorphism groups. In particular, we…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
The inner automorphisms of a group G can be characterized within the category of groups without reference to group elements: they are precisely those automorphisms of G that can be extended, in a functorial manner, to all groups H given…
Given a simply connected space $X$, there are several, a priori different, algebraic groups whose groups of $\mathbb Q$-points are isomorphic to the group of homotopy classes of homotopy automorphisms of the rationalization of $X$. We will…
We describe the groups of automorphisms of two generated free braided associative algebras with involutive diagonal braidings over a field of characteristic $\neq 2$. Depending on the form of the diagonal involutive braiding, five different…