Related papers: Rank weights for arbitrary finite field extensions

In this paper, we show a general way to interpret the infrastructure of a global field of arbitrary unit rank. This interpretation generalizes the prior concepts of the giant step operation and f-representations, and makes it possible to…

Finite fields form an important chapter in abstract algebra, and mathematics in general. We aim to provide a geometric and intuitive model for finite fields, involving algebraic numbers, in order to make them accessible and interesting to a…

We define Langlands parameters for connected reductive groups over finite fields and formulate the Langlands correspondence for finite fields using these parameters.

For a simple, normal and finite extension of a valued field, we prove that we can related the order of the ramification group of the field extension and the set of key polynomials associated to the extension of the valuation. More…

We present a new, category theoretic point of view on finite Ramsey theory. Our aims are as follows: -- to define the category theoretic notions needed for the development of finite Ramsey Theory, -- to state, in terms of these notions, the…

This paper is motivated by the study of Alperin's weight conjecture in the representation theory of finite groups. We generalize the notion of $e$-cuspidality in the $e$-Harish-Chandra theory of finite reductive groups, and define generic…

We present foundations of globally valued fields, i.e., of a class of fields with an extra structure, capturing some aspects of the geometry of global fields, based on the product formula. We provide a dictionary between various data…

We show that if an open cover of a finite dimensional space is equivariant with respect to some finite group action on the space then there is an equivariant refinement of bounded dimension. This will generalize some constructions of…

We classify the algebraic combinatorial geometries of arbitrary field extensions of transcendence degree greater than 4 and describe their groups of automorphisms. Our results and proofs extend similar results and proofs by Evans and…

For families of all theories of arbitrary given languages we describe ranks and degrees. In particular, we characterize (non-)totally transcendental families. We apply these characterizations for the families of all theories of given…

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata…

We consider the notion of a $(q,m)$-polymatroid, due to Shiromoto, and the more general notion of $(q,m)$-demi-polymatroid, and show how generalized weights can be defined for them. Further, we establish a duality for these weights…

In this paper, for a valued field $(K, v)$ of arbitrary rank and an extension $w$ of $v$ to $K(X),$ we give a connection between complete sets of ABKPs for $w$ and MacLane-Vaqui\'e chains of $w.$

We consider the concept of rank as a measure of the vertical levels and positions of elements of partially ordered sets (posets). We are motivated by the need for algorithmic measures on large, real-world hierarchically-structured data…

In this article we introduce the notion of the BEL-rank of a finite semifield, prove that it is an invariant for the isotopism classes, and give geometric and algebraic interpretations of this new invariant. Moreover, we describe an…

We propose a new bound for generalization of neural networks using Koopman operators. Whereas most of existing works focus on low-rank weight matrices, we focus on full-rank weight matrices. Our bound is tighter than existing norm-based…

In this paper, we introduce a new family of argument-ranking semantics which can be seen as a refinement of the classification of arguments into skeptically accepted, credulously accepted and rejected. To this end we use so-called social…

We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…

These notes cover a few calculations regarding the sum-rank weight of a matrix in relation to its rank. In particular, a formula and lower bounds are given on the probability that a matrix of rank $t$ consisting of $\ell$ blocks has…