Infinite co-minimal pairs in the integers and integral lattices

TL;DR

This paper investigates the existence and construction of infinite co-minimal pairs in the integers and integral lattices, revealing new automorphism-based pairs in higher-dimensional groups and explicit examples with algebraic properties.

Contribution

It proves the existence of infinitely many automorphisms in d that produce co-minimal pairs with a subset, and constructs explicit infinite pairs in integers with specific algebraic properties.

Findings

Existence of infinitely many automorphisms with co-minimal pairs in d.

Construction of explicit infinite co-minimal pairs in integers.

New algebraic properties of constructed pairs.

Abstract

Given two nonempty subsets $A, B$ of a group $G$, they are said to form a co-minimal pair if $A \cdot B = G$, and $A' \cdot B \subsetneq G$ for any $\emptyset \neq A' \subsetneq A$ and $A\cdot B' \subsetneq G$ for any $\emptyset \neq B' \subsetneq B$. In this article, we show several new results on co-minimal pairs in the integers and the integral lattices. We prove that for any $d\geq 1$, the group $\mathbb{Z}^{2d}$ admits infinitely many automorphisms such that for each such automorphism $\sigma$, there exists a subset $A$ of $\mathbb{Z}^{2d}$ such that $A$ and $\sigma(A)$ form a co-minimal pair. The existence and construction of co-minimal pairs in the integers with both the subsets $A$ and $B$ ($A\neq B$) of infinite cardinality was unknown. We show that such pairs exist and explicitly construct these pairs satisfying a number of algebraic properties.