Related papers: A note on regular subgroups of the automorphism gr…
We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erd\H{o}s-R\'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the…
We study stable W-length in groups, especially for W equal to the n-fold commutator gamma_n:=[x_1,[x_2, . . . [x_{n-1},x_n]] . . . ]. We prove that in any perfect group, for any n at least 2 and any element g, the stable commutator length…
We prove a power law for the asymptotic decay of the Favard length of neighbourhoods of certain self-similar sets in $\mathbb{R}^d$ with $d \geq 2$. These self-similar sets are generalizations of the so-called four-corner Cantor set to…
We prove that the displacement group of the dihedral quandle with n elements is isomorphic to the group generated by rotations of the n/2-gon when n is even and the n-gon when n is odd. We additionally show that any quandle with at least…
A mixed dihedral group is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper, for each $n\geq 2$, we construct a…
The definition and properties of the Euler-Lagrange cohomology groups $H^{2k-1}$, $1 \leqslant k \leqslant n$, on a symplectic manifold $({\cal M}^{2n},\omega)$ are given and studied. For $k = 1$ and $k = n$, they are isomorphic to the…
We consider a code to be a subset of the vertex set of a Hamming graph. The set of $s$-neighbours of a code is the set of vertices, not in the code, at distance $s$ from some codeword, but not distance less than $s$ from any codeword. A…
We study finite groups that occur as combinatorial automorphism groups or geometric symmetry groups of convex polytopes. When $\Gamma$ is a subgroup of the combinatorial automorphism group of a convex $d$-polytope, $d\geq 3$, then there…
The distinguishing number $D(\Gamma)$ of a graph $\Gamma$ is the least size of a partition of the vertices of $\Gamma$ such that no non-trivial automorphism of $\Gamma$ preserves this partition. We show that if the automorphism group of a…
We study a class of graph Hamiltonians given by a type of quiver representation to which we can associate (non)--commutative geometries. By selecting gauging data these geometries are realized by matrices through an explicit construction or…
The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…
We determine a condition on the minimum Hamming weight of some special abelian group codes and, as a consequence of this result, we establish that any such code is, up to permutational equivalence, a subspace of the direct sum of $s$ copies…
In the standard orbit model on shape analysis, a group of diffeomorphism on the ambient space equipped with a right invariant sub-riemannian metric acts on a space of shapes and induces a sub-riemannian structure on various spaces. An…
We study Hamiltonicity and pancyclicity in the graph obtained as the union of a deterministic $n$-vertex graph $H$ with $\delta(H)\geq\alpha n$ and a random $d$-regular graph $G$, for $d\in\{1,2\}$. When $G$ is a random $2$-regular graph,…
The Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary code of length n and minimum distance d satisfies A_2(n,d) >= 2^n/V(n,d-1) where V(n,d) stands for the volume of a Hamming ball of radius d. Recently Jiang and…
We prove that an automorphism of order 3 of a putative binary self-dual [120, 60, 24] code C has no fixed points. Moreover, the order of the automorphism group of C divides 2^a.3.5.7.19.23.29 where a is a nonegative integer. Automorphisms…
Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…
The group of 2-by-2 matrices with integer entries and determinant $\pm > 1$ can be identified either with the group of outer automorphisms of a rank two free group or with the group of isotopy classes of homeomorphisms of a 2-dimensional…
Regular hypermaps with underlying simple hypergraphs are analysed. We obtain an algorithm to classify the regular embeddings of simple hypergraphs with given order, and determine the automorphism groups of regular embedding of simple…
The weight hierarchy of one-point algebraic geometry codes can be estimated by means of the generalized order bounds, which are described in terms of a certain Weierstrass semigroup. The asymptotical behaviour of such bounds for r > 1…