Related papers: Testing isomorphism of graded algebras

We present a constructive approach to torsion-free gradings of Lie algebras. Our main result is the computation of a maximal grading. Given a Lie algebra, using its maximal grading we enumerate all of its torsion-free gradings as well as…

We give the complete algebraic classification of all complex 4-dimensional nilpotent algebras. The final list has 234 (parametric families of) isomorphism classes of algebras, 66 of which are new in the literature.

We construct the deformation functor associated with a pair of morphisms of differential graded Lie algebras, and use it to study infinitesimal deformations of holomorphic maps of compact complex manifolds. In particular, using L-infinity…

Many real world networks are considered temporal networks, in which the chronological ordering of the edges has importance to the meaning of the data. Performing temporal subgraph matching on such graphs requires the edges in the subgraphs…

We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…

We give a new characterization of elementary and deterministic polynomial time computation in linear logic through the proofs-as-programs correspondence. Girard's seminal results, concerning elementary and light linear logic, achieve this…

We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…

Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…

We develop a new method that improves the efficiency of equation-by-equation algorithms for solving polynomial systems. Our method is based on a novel geometric construction, and reduces the total number of homotopy paths that must be…

We give a complete description of Lie algebras graded by an infinite irreducible locally finite root system.

We use the concept of a Kirchhoff resistor network (alternatively random walk on a network) to probe connected graphs and produce symmetry revealing canonical labelings of the graph(s) nodes and edges.

In this study, we classify some soliton nilpotent Lie algebras and possible candidates in dimension 8 and 9 up to isomorphy. We focus on 1 < 2 < ::: < n type of derivations where n is the dimension of the Lie algebras. We present algorithms…

We prove that algebraic isomorphisms between limit algebras are automatically continuous, and consider consequences of this result. In particular, we give partial solutions to a conjecture of Power [Limit Algebras, Longman, 1992, Notes to…

We describe algorithms based on invariant theory to solve problems on the geometry of curves, mainly those of genus 2, 3 and 4. New theoretical results building on the first author's PhD thesis are also included.

We illustrate an algorithm to classify nice nilpotent Lie algebras of dimension $n$ up to a suitable notion of equivalence; applying the algorithm, we obtain complete listings for $n\leq9$. On every nilpotent Lie algebra of dimension $\leq…

Given a grading by an abelian group G on a semisimple Lie algebra L over an algebraically closed field of characteristic 0, we classify up to isomorphism the simple objects in the category of finite-dimensional G-graded L-modules. The…

A new purely algebraic algorithm is presented for computation of invariants (generalized Casimir operators) of Lie algebras. It uses the Cartan's method of moving frames and the knowledge of the group of inner automorphisms of each Lie…

The classification of local Artinian Gorenstein algebras is equivalent to the study of orbits of a certain non-reductive group action on a polynomial ring. We give an explicit formula for the orbits and their tangent spaces. We apply our…

To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs…

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…