Related papers: Group codes over fields are asymptotically good
Several relations and bounds for the dimension of principal ideals in group algebras are determined by analyzing minimal polynomials of regular representations. These results are used in the two last sections. First, in the context of…
Let $\mathbb{F}$ be an algebraically closed field of characteristic zero. In this article we show that isotypic blocks of finite groups are functorially equivalent over $\mathbb{F}$.
Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…
We show that each local field $\mathbb{F}_q((t))$ of characteristic $p > 0$ is characterised up to isomorphism within the class of all fields of imperfect exponent at most $1$ by (certain small quotients of) its absolute Galois group…
Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.
We extend to the context of algebraic groups a classic result on extensions of abstract groups relating the set of isomorphism classes of extensions of $G$ by $H$ with that of extensions of $G$ by the center $Z$ of $H$. The proof should be…
We give a new construction of nonlinear error-correcting codes over suitable finite fields k from the geometry of modular curves with many rational points over k, combining two recent improvements on Goppa's construction. The resulting…
We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…
We answer a question of Downey and Kurtz on left-orderable groups by showing that there is a computable left-orderable group which is not classically isomorphic to a computable group with a computable left-order.
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
Let G be a group. Two elements x,y are said to be in the same z-class if their centralizers are conjugate in G. Let V be a vector space of dimension n over a field F of characteristic different from 2. Let B be a non-degenerate symmetric,…
We give a one-to-one correspondence between ideals in the Steinberg algebra of a Hausdorff ample groupoid $G$, and certain families of ideals in the group algebras of isotropy groups in $G$. This generalises a known ideal correspondence…
We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…
In the first part of this article, we consider ruled surfaces defined over a finite field; we introduce invariants for them, and describe some explicit contructions that illustrate possible behaviour of these invariants. In the second part,…
We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…
An easily computable dimension (or ECD) group code in the group algebra $\mathbb{F}_{q}G$ is an ideal of dimension less than or equal to $p=char(\mathbb{F}_{q})$ that is generated by an idempotent. This paper introduces an easily computable…
We introduce a new construction of error-correcting codes from algebraic curves over finite fields. Modular curves of genus g -> infty over a field of size q0^2 yield nonlinear codes more efficient than the linear Goppa codes obtained from…
In this paper we provide an algorithm to classify groups of points on abelian threefolds over finite fields. The classification is given in terms of the Weil polynomial of abelian varieties in a given $\mathbb{F}_q$-isogeny class. This work…
Counterexamples to the Modular Isomorphism Problem were discovered recently. These are non-isomorphic finite $2$-groups $G$ and $H$ that have isomorphic group algebras over the field $\mathbb{Z}/2\mathbb{Z}$ and non-isomorphic group…
For a general class of non-negative functions defined on integral ideals of number fields, upper bounds are established for their average over the values of certain principal ideals that are associated to irreducible binary forms with…