相关论文: Combinatorics of subgroups of Beidleman near-vecto…
The subspace structure of Beidleman near-vector spaces is investigated. We characterise finite dimensional Beidleman near-vector spaces and we classify the R-subgroups of finite dimensional Beidleman near-vector spaces. We provide an…
We studied linear mappings in Beidleman near-vector spaces and explored their matrix representations using $R$-bases of $R$-subgroups. Additionally, we developed algorithms for determining the seed number and seed sets of $R$-subgroups…
For a unitary unramified genuine principal series representation of a covering group, we study the associated R-group. We prove a formula relating the R-group to the dimension of the Whittaker space for the irreducible constituents of such…
We prove various results on the size and structure of subsets of vector spaces over finite fields which, in some sense, have too many mutually orthogonal pairs of vectors. In particular, we obtain sharp finite field variants of a theorem of…
For any nearfield $(R,+, \circ)$, denote by $D(R)$ the set of all distributive elements of $R$. Let $R$ be a finite Dickson nearfield that arises from Dickson pair $(q,n)$. For a given pair $(\alpha, \beta) \in R^2$ we study the generalized…
This paper provides two characterizations of regularity for near-vector spaces: first, by expressing them as a direct sum of vector spaces over division rings formed by distributive elements; second, by expressing their dimension in term of…
In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…
We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…
Carrier graphs of groups representing subgroups of a given relatively hyperbolic groups are introduced and a combination theorem for relatively quasi-convex subgroups is proven. Subsequently a theory of folds for such carrier graphs is…
Near-vector spaces extend linear algebra tools to non-linear algebraic structures, enabling the study of non-linear problems. However, explicit constructions remain rare. This paper introduces a broad computable family of near-vector…
The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…
In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…
The paper is devoted to developing subdifferential theory for set-valued mappings taking values in ordered infinite-dimensional spaces. This study is motivated by applications to problems of vector and set optimization with various…
Vector spaces over finite fields and Anzahl formulas of subspaces were studied by Wan (Geometry of Classical Groups over Finite Fields, Science Press, 2002). As a generalization, we study vector spaces and singular linear spaces over…
Previously the second author has constructed by cobordism methods, an invariant associated to a finite group $G$. This invariant approximates the number of subgroups of a group, giving in some cases the number of abelian and cyclic…
An S-approximation space is a novel approach to study systems with uncertainty that are not expressible in terms of inclusion relations. In this work, we further examined these spaces, mostly from a topological point of view by a…
We develope basic geometric quantities and properties of hypersurfaces in Carnot groups.
An algorithm is given for computing explicit formulas for the generators of relations among the invariant rational functions for vector-valued bilinear forms. These formulas have applications in the geometry of Riemannian submanifolds and…
We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…
Basic algebraic and combinatorial properties of finite vector spaces in which individual vectors are allowed to have multiplicities larger than $ 1 $ are derived. An application in coding theory is illustrated by showing that multispace…