Results 1 to 10 of about 10,036 (65)
This paper discusses an abelian group, ring, and field under addition and multiplication of the binomial coefficients in combinatorial geometric series. The coefficient for each term in combinatorial geometric series refers to a binomial coefficient. This idea can enable the scientific researchers to solve the real life problems.
openaire +2 more sources
Convergence and limits of linear representations of finite groups [PDF]
Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in continuous algebras. We
Elek, Gabor
core +2 more sources
Semifields from skew polynomial rings [PDF]
Skew polynomial rings were used to construct finite semifields by Petit in 1966, following from a construction of Ore and Jacobson of associative division algebras.
Lavrauw, Michel, Sheekey, John
core +4 more sources
Fields and rings with few types [PDF]
Let R be an associative ring with possible extra structure. R is said to be weakly small if there are countably many 1-types over any finite subset of R. It is locally P if the algebraic closure of any finite subset of R has property P.
Cohn +13 more
core +3 more sources
Factorizations of Elements in Noncommutative Rings: A Survey [PDF]
We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations.
A Geroldinger +56 more
core +1 more source
Moufang sets and structurable division algebras [PDF]
A Moufang set is essentially a doubly transitive permutation group such that each point stabilizer contains a normal subgroup which is regular on the remaining vertices; these regular normal subgroups are called the root groups, and they are assumed to ...
Boelaert, Lien +2 more
core +2 more sources
Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature.
Martínez-Peñas, Umberto
core +1 more source
Basic Module Theory over Non-Commutative Rings with Computational Aspects of Operator Algebras
The present text surveys some relevant situations and results where basic Module Theory interacts with computational aspects of operator algebras. We tried to keep a balance between constructive and algebraic aspects.Comment: To appear in the Proceedings
A. Kandri-Rody +54 more
core +1 more source
Free structures in division rings
Makar-Limanov's conjecture states that if a division ring D is finitely generated and infinite dimensional over its center k then D contains a free k-subalgebra of rank 2.
Júnior, Renato Fehlberg
core +1 more source
Computing the bound of an Ore polynomial. Applications to factorization
We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a factorization ...
Gomez-Torrecillas, Jose +2 more
core +1 more source

