Related papers: Gr\"obner bases for p-group algebras
We relate a classic algebro-geometric degeneration technique, dating at least to [Hodge 1941], to the notion of vertex decompositions of simplicial complexes. The good case is when the degeneration is reduced, and we call this a "geometric…
G-algebras, or Groebner bases algebras, were considered by Levandovsky, these algebras include very important families of algebras, like the Weyl algebras and the universal enveloping algebra of a finite dimensional Lie algebra. These…
Toral automorphisms, represented by unimodular integer matrices, are investigated with respect to their symmetries and reversing symmetries. We characterize the symmetry groups of GL(n,Z) matrices with simple spectrum through their…
We establish doubly-exponential degree bounds for Gr\"obner bases in certain algebras of solvable type over a field (as introduced by Kandri-Rody and Weispfenning). The class of algebras considered here includes commutative polynomial…
The maximal minors of a p by (m + p) matrix of univariate polynomials of degree n with indeterminate coefficients are themselves polynomials of degree np. The subalgebra generated by their coefficients is the coordinate ring of the quantum…
Word maps in a group, an analogue of polynomials in groups, are defined by substitution of formal words. Lubotzky gave a characterization of the images of word maps in finite simple groups, and a consequence of his characterization is the…
We study the graph on reduced words with edges given by the Coxeter relations for the symmetric group. We define a metric on reduced words for a given permutation, analogous to Coxeter length for permutations, for which the graph becomes…
We show that the Beurling algebra with a weight-dependent convolution and the group algebra $L^1(G)$ are isomorphic. In particular, using this isomorphism, we extend some results of the algebra $\mathscr{L}^1(G,\omega)$ presented in recent…
The theory of "subalgebra basis" analogous to standard basis (the generalization of Gr\"{o}bner bases to monomial ordering which are not necessarily well ordering \cite{GP1}.) for ideals in polynomial rings over a field is developed. We…
In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner…
Over the past decade, the Gr\"obner basis theory and automatic solver generation have lead to a large number of solutions to geometric vision problems. In practically all cases, the derived solvers apply a fixed elimination template to…
Lenstra and Guruswami described number field analogues of the algebraic geometry codes of Goppa. Recently, the first author and Oggier generalised these constructions to other arithmetic groups: unit groups in number fields and orders in…
It was noticed recently that, given a metric space $(X,d_X)$, the equivalence classes of metrics on the disjoint union of the two copies of $X$ coinciding with $d_X$ on each copy form an inverse semigroup $M(X)$ with respect to…
Explicit generators are found for the group of automorphisms of the algebra of one-sided inverses of a polynomial algebra in $n$ variables. An analogue of the polynomial Jacobian homomorphism is found.
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
A thin Lie algebra is a Lie algebra graded over the positive integers satisfying a certain narrowness condition. We describe several cyclic grading of the modular Hamiltonian Lie algebras $H(2\colon\n;\omega_2)$ (of dimension one less than…
The paper presents two new results concerning the varieties of Leibnitz algebras. In the case of prime characteristic p of the base field constructed example not nilpotent variety of Leibnitz algebras satisfying an Engel condition order p.…
We give presentations of the planar algebra of unipotent representations of the groups $\mathbb{C}$ and $\mathbb{F}_p$ under addition using jellyfish and light leaf style arguments. These are some of the most natural examples of…
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
For finite p-groups P of class 2 and exponent p the following are invariants of fully refined central decompositions of P: the number of members in the decomposition, the multiset of orders of the members, and the multiset of orders of…