Minimal polynomial systems for parametric matrices

In this article, we study the minimal polynomials of parametric matrices. Using the concept of (comprehensive) Gröbner systems for parametric ideals, we introduce the notion of a minimal polynomial system for a parametric matrix, i.e. we decompose the space of parameters into a finite set of cells and for each cell we give the corresponding minimal polynomial of the matrix. We also present an algorithm for computing a minimal polynomial system for a given parametric matrix.     

Gröbner Bases for the Polynomial Ring with Infinite Variables and Their Applications

We develop the theory of Gröbner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-to-one correspondences among various sets of partitions by using the division algorithm.     

NON-COMMUTATIVE GRÖBNER BASES UNDER COMPOSITION

Polynomial composition is the operation of replacing the variables in a polynomial with other polynomials. In this paper we give sufficient and necessary conditions on a set Θ of non-commutative polynomials to assure that the set G ○ Θ of composed polynomials is a Gröbner basis in the free associative algebra whenever G is. The subject was initiated by Hong, treating the commutative analogue in (1998, J. Symb. Comput. 25, 643–663).     

Toric rings generated by special stable sets of monomials

In this paper we consider some subalgebras of the d-th Veronese subring of a polynomial ring, generated by stable subsets of monomials. We prove that these algebras are Koszul, showing that the presentation ideals have Gröbner bases of quadrics with respect to suitable term orders. Since the initial monomials of the elements of these Gröbner bases are square- free, it follows by a result of STURMFELS [S, 13.15], that the algebras under consideration are normal, and thus Cohen-Macaulay.     

Symbolic Differential Elimination for Symmetry Analysis

Differential problems are ubiquitous in mathematical modeling of physical and scientific problems. Algebraic analysis of differential systems can help in determining qualitative and quantitative properties of solutions of such systems. In this tutorial paper we describe several algebraic methods for investigating differential systems.     

Quadratic nonsymmetric quaternary operads

We use computational linear algebra and commutative algebra to study spaces of relations satisfied by quadrilinear operations. The relations are analogues of associativity in the sense that they are quadratic (every term involves two operations) and nonsymmetric (every term involves the identity permutation of the arguments). We focus on determining those quadratic relations whose cubic consequences have minimal or maximal rank. We approach these problems from the point of view of the theory of algebraic operads.     

Universal Associative Envelopes of Nonassociative Triple Systems

We construct universal associative envelopes for the nonassociative triple systems arising from the trilinear operations of Bremner and Peresi applied to the 2-dimensional simple associative triple system. We use noncommutative Gröbner bases to determine monomial bases, structure constants, and centers of the universal envelopes. We show that the infinite dimensional envelopes are closely related to the down-up algebras of Benkart and Roby. For the finite dimensional envelopes, we determine the Wedderburn decompositions and classify the irreducible representations.     

Amortized multi-point evaluation of multivariate polynomials

The evaluation of a polynomial at several points is called the problem of multi-point evaluation. Sometimes, the set of evaluation points is fixed and several polynomials need to be evaluated at this set of points. Several efficient algorithms for this kind of “amortized” multi-point evaluation have been developed recently for the special cases of bivariate polynomials or when the set of evaluation points is generic. In this paper, we extend these results to the evaluation of polynomials in an arbitrary number of variables at an arbitrary set of points. We prove a softly linear complexity bound when the number of variables is fixed. Our method relies on a novel quasi-reduction algorithm for multivariate polynomials, that operates simultaneously with respect to several orderings on the monomials.     

Full Graphs and Koszul Algebras I

The main result of this article is the establishment of a new connection between combinatorics and noncommutative algebra. This is done by linking a certain class of directed graphs, called full graphs, to quotients of path algebras that are Koszul algebras.     

Ideals Generated by Diagonal 2-Minors

With a simple graph G on [n], we associate a binomial ideal P_G generated by diagonal minors of an n × n matrix X = (x_ij) of variables. We show that for any graph G, P_G is a prime complete intersection ideal and determine the divisor class group of K[X]/P_G. By using these ideals, one may find a normal domain with free divisor class group of any given rank.     

Gröbner–Shirshov Bases for Schreier Extensions of Groups

In this article, by using the Gröbner–Shirshov bases, we give characterizations of the Schreier extensions of groups when the group is presented by generators and relations. An algorithm to find the conditions of a group to be a Schreier extension is obtained. By introducing a special total order, we obtain the structure of the Schreier extension by an HNN group.     

Very ampleness of multiple of tetragonal linear systems

In this paper we continue the study of sandwich near‐rings. We introduce the sandwich near‐ring of homogeneous functions,N: = M _F(D,W,ψ) where Fis a fieldDis an F-setWa vector space over Fand ψW→D, a homogeneous map. We investigate the internal structure of Nin terms of the components D, W,and ψ     

On the peirce decompositions for freudenthal—kantor triple systems

It is the object of this paper to investigate the Peirce decomposition for Freudenthal-Kantor triple systems, by making use of the concept of anti-derivation of the triple systems.     

Resolutions of subsets of finite sets of points in projective space

Abstract

Eisenbud et al. proved a number of results regarding Gröbner bases and initial ideals of those ideals J in the free associative algebra K ?X ₁,…, X _n ? which contain the commutator ideal. We prove similar results for ideals which contains the anti-commutator ideal (the defining ideal of the exterior algebra). We define one weak notion of generic initial ideals in K ?X ₁,…, X _n ?, and show that generic initial ideals of ideals containing the anti-commutator ideal, or the commutator ideal, are finitely generated.     

Gröbner deformations and F-singularities

For polynomial ideals in positive characteristic, defining F-split rings and admitting a squarefree monomial initial ideal are different notions. In this note, we show that, however, there are strong interactions in both directions. Moreover, we provide an overview on which F-singularities are Gröbner deforming. Also, we prove the following characteristic-free statement: If $\mathfrak{p}$ is a height h prime ideal such that $\mathrm{in}({\mathfrak{p}}^{(h)})$ contains at least one squarefree monomial, then $\mathrm{in}(\mathfrak{p})$ is a squarefree monomial ideal.     

Fragments with finiteness conditions in particular over group rings

Abstract length functions on groups were introduced by Lyndon [5]. In [2] Chiswell showed that for a group action on an IR-tree there is a length function associated with each point of the tree, and moreover any length function can occur in this way. This paper establishes necessary and sufficient conditions for two length functions to arise from the same action of a group on a tree.