Complexity and varieties for infinitely generated modules, II

1996 ◽  
Vol 120 (4) ◽  
pp. 597-615 ◽  
Author(s):  
D. J. Benson ◽  
Jon F. Carlson ◽  
J. Rickard
Keyword(s):  
Tensor Product ◽  
Matrix Representation ◽  
Cohomology Ring ◽  
Group Cohomology ◽  
Product Theorem ◽  
The Matrix ◽  
A Finite Group ◽  
Infinitely Generated Modules ◽  
Rank Variety ◽  
Associated Variety

It has now been almost twenty years since Alperin introduced the idea of the complexity of a finitely generated kG-module, when G is a finite group and k is a field of characteristic p > 0. In proving one of the first major results in the area [1], Alperin and Evens demonstrated the connection of the study of complexity for modules to the group cohomology. That connection eventually led to the categorization of modules according to their associated varieties in the maximal ideal spectrum of the cohomology ring H*(G, k). In all of the work that has followed, two principles have proved to be extremely important. The first is that the associated variety of a module is directly related to the structure of the module through the rank variety which is defined by the matrix representation of the module. The second major result is the tensor product theorem which says that the variety associated to a tensor product M ⊗kN is the intersection of the varieties associated to the modules M and N. In this paper we generalize these results to infinitely generated kG-modules.

On the finite generation of high dimensional cohomology ring of virtually torsion-free groups

1998 ◽  
Vol 124 (1) ◽  
pp. 57-72 ◽  
Author(s):  
CHUN-NIP LEE
Keyword(s):  
Automorphism Groups ◽  
Cohomology Ring ◽  
Free Groups ◽  
Outer Automorphism ◽  
Cohomological Dimension ◽  
Group Cohomology ◽  
Mapping Class ◽  
Finitely Generated ◽  
Finite Generation ◽  
A Finite Group

Let Γ be a discrete group and p be a prime. One of the fundamental results in group cohomology is that H*(Γ, [ ]p) is a finitely generated [ ]p-algebra if Γ is a finite group [8, 24]. The purpose of this paper is to study the analogous question when Γ is no longer finite.Recall that Γ is said to have finite virtual cohomological dimension (vcd) if there exists a finite index torion-free subgroup Γ′ of Γ such that Γ′ has finite cohomological dimension over ℤ [4]. By definition vcd Γ is the cohomological dimension of Γ′. It is easy to see that the mod p cohomology ring of a finite vcd-group does not have to be a finitely generated [ ]p-algebra in general. For instance, if Γ is a countably infinite free product of ℤ's, then H1(Γ, [ ]p) is not finite dimensional over [ ]p. The three most important classes of examples of finite vcd-groups in which the mod p cohomology ring is a finitely generated [ ]p-algebra are arithmetic groups [2], mapping class groups [9, 10] and outer automorphism groups of free groups [5]. In each of these examples, the proof of finite generation involves the construction of a specific Γ-complex with appropriate finiteness conditions. These constructions should be regarded as utilizing the geometry underlying these special classes of groups. In contrast, the result we prove will depend only on the algebraic structure of the group Γ.

MRHS solver based on linear algebra and exhaustive search

2018 ◽  
Vol 12 (3) ◽  
pp. 143-157 ◽  
Author(s):  
Håvard Raddum ◽  
Pavol Zajac
Keyword(s):  
Linear Algebra ◽  
Matrix Representation ◽  
Equation System ◽  
Exhaustive Search ◽  
Binary Matrix ◽  
Algebraic Attacks ◽  
The Matrix ◽  
Speed Up ◽  
Symmetric Key

Abstract We show how to build a binary matrix from the MRHS representation of a symmetric-key cipher. The matrix contains the cipher represented as an equation system and can be used to assess a cipher’s resistance against algebraic attacks. We give an algorithm for solving the system and compute its complexity. The complexity is normally close to exhaustive search on the variables representing the user-selected key. Finally, we show that for some variants of LowMC, the joined MRHS matrix representation can be used to speed up regular encryption in addition to exhaustive key search.

Molecular and morphometric characterisation of Xiphinema globosum Sturhan, 1978 (Nematoda: Longidoridae) from Spain

Nematology ◽  
2011 ◽  
Vol 13 (1) ◽  
pp. 17-28 ◽  
Author(s):  
Blanca Landa ◽  
Carolina Cantalapiedra-Navarrete ◽  
Juan Palomares-Rius ◽  
Pablo Castillo ◽  
Carlos Gutiérrez-Gutiérrez
Keyword(s):  
Phylogenetic Trees ◽  
18S Rrna ◽  
Matrix Representation ◽  
Natural Environments ◽  
28S Rrna ◽  
Parsimony Method ◽  
Rdna Genes ◽  
Supertree Method ◽  
The Matrix ◽  
Relationship Of

AbstractDuring a recent nematode survey in natural environments of the Los Alcornocales Regional Park narrow valleys, viz., the renowned 'canutos' excavated in the mountains that maintain a humid microclimate, in southern Spain, an amphimictic population of Xiphinema globosum was identified. Morphological and morphometric studies on this population fit the original and previous descriptions and represent the first report from Spain and southern Europe. Molecular characterisation of X. globosum from Spain using D2-D3 expansion regions of 28S rRNA, 18S rRNA and ITS1-rRNA is provided and maximum likelihood and Bayesian inference analysis were used to reconstruct phylogenetic relationships within X. globosum and other Xiphinema species. A supertree solution of the different phylogenetic trees obtained in this study and in other published studies using rDNA genes are presented using the matrix representation parsimony method (MRP) and the most similar supertree method (MSSA). The results revealed a closer phylogenetic relationship of X. globosum with X. diversicaudatum, X. bakeri and with some sequences of unidentified Xiphinema spp. deposited in GenBank.

Leontev Input-Output Balance Model as a Dynamic System Control Problem

2021 ◽  
pp. 66-82
Author(s):  
S.N. Masaev
Keyword(s):  
Dynamic System ◽  
Matrix Representation ◽  
External Environment ◽  
Balance Model ◽  
System Control ◽  
Operational Mode ◽  
Input Output ◽  
System A ◽  
The Matrix ◽  
Research Show

The purpose of the study was to determine the problem of control of a dynamic system of higher dimension. Relying on Leontev input-output balance, we formalized the dynamic system and synthesized its control. Within the research, we developed a mathematical model that combines different working objects that consume and release various resources. The value of the penalty for all nodes and objects is introduced into the matrix representation of the problem, taking into account various options for their interaction, i.e., the observation problem. A matrix representation of the planning task at each working object is formed. For the formed system, a control loop is created; the influencing parameters of the external environment are indicated. We calculated the system operational mode, taking into account the interaction of the nodes of objects with each other when the parameters of the external environment influence them. Findings of research show that in achieving a complex result, the system is inefficient without optimal planning and accounting for the matrix of penalties for the interaction of nodes and objects of the dynamic system with each other. In a specific example, for a dynamic system with a dimension of 4.8 million parameters, we estimated the control taking into account the penalty matrix, which made it possible to increase the inflow of additional resources from the outside by 2.4 times from 130 billion conv. units up to 310 conv. units in 5 years. Taking into account the maximum optimization of control in the nodes, an increase of 3.66 times in the inflow of additional resources was ensured --- from 200.46 to 726.62 billion rubles

Finding Cut-Edges and the Minimum Spanning Tree via Semi-Tensor Product Approach

2018 ◽  
Vol 6 (5) ◽  
pp. 459-472
Author(s):  
Xujiao Fan ◽  
Yong Xu ◽  
Xue Su ◽  
Jinhuan Wang
Keyword(s):  
Tensor Product ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
The Matrix ◽  
Product Approach ◽  
Matrix Expression ◽  
Necessary And Sufficient ◽  
Logical Functions

Abstract Using the semi-tensor product of matrices, this paper investigates cycles of graphs with application to cut-edges and the minimum spanning tree, and presents a number of new results and algorithms. Firstly, by defining a characteristic logical vector and using the matrix expression of logical functions, an algebraic description is obtained for cycles of graph, based on which a new necessary and sufficient condition is established to find all cycles for any graph. Secondly, using the necessary and sufficient condition of cycles, two algorithms are established to find all cut-edges and the minimum spanning tree, respectively. Finally, the study of an illustrative example shows that the results/algorithms presented in this paper are effective.

scholarly journals HIGHER DEFORMATIONS OF LIE ALGEBRA REPRESENTATIONS II

2020 ◽  
pp. 1-24
Author(s):  
MATTHEW WESTAWAY
Keyword(s):  
Tensor Product ◽  
Algebraic Groups ◽  
Preceding Paper ◽  
Irreducible Representations ◽  
Product Theorem ◽  
Enveloping Algebras ◽  
Frobenius Kernel ◽  
Frobenius Kernels ◽  
Lie Algebra Representations ◽  
Semisimple Algebraic Groups

Steinberg’s tensor product theorem shows that for semisimple algebraic groups, the study of irreducible representations of higher Frobenius kernels reduces to the study of irreducible representations of the first Frobenius kernel. In the preceding paper in this series, deforming the distribution algebra of a higher Frobenius kernel yielded a family of deformations called higher reduced enveloping algebras. In this paper, we prove that the Steinberg decomposition can be similarly deformed, allowing us to reduce representation theoretic questions about these algebras to questions about reduced enveloping algebras. We use this to derive structural results about modules over these algebras. Separately, we also show that many of the results in the preceding paper hold without an assumption of reductivity.

Matrix representation of formal polynomials over max-plus algebra

2020 ◽  
pp. 2150216
Author(s):  
Cailu Wang ◽  
Yuegang Tao
Keyword(s):  
Matrix Method ◽  
Polynomial Algorithm ◽  
Polynomial Function ◽  
Matrix Representation ◽  
Sufficient Condition ◽  
Polynomial Functions ◽  
Canonical Forms ◽  
Necessary And Sufficient Condition ◽  
The Matrix ◽  
Necessary And Sufficient

This paper proposes the matrix representation of formal polynomials over max-plus algebra and obtains the maximum and minimum canonical forms of a polynomial function by standardizing this representation into a canonical form. A necessary and sufficient condition for two formal polynomials corresponding to the same polynomial function is derived. Such a matrix method is constructive and intuitive, and leads to a polynomial algorithm for factorization of polynomial functions. Some illustrative examples are presented to demonstrate the results.

Sign in / Sign up

Export Citation Format

Share Document