Related papers: Monomial codes under linear algebra point of view
The author surveys Galois theory of function fields with non-zero caracteristic and its relation to the structure of finite permutation groups and matrix groups.
Simulating complex systems remains an ongoing challenge for classical computers, while being recognised as a task where a quantum computer has a natural advantage. In both digital and analogue quantum simulations the system description is…
Let $f:X \to S$ be a Galois cover of Riemann surfaces, with Galois group $G$. In this paper we analyze the $G$-invariant divisors on $X$, and their associated spaces of meromorphic functions, differentials, and $q$-differentials. We…
We develop a computational framework for the statistical characterization of Galois characters with finite image, with application to characterizing Galois groups and establishing equivalence of characters of finite images of…
Polycyclic codes are a generalization of cyclic and constacyclic codes. Even though they have been known since 1972 and received some attention more recently, there have not been many studies on polycyclic codes. This paper presents an…
We study surjectivity of a localization map in Galois cohomology.
In this paper, we investigate polycyclic codes associated with a trinomial of arbitrary degree $n$ over a finite chain ring $ R.$ We extend the concepts of $ n $-isometry and $ n $-equivalence known for constacyclic codes to this class of…
We introduce the notion of Galois holomorphic foliation on the complex projective space as that of foliations whose Gauss map is a Galois covering when restricted to an appropriate Zariski open subset. First, we establish general criteria…
We address two interrelated problems concerning the permutation of roots of univariate polynomials whose coefficients depend on parameters. First, we compute the Galois group of polynomials $\varphi(x)\in\mathbb{C}[y_1,\cdots,y_k][x]$ over…
In this paper, we consider some structures of linear codes over the ring $\mathcal{R}_k=R[v_1,\dots,v_k],$ where $v_i^2=v_i$ forall $i=1,\dots,k),$ and $R$ is a finite commutative Frobenius ring.
Higher-dimensional analogs of the predictable degree property and column reducedness are defined, and it is proved that the two properties are equivalent. It is shown that every multidimensional convolutional code has, what is called, a…
We construct an arithmetic analogue of the quantum local systems on the moduli of curves, and study its basic structure. Such an arithmetic local system gives rise to a uniform way of assigning a Galois cohomology class of the first…
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These…
We describe the boundary of linear subvarieties in the moduli space of multi-scale differentials. Linear subvarieties are algebraic subvarieties of strata of (possibly) meromorphic differentials that in local period coordinates are given by…
The Kalman variety of a linear subspace in a vector space consists of all endomorphism that possess an eigenvector in that subspace. We study the defining polynomials and basic geometric invariants of the Kalman variety.
We discuss rather systematically the principle, implicit in earlier works, that for a "random" element in an arithmetic subgroup of a (split, say) reductive algebraic group over a number field, the splitting field of the characteristic…
We show that Galois theory of cyclotomic number fields provides a powerful tool to construct systematically integer-valued matrices commuting with the modular matrix S, as well as automorphisms of the fusion rules. Both of these…
The problem of finding subfield subcodes of generalized Reed-Solomon (GRS) codes (i.e., alternant codes) is considered. A pure linear algebraic approach is taken in order to derive message constraints that generalize the well known…
It is a classical result from universal algebra that the notions of polymorphisms and invariants provide a Galois connection between suitably closed classes (clones) of finitary operations $f\colon B^n\to B$, and classes (coclones) of…
Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…