相关论文: Gr\"obner geometry of vertex decompositions and of…

For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…

We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…

The theorem of Hilbert- Burch provides a description of codimension two determinantal varieties and their deformations in terms of their presentation matrices. In this work we use this correspondence to study properties of determinantal…

Let $V$ be the weighted projective variety defined by a weighted homogeneous ideal $J$ and $C$ a maximal cone in the Gr\"obner fan of $J$ with $m$ rays. We construct a flat family over $\mathbb A^m$ that assembles the Gr\"obner…

We provide a combinatorial way of computing Speyer's $g$-polynomial on arbitrary Schubert matroids via the enumeration of certain Delannoy paths. We define a new statistic of a basis in a matroid, and express the $g$-polynomial of a…

We introduce a dbar-formulation of the orthogonal polynomials on the complex plane, and hence of the related normal matrix model, which is expected to play the same role as the Riemann-Hilbert formalism in the theory of orthogonal…

We study semiorthogonal decompositions of bounded derived categories of gentle algebras and how they are manifested in the geometric model of these categories as constructed by Opper, Plamondon and Schroll. We prove that there is a…

The set of common roots of a finite set $I$ (it is an ideal) of homogeneous polynomials is known as projective algebraic set $V$. In this article I show how to dualize such projective algebraic sets $V$ by elimination of variables from a…

The tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated…

Abhyankar defined an ideal to be Hilbertian if its Hilbert polynomial coincides with its Hilbert function for all nonnegative integers. In 1984, he proved that the ideal of (r+1)-order minors of a generic p x q matrix is Hilbertian. We give…

In 1954, Alston S. Householder published \textit{Principles of Numerical Analysis}, one of the first modern treatments on matrix decomposition that favored a (block) LU decomposition-the factorization of a matrix into the product of lower…

An important building block in all current asymptotically fast algorithms for matrix multiplication are tensors with low border rank, that is, tensors whose border rank is equal or very close to their size. To find new asymptotically fast…

We discuss algorithmic approach to growth of the codimension sequences of varieties of multilinear algebras, or, equivalently, the sequences of the component dimensions of algebraic operads. The (exponentional) generating functions of such…

We determine a Groebner basis for the secant ideal of the toric ideal associated to the second hypersimplex, with respect to any circular term order. The Groebner basis of the secant ideal requires polynomials of odd degree up to n. This…

We consider a certain class of Schubert varieties of the affine Grassmannian of type A. By embedding a Schubert variety into a finite-dimensional Grassmannian, we construct an explicit basis of sections of the basic line bundle by…

We prove that, for 3 < m < n-1, the Grassmannian of m-dimensional subspaces of the space of skew-symmetric forms over a vector space of dimension n is birational to the Hilbert scheme of the degeneracy loci of m global sections of Omega(2),…

The development of higher order finite elements methods has become an active research area. The deformation method for mesh generation has achieved a prescribed positive Jacobian determinant constraint and it has been a useful method for…

A module of a graph G is a set of vertices that have the same set of neighbours outside. Modules of a graphs form a so-called partitive family and thereby can be represented by a unique tree MD(G), called the modular decomposition tree.…

We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…

In the local setting, Gr\"obner cells are affine spaces that parametrize ideals in $\mathbf{k}[\![x,y]\!]$ that share the same leading term ideal with respect to a local term ordering. In particular, all ideals in a cell have the same…