Related papers: Groebner basis and the Anick resolution for U_K(sl…
In this article we present an elementary introduction to the theory of minimal surfaces in Euclidean spaces $\mathbb R^n$ for $n\ge 3$ by using only elementary calculus of functions of several variables at the level of a typical second-year…
We describe a general technique to study Dirac operators on noncommutative spaces under some additional assumptions. The main idea is to capture the compact resolvent condition in a combinatorial set up. Using this, we then prove that for a…
We present basic properties of Gr\"obner bases of submodules of a free module of finite rank over a polynomial ring $R$ with coefficients in a graded truncated discrete valuations ring $A$. As an application, we give a criterion for a…
Let P_nk(x) denote the sum of the lowest k+1 terms in the expansion of (1+x)^n. We investigate the irreducibility of P_nk(x) and more general univariate polynomials related to it. Polynomials P_nk(x) naturally arise in Schubert calculus,…
We present a reduced basis approach to solve the convected Helmholtz equation with several physical parameters. Physical parameters characterize the aeroacoustic wave propagation in terms of the wave and Mach numbers. We compute solutions…
In this paper, a computationally simple and explicit method of constructing recursive sequence of primitive polynomials of degree $n2^k (k = 1, 2, 3,\ldots)$ over $\mathbb{F}_{q}$ is given.
In this article we produce Groebner bases for the defining ideal of a monomial curve that corresponds to an almost arithmetic sequence of positive integers, correcting previous work of Sengupta,(2003).
In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…
Let $S=(s_1,s_2,...,s_m,...)$ be a linear recurring sequence with terms in $GF(q^n)$ and $T$ be a linear transformation of $GF(q^n)$ over $GF(q)$. Denote $T(S)=(T(s_1),T(s_2),...,T(s_m),...)$. In this paper, we first present counter…
It is shown that the methods and algorithms, developed in (A. Capani et al., Computing minimal finite free resolutions, {\it Journal of Pure and Applied Algebra}, (117& 118)(1997), 105 -- 117; M. Kreuzer and L. Robbiano, {\it Computational…
Let K be a field with a valuation and let S be the polynomial ring S:= K[x_1,..., x_n]. We discuss the extension of Groebner theory to ideals in S, taking the valuations of coefficients into account, and describe the Buchberger algorithm in…
We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…
Reconstructing 3D object from a single image (RGB or depth) is a fundamental problem in visual scene understanding and yet remains challenging due to its ill-posed nature and complexity in real-world scenes. To address those challenges, we…
We consider the solution of spectral problems with elliptic coefficients in the framework of the Hermite ansatz. We show that the search for exactly solvable potentials and their spectral characteristics is reduced to a system of polynomial…
This paper is devoted to the study of normalized solutions to the Kirchhoff type equation with a logarithmic perturbation\[-\left(a+b\int_{\mathbb{R}^3}|\nabla u|^2 \,\mathrm{d}x \right) \Delta u=\lambda u+|u|^{p-2}u+u\log u^2,\quad x…
The canonical sylvan resolution is a resolution of an arbitrary monomial ideal over a polynomial ring that is minimal and has an explicit combinatorial formula for the differential. The differential is a weighted sum over lattice paths of…
We write a procedure for constructing noncommutative Groebner bases. Reductions are done by particular linear projectors, called reduction operators. The operators enable us to use a lattice construction to reduce simultaneously each…
Using quantum differential operators, we construct a super representation of $U_v(\mathfrak{gl}_{m|n})$ on a certain polynomial superalgebra. We then extend the representation to its formal power series algebra which contains a…
The interpolation step of Guruswami and Sudan's list decoding of Reed-Solomon codes poses the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is…
The purpose of this paper is to construct a crepant resolution of quotient singularities by trihedral groups ( finite subgroups of SL(3,C) of certain type ), and prove that each Euler number of the minimal model is equal to the number of…