相关论文: Generating subspace lattices, their direct product…

In this article, three types of joins are introduced for subspaces of a vector space. Decompositions of the Gra{\ss}mannian into joins are discussed. This framework admits a generalization of large set recursion methods for block designs to…

Two subspaces of a vector space are here called ``nonintersecting'' if they meet only in the zero vector. The following problem arises in the design of noncoherent multiple-antenna communications systems. How many pairwise nonintersecting…

In this note, we discuss planar lattices generated by their atoms. We prove that if $L$ is a planar lattice generated by $n$ atoms, then both the left and the right boundaries of $L$ have at most $n+1$ elements. On the other hand, $L$ can…

Three $k$-dimensional subspaces $A$, $B$, and $C$ of an $n$-dimensional vector space $V$ over a finite field are called a $3$-cluster if $A \cap B \cap C = \{\mathbf{0}_V\}$ and yet $\dim(A+B+C) \leq 2k$. A special kind of $3$-cluster,…

Various embedding problems of lattices into complete lattices are solved. We prove that for any join-semilattice S with the minimal join-cover refinement property, the ideal lattice IdS of S is both algebraic and dually algebraic.…

We study the Lie algebra of polynomial vector fields on a smooth Danielewski surface of the form $x y = p(z)$ with $x,y,z \in \mathbb{C}$. We provide explicitly given generators to show that: 1. The Lie algebra of polynomial vector fields…

Let $F=\mathbb{F}_q(T)$ be the field of rational functions with $\mathbb{F}_q$-coefficients, and $A=\mathbb{F}_q[T]$ be the subring of polynomials. Let $D$ be a division quaternion algebra over $F$ which is split at $1/T$. Given an…

We theoretically explore the optical flux lattices produced for ultra-cold atoms subject to laser fields where both the atom-light coupling and the effective detuning are spatially periodic. We analyze the geometric vector potential and the…

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

Let $\Lambda \subset \mathbb R^n$ be an algebraic lattice, coming from a projective module over the ring of integers of a number field $K$. Let $\mathcal Z \subset \mathbb R^n$ be the zero locus of a finite collection of polynomials such…

Linear upper bounds may be derived by imposing specific structural conditions on a generating set, such as additional constraints on ranks, eigenvalues, or the degree of the minimal polynomial of the generating matrices. This paper…

The projective space $\mathbb{P}_q(n)$, i.e. the set of all subspaces of the vector space $\mathbb{F}_q^n$, is a metric space endowed with the subspace distance metric. Braun, Etzion and Vardy argued that codes in a projective space are…

Let W be an arbitrary Coxeter group of simply-laced type (possibly infinite but of finite rank), u,v be any two elements in W, and i be a reduced word (of length m) for the pair (u,v) in the Coxeter group W\times W. We associate to i a…

There are several results in the literature concerning $p$-groups $G$ with a maximal elementary abelian normal subgroup of rank $k$ due to Thompson, Mann and others. Following an idea of Sambale we obtain bounds for the number of generators…

The ground spaces of a vector space of hermitian matrices, partially ordered by inclusion, form a lattice constructible from top to bottom in terms of intersections of maximal ground spaces. In this paper we characterize the lattice…

A lattice is called well-rounded if its minimal vectors span the corresponding Euclidean space. In this paper we completely describe well-rounded full-rank sublattices of ${\mathbb Z}^2$, as well as their determinant and minima sets. We…

Let $G$ be a group. A group is said to be $k$-generated if it can be generated by its $k$ elements. A generating set of $G$ is called a minimal generating set if no proper subset of it generates $G.$ A minimal generating set of a group can…

A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…

A generator of a metric space is a set $S$ of points in the space with the property that every point of the space is uniquely determined by its distances from the elements of $S$. Given a simple graph $G=(V,E)$, we define the distance…

We show that arithmetic lattices in $\mathrm{SL}_{2}(\mathbb{R})$, stemming from the proper units of an Eichler order in an indefinite quaternion algebra over $\mathbb{Q}$, admit a `small' covering set. In particular, we give bounds on the…