相关论文: On the symmetric and Rees algebras of certain dete…
The paper is devoted to prove a version of Milnor-Moore Theorem for connected braided bialgebras that are infinitesimally cocommutative. Namely in characteristic different from 2, we prove that, for a given connected braided bialgebra $A$…
A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…
A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an…
Let $A$ be a commutative algebra equipped with an action of a group $G$. The so-called $G$-primes of $A$ are the equivariant analogs of prime ideals, and of central importance in equivariant commutative algebra. When $G$ is an infinite…
We study the interplay between the differential Galois group and the Lie algebra of infinitesimal symmetries of systems of linear differential equations. We show that some symmetries can be seen as solutions of a hierarchy of linear…
We determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated by a set of monomials and one binomial.
We present in this paper a routine which construct the ideal generated by a list of elements in a matrix Lie algebra at any particular characteristic. We have used this algorithm to analyze the problem of the simplicity of some Lie…
In 1980, White conjectured that the toric ideal associated to a matroid is generated by binomials corresponding to a symmetric exchange. In this paper, we prove that classes of matroids for which the toric ideal is generated by quadrics and…
The goal of this note is to present Kaplansky's proof of the Regular Element Property and to explain how this argument can be adapted to the case of a coherent, strongly discrete and Noetherian (with an inductive definition of Noetherian)…
We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common…
The purpose of this note is to give an (esentially optimal) effective version of Matsusaka's Big theorem for smooth projective surfaces.
A constructive procedure is given to determine all ideals of a solvable Lie algebra. This is used in determining algorithmically all conjugacy classes of subalgebras of a given solvable Lie algebra.
We present some examples of squarefree monomial ideals whose arithmetical rank can be computed using linear algebraic considerations.
The purpose of the paper is to review a variety of recent developments in the theory of positive solutions of general linear elliptic and parabolic equations of second-order on noncompact Riemannian manifolds, and to point out a number of…
This paper opens the series of articles supplemental to the series (hep-th/9405050,q-alg/9610026,q-alg/9611003,q-alg/9611019,funct-an/9611003), which also lies in lines of general ideology exposed in the review (mp_arc/96-477). The main…
Given a skew-symmetric matrix $X$, the Pfaffian of $X$ is defined as the square root of the determinant of $X$. In this article, we give the explicit defining equations of the Rees algebra of a Pfaffian ideal $I$ generated by the maximal…
We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…
We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
In this paper, we introduce the notion of binomial edge ideals of a clutter and obtain results similar to those obtained for graphs by Rauf \& Rinaldo in \cite{raufrin}. We also answer a question posed in their paper.