On the Nonorientable Genus of the Generalized Unit and Unitary Cayley Graphs of a Commutative Ring

Let [Formula: see text] be a commutative ring and [Formula: see text] the multiplicative group of unit elements of [Formula: see text]. In 2012, Khashyarmanesh et al. defined the generalized unit and unitary Cayley graph, [Formula: see text], corresponding to a multiplicative subgroup [Formula: see text] of [Formula: see text] and a nonempty subset [Formula: see text] of [Formula: see text] with [Formula: see text], as the graph with vertex set [Formula: see text]and two distinct vertices [Formula: see text] and [Formula: see text] being adjacent if and only if there exists [Formula: see text] such that [Formula: see text]. In this paper, we characterize all Artinian rings [Formula: see text] for which [Formula: see text] is projective. This leads us to determine all Artinian rings whose unit graphs, unitary Cayley graphs and co-maximal graphs are projective. In addition, we prove that for an Artinian ring [Formula: see text] for which [Formula: see text] has finite nonorientable genus, [Formula: see text] must be a finite ring. Finally, it is proved that for a given positive integer [Formula: see text], the number of finite rings [Formula: see text] for which [Formula: see text] has nonorientable genus [Formula: see text] is finite.

Generic expansions by a reduct

Consider the expansion [Formula: see text] of a theory [Formula: see text] by a predicate for a submodel of a reduct [Formula: see text] of [Formula: see text]. We present a setup in which this expansion admits a model companion [Formula: see text]. We show that some of the nice features of the theory [Formula: see text] transfer to [Formula: see text]. In particular, we study conditions for which this expansion preserves the [Formula: see text]-ness, the simplicity or the stability of the starting theory [Formula: see text]. We give concrete examples of new [Formula: see text] not simple theories obtained by this process, among them the expansion of a perfect [Formula: see text]-free PAC field of positive characteristic by generic additive subgroups, and the expansion of an algebraically closed field of any characteristic by a generic multiplicative subgroup.

Explicit Kummer theory for the rational numbers

Let [Formula: see text] be a finitely generated multiplicative subgroup of [Formula: see text] having rank [Formula: see text]. The ratio between [Formula: see text] and the Kummer degree [Formula: see text], where [Formula: see text] divides [Formula: see text], is bounded independently of [Formula: see text] and [Formula: see text]. We prove that there exist integers [Formula: see text] such that the above ratio depends only on [Formula: see text], [Formula: see text], and [Formula: see text]. Our results are very explicit and they yield an algorithm that provides formulas for all the above Kummer degrees (the formulas involve a finite case distinction).

Kummer theory for number fields and the reductions of algebraic numbers

For all number fields the failure of maximality for the Kummer extensions is bounded in a very strong sense. We give a direct proof (without relying on the Bashmakov–Ribet method) of the fact that if [Formula: see text] is a finitely generated and torsion-free multiplicative subgroup of a number field [Formula: see text] having rank [Formula: see text], then the ratio between [Formula: see text] and the Kummer degree [Formula: see text] is bounded independently of [Formula: see text]. We then apply this result to generalize to higher rank a theorem of Ziegler from 2006 about the multiplicative order of the reductions of algebraic integers (the multiplicative order must be in a given arithmetic progression, and an additional Frobenius condition may be considered).

S-Box on Subgroup of Galois Field

In substitution–permutation network as a cryptosystem, substitution boxes play the role of the only nonlinear part. It would be easy for adversaries to compromise the security of the system without them. 8-bit S-boxes are the most used cryptographic components. So far, cryptographers were constructing 8-bit S-boxes used in cryptographic primitives by exhaustive search of permutations of order 256. However, now for cryptographic techniques with 8-bit S-boxes as confusion layers, researchers are trying to reduce the size of S-box by working with a small unit of data. The aim is to make the techniques compact, fast and elegant. The novelty of this research is the construction of S-box on the elements of the multiplicative subgroup of the Galois field instead of the entire Galois field. The sturdiness of the proposed S-box against algebraic attacks was hashed out by employing the renowned analyses, including balance, nonlinearity, strict avalanche criterion, and approximation probabilities. Furthermore, the statistical strength of the S-box was tested by the majority logic criterion. The fallouts show that the S-box is appropriate for applications for secure data communications. The S-box was also used for watermarking of grayscale images with good outcomes.

Weak Approximation for Points with Coordinates in Rank-one Subgroups of Global Function Fields

For every affine variety over a global function field, we show that the set of its points with coordinates in an arbitrary rank-one multiplicative subgroup of this function field satisfies the required property of weak approximation for finite sets of places of this function field avoiding arbitrarily given finitely many places.

DISTAL AND NON-DISTAL PAIRS

The aim of this note is to determine whether certain non-o-minimal expansions of o-minimal theories which are known to be NIP, are also distal. We observe that while tame pairs of o-minimal structures and the real field with a discrete multiplicative subgroup have distal theories, dense pairs of o-minimal structures and related examples do not.