Superpositions of free Fox derivations

IF 0.2 Q4 MATHEMATICS, APPLIED

Prikladnaya Diskretnaya Matematika Pub Date : 2022-01-01 DOI:10.17223/20710410/56/3

V. Roman’kov

引用次数: 1

Abstract

Fox derivations are an effective tool for studying free groups and their group rings. Let Fr be a free group of finite rank r with basis {f1,..., fr}. For every i, the partial Fox derivations ∂/∂fi и ∂/∂fi-1 are defined on the group ring ℤ[Fr]. For k / 2, their superpositions Dfϵi = = ∂/∂fϵki о ... о ∂/∂fϵk1, ϵ = (ϵ1,..., ϵk) Є{±1}k, are not Fox derivations. In this paper, we study the properties of superpositions Dfϵi. It is shown that the restrictions of such superpositions to the commutant F′r are Fox derivations. As an application of the obtained results, it is established that for any rational subset R of F′r and any i there are parameters k and ϵ such that R is annihilated by Dfϵi.

查看原文本刊更多论文

自由福克斯派生的叠加

福克斯推导是研究自由群及其群环的有效工具。设Fr为基为{f1，…, fr}。对于每一个i，∂/∂fi *∂/∂fi-1在群环上定义。对于k / 2，它们的叠加Dfϵi = =∂/∂fϵki∂/∂fϵk1， ε = (ϵ1，…， ϵk) Є{±1}k，不是Fox衍生。本文研究了叠加态的性质Dfϵi。证明了这种叠加对交换子F 'r的限制是Fox导数。作为所得结果的一个应用，我们建立了对于F 'r的任意有理子集R和任意i，都存在参数k和λ，使得R被Dfϵi湮灭。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Prikladnaya Diskretnaya Matematika MATHEMATICS, APPLIED-

CiteScore

0.60

自引率

50.00%

发文量

期刊介绍： The scientific journal Prikladnaya Diskretnaya Matematika has been issued since 2008. It was registered by Federal Control Service in the Sphere of Communications and Mass Media (Registration Witness PI № FS 77-33762 in October 16th, in 2008). Prikladnaya Diskretnaya Matematika has been selected for coverage in Clarivate Analytics products and services. It is indexed and abstracted in SCOPUS and WoS Core Collection (Emerging Sources Citation Index). The journal is a quarterly. All the papers to be published in it are obligatorily verified by one or two specialists. The publication in the journal is free of charge and may be in Russian or in English. The topics of the journal are the following: 1.theoretical foundations of applied discrete mathematics – algebraic structures, discrete functions, combinatorial analysis, number theory, mathematical logic, information theory, systems of equations over finite fields and rings; 2.mathematical methods in cryptography – synthesis of cryptosystems, methods for cryptanalysis, pseudorandom generators, appreciation of cryptosystem security, cryptographic protocols, mathematical methods in quantum cryptography; 3.mathematical methods in steganography – synthesis of steganosystems, methods for steganoanalysis, appreciation of steganosystem security; 4.mathematical foundations of computer security – mathematical models for computer system security, mathematical methods for the analysis of the computer system security, mathematical methods for the synthesis of protected computer systems;[...]