Related papers: A Cryptosystem Using Cluster Algebras
We classify mutation-finite cluster algebras with arbitrary coefficients of geometric type.
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
We give a uniform geometric realization for the cluster algebra of an arbitrary finite type with principal coefficients at an arbitrary acyclic seed. This algebra is realized as the coordinate ring of a certain reduced double Bruhat cell in…
Cryptographic systems are derived using units in group rings. Combinations of types of units in group rings give units not of any particular type. This includes cases of taking powers of units and products of such powers and adds the…
A novel original procedure of encryption/decryption based on the polyadic algebraic structures and on signal processing methods is proposed. First, we use signals with integer amplitudes to send information. Then we use polyadic techniques…
Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network…
Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of a subgroup of operations to present a private-key quantum…
Cryptography is the science of using mathematics to encrypt and decrypt data. Cryptography enables you to store sensitive information or transmit it across insecure networks so that it cannot be read by anyone except the intended recipient.…
We provide a technique to find a cluster-tilting object having a given cluster-tilted algebra as endomorphism ring in the finite type case.
We complete classification of mutation-finite cluster algebras by extending the technique derived by Fomin, Shapiro, and Thurston to skew-symmetrizable case. We show that for every mutation-finite skew-symmetrizable matrix a diagram…
We describe a framework for encoding cluster combinatorics using categorical methods. We give a definition of an abstract cluster structure, which captures the essence of cluster mutation at a tropical level and show that cluster algebras,…
Cluster algebras are a class of commutative algebras whose generators are defined by a recursive process called mutation. We give a brief introduction to cluster algebras, and explain how discrete integrable systems can appear in the…
This work describes an example of an application of a novel method for symmetric cryptography. Its purpose is to show how a regular message can be encrypted and then decrypted in an easy, yet secure way. The encrypting method introduced in…
In this paper it has been developed an algorithm for cryptography, using the Mellin's transform. Cryptography is very important to protect data to ensure that two people, using an insecure channel, may communicate in a secure way. In the…
Matrix mutation appears in the definition of cluster algebras of Fomin and Zelevinsky. We give a representation theoretic interpretation of matrix mutation, using tilting theory in cluster categories of hereditary algebras. Using this, we…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
We provide a systematic derivation of cluster alphabets of finite types. The construction is based on a geometric realization of the generalized worldsheets by gluing and folding a pair of polygons. The cross ratios of the worldsheet z…
This paper develops techniques for producing presentations of upper cluster algebras. These techniques are suited to computer implementation, and will always succeed when the upper cluster algebra is totally coprime and finitely generated.…
In cryptography, encryption is the process of obscuring information to make it unreadable without special knowledge. This is usually done for secrecy, and typically for confidential communications. Encryption can also be used for…
We investigate the cluster-tilted algebras of finite representation type over an algebraically closed field. We give an explicit description of the relations for the quivers for finite representation type. As a consequence we show that a…