相关论文: Study of an identity
We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…
This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…
In this work, we study the integrability, as well as the dynamics of the Lorenz System. This include a very useful identity:\[ \beta z^2(\sigma t)+y^2(\beta\sigma t)=\rho x^2(\beta t)+\nu e^{-2\beta\sigma t}, \]where $\nu\in\mathbb{R}$ is a…
Aiming at the group decision - making problem with multi - objective attributes, this study proposes a group decision - making system that integrates fuzzy inference and Bayesian network. A fuzzy rule base is constructed by combining…
We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
We discuss a class of problems which we call lattice exit models. At one level, these problems provide undergraduate level exercises in labeling the vertices of graphs (e.g., depth first search). At another level (theorems about large scale…
Fuzzy authentication allows authentication based on the fuzzy matching of two objects, for example based on the similarity of two strings in the Hamming metric, or on the similiarity of two sets in the set difference metric. Aim of this…
We show that infinitely many alternating groups arise as quotients of the free group of rank 2, with kernel a characteristic subgroup. We also show that such simple quotients exist of arbitrarily large Lie rank. This resolves two questions…
We discuss an algebraic identity, due to Sylvester, as well as related algebraic identities and applications.
We study the interrelation of space functions of groups and the space complexity of the algorithmic word problem in groups.
We study z-automorphisms of the polynomial algebra K[x,y,z] and the free associative algebra K<x,y,z> over a field K, i.e., automorphisms which fix the variable z. We survey some recent results on such automorphisms and on the corresponding…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…
We consider systems of word equations and their solution sets. We discuss some fascinating properties of those, namely the size of a maximal independent set of word equations, and proper chains of solution sets of those. We recall the basic…
We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.
If an outer (multilinear) commutator identity holds in a large subgroup of a group, then it holds also in a large characteristic subgroup. Similar assertions are valid for algebras and their ideals or subspaces. Varying the meaning of the…
We give a combinatorial characterization of the identities holding in the semiring of all upper triangular Boolean $n\times n$-matrices and apply the characterization to computational complexity of identity checking, finite axiomatizability…
Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…
An algebra with identities $(a,b,c)=(a,c,b)=(b,a,c)$ is called {\it assosymmetric}, where $(x,y,z)=(xy)z-x(yz)$ is associator. We study $S_n$-module, $A_n$-module and $GL_n$-module structures of free assosymmetric algebra.