相关论文: Fast algorithm for border bases of Artinian Gorens…

We prove that a sequence $h$ of non-negative integers is the Hilbert function of some Artinian Gorenstein algebra with the strong Lefschetz property if and only if it is an SI-sequence. This generalizes the result by T. Harima which…

Let $X$ be an $n\times m$ matrix of indeterminates over a field $K$ (of sufficiently large characteristic) and $M_t$ the set of $m$-minors of $X$. We consider two objects: (1) the Ress algebra of the polynomial ring $K[X]$ with respect to…

This paper initiates a systematic study for key properties of Artinian Gorenstein \(K\)-algebras having binomial Macaulay dual generators. In codimension 3, we demonstrate that all such algebras satisfy the strong Lefschetz property, can be…

Exploiting symmetry in Groebner basis computations is difficult when the symmetry takes the form of a group acting by automorphisms on monomials in finitely many variables. This is largely due to the fact that the group elements, being…

We determine the border subrank of higher order structure tensors of several families of algebras, and in particular obtain the following results. (1) We determine tight bounds on the border subrank of $k$-fold matrix multiplication and…

Let R be a polynomial ring in r variables and D a dual ring upon which R acts as partial differential operators (classical apolarity). For a type two graded level Artinian algebras A=R/I, of socle degree j we consider the family of Artinian…

We present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a commutative field K of characteristic zero. In order to reach explicit representatives of some generators of…

We compute the partition and correlation generating functions for the Heisenberg intertwiner generalized vertex operator algebra on a genus $g$ Riemann surface in the Schottky uniformization. These are expressed in terms of differential…

In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert…

In this note, we introduce a novel norm, termed the $t-$Berezin norm, on the algebra of all bounded linear operators defined on a reproducing kernel Hilbert space $\mathcal{H}$ as $$\|A\|_{t-ber} = \sup_{ \lambda, \mu \in \Omega} \left\{…

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.

We review our algebraic framework for linear boundary problems (concentrating on ordinary differential equations). Its starting point is an appropriate algebraization of the domain of functions, which we have named integro-differential…

We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…

We survey our recently proposed method for constructing biholomorphic invariants of quasihomogeneous isolated hypersurface singularities and, more generally, invariants of graded Artinian Gorenstein algebras. The method utilizes certain…

In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual…

In this paper, we analyze the iteration-complexity of Generalized Forward--Backward (GFB) splitting algorithm, as proposed in \cite{gfb2011}, for minimizing a large class of composite objectives $f + \sum_{i=1}^n h_i$ on a Hilbert space,…

We present a new algorithm for computing integral bases in algebraic function fields of one variable, or equivalently for constructing the normalization of a plane curve. Our basic strategy makes use of the concepts of localization and…

Let $H\_0, ..., H\_n$ be $m \times m$ matrices with entries in $\QQ$ and Hankel structure, i.e. constant skew diagonals. We consider the linear Hankel matrix $H(\vecx)=H\_0+\X\_1H\_1+...+\X\_nH\_n$ and the problem of computing sample points…

We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…