SearcharxivSearch

arXiv subjects

Lukasz Matysiak

Publications and source records attributed to Lukasz Matysiak.

7 recordsLinked to original sources

K + M constructions with general overrings and relationships with polynomial composites

In this paper we consider the construction of K + M, where K is the domain, M is the maximal ideal of a some ring of polynomials with coefficients from the field L, where K is its subring. In addition to the usual domains, we also consider the Noetherian, Prufer and GCD-domains. In particular, polynomial composites are a case of K + M construction. In this paper we will find numerous construction conclusions related to polynomial composites.

math.AC

A polynomial composites

Polynomial composites were introduced by Anderson, Anderson, and Zafrullah. In this paper we study many different algebraic properties of polynomial composites like ACCP, atomic, SR property. We study relationships between Noetherian polynomial composites certain field extensions.

math.AC

Matrices of infinite dimensions and their applications

Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite matrices. So far, there have been references and few results in certain scientific fields, but they have not been thoroughly researched. This paper presents a complete possible and ordered theory of infinite matrices.

math.GM

On square-free and radical factorizations and existence of some divisors

We discuss various square-free and radical factorizations and existence of some divisors in monoids in the context of: atomicity, ascending chain condition for principal ideals, a pre-Schreier property, a greatest common divisor property and a greatest common divisor for sets property.

math.AC

A polynomial composites and monoid domains as algebraic structures and their applications

This paper contains the results collected so far on polynomial composites in terms of many basic algebraic properties. Since it is a polynomial structure, results for monoid domains come in here and there. The second part of the paper contains the results of the relationship between the theory of polynomial composites, the Galois theory and the theory of nilpotents. The third part of this paper shows us some cryptosystems. We find generalizations of known ciphers taking into account the infinite alphabet and using simple algebraic methods. We also find two cryptosystems in which the structure of Dedekind rings resides, namely certain elements are equivalent to fractional ideals. Finally, we find the use of polynomial composites and monoid domains in cryptology.

math.AC

On some properties of polynomial composites

Polynomial composites were introduced by Anderson, Anderson, and Zafrullah. Over time, composites have appeared in many different papers, but they have not been sorted out in the algebra world. This paper is another part of the study of composites as an algebraic structure. In this paper we complete possible properties for polynomial composites as ACCP, atomic, BFD, HFD, idf, FFD domains. In a separate section, we consider polynomial composites as Dedekind rings.

math.AC

On properties of composites and monoid domains

In this paper I consider all possible properties from commutative algebra for polynomial composites and monoid domains. The aim is full characterization of these structures. I start with the examination of group, ring, modules properties, graded, but also the study of invertible elements, irreducible elements, ideals, etc. in these structures. In the second part of the work I give examples of the use of composites and monoid domains in cryptology. Each such polynomial is the sum of the products of the variable and the coefficient. And what if subsequent coefficient sets are appropriate cryptographic systems? Similarly, monoid domains can be a very good tool between encrypting and decrypting messages.

math.AC