Related papers: Group Coding with Complex Isometries
We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…
Let us consider the group $G = < x,y \mid x^m = y^n>$ with $m$ and $n$ nonzero integers. In this paper, we study the variety of epresentations $R(G)$ and the character variety $X(G)$ in $SL(2,\C)$ of the group $G$,obtaining by elementary…
We prove combination theorems in the spirit of Klein and Maskit in the context of discrete convergence groups acting geometrically finitely on their limit sets. As special cases, we obtain combination theorems for geometrically finite…
Let G be a connected reductive group. To any irreducible G-variety one associates a certain linear group generated by reflections called the Weyl group. Weyl groups play an important role in the study of embeddings of homogeneous spaces. We…
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…
For a finite group $G$, we define the inclusion graph of subgroups of $G$, denoted by $\mathcal I(G)$, is a graph having all the proper subgroups of $G$ as its vertices and two distinct vertices $H$ and $K$ in $\mathcal I(G)$ are adjacent…
Batch codes serve as critical tools for load balancing in distributed storage systems. While numerous constructions exist for specific batch sizes t, current methodologies predominantly rely on code dimension parameters, limiting their…
We present a performant and rigorous algorithm for certifying that a matrix is close to being a projection onto an irreducible subspace of a given group representation. This addresses a problem arising when one seeks solutions to…
In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…
In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…
Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…
This article focuses on the study of the group of units of incidence rings, which is a class of infinite matrix groups indexed by ordered sets, on a topological perspective. We first show when these groups can inherit the topological…
We use geometry of Davis complex of a Coxeter group to prove the following result: if G is an infinite indecomposable Coxeter group and $H\subset G$ is a finite index reflection subgroup then the rank of H is not less than the rank of G.…
In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters…
We study an abstract setting for cutting planes for integer programming called the infinite group problem. In this abstraction, cutting planes are computed via cut generating function that act on the simplex tableau. In this function space,…
We find an algorithmic procedure that enables to compute and to describe the structure of the isotropy subgroups of the group of complex orthogonal matrices with respect to the action of similarity on complex symmetric matrices. A key step…
In this paper we present several algorithms related with the computation of the homology of groups, from a geometric perspective (that is to say, carrying out the calculations by means of simplicial sets and using techniques of Algebraic…
A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically…
We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…
For a finite group $G$ and an irreducible complex character $\chi$ of $G$, the codegree of $\chi$ is defined by $\textrm{cod}(\chi)=|G:\textrm{ker}(\chi)|/\chi(1)$, where $\textrm{ker}(\chi)$ is the kernel of $\chi$. In this paper, we show…