Related papers: Homogeneous Buchberger algorithms and Sullivant's …
In the present paper we prove that all homogeneous ideals with linear quotients are componentwise linear. Moreover we establish an extended version of Eliahou-Kervaire formula for graded Betti numbers.
In this article we study specializations of multigradings and apply them to the problem of the computation of the arithmetical rank of a lattice ideal $I_{L_{\mathcal{G}}} \subset K[x_{1},...,x_{n}]$. The arithmetical rank of…
In this paper we continue the study of the subalgebra lattice of a Leibniz algebra. In particular, we find out that solvable Leibniz algebras with an upper semi-modular lattice are either almost-abelian or have an abelian ideal spanned by…
Improved Kogut-Susskind Hamiltonians for quantum simulations of non-Abelian Yang-Mills gauge theories are developed for honeycomb (2+1D) and hyperhoneycomb (3+1D) spatial tessellations. This is motivated by the desire to identify lattices…
We give a simplified presentation of the obstacle problem approach to stochastic homogenization for elliptic equations in nondivergence form. Our argument also applies to equations which depend on the gradient of the unknown function. In…
We discuss factorization of the hypergeometric-type difference equations on the uniform lattices and show how one can construct a dynamical algebra, which corresponds to each of these equations. Some examples are exhibited, in particular,…
We propose a new approximate factorization for solving linear systems with symmetric positive definite sparse matrices. In a nutshell the algorithm is to apply hierarchically block Gaussian elimination and additionally compress the fill-in.…
There is studied problem on solvability of linear non-homogeneous differential equation of higher even order. There is proved the theorem on necessary and sufficient conditions on existence of solutions to the equation in the Schwartz…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
We propose a new adaptive algorithm for the approximation of the Landau-Lifshitz-Gilbert equation via a higher-order tangent plane scheme. We show that the adaptive approximation satisfies an energy inequality and demonstrate numerically,…
We present new results building on the conservative deterministic spectral method for the space inhomogeneous Boltzmann equation developed by Gamba and Tharkabhushaman. This approach is a two-step process that acts on the weak form of the…
The discontinuous Galerkin time-stepping method has many advantageous properties for solving parabolic equations. However, it requires the solution of a large nonsymmetric system at each time-step. This work develops a fully robust and…
This paper presents a symbolic algorithm for solving band matrix systems of linear algebraic equations with heptadiagonal coefficient matrices. The algorithm is given in pseudocode. A theorem which gives the condition for the algorithm to…
The Bernstein-B\'ezier form of a polynomial is widely used in the fields of computer aided geometric design, spline approximation theory and, more recently, for high order finite element methods for the solution of partial differential…
We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known. We extend the work of Renegar [5] by taking a different…
We present economical iterative algorithms built on the Biconjugate $A$-Orthonormalization Procedure for real unsymmetric and complex non-Hermitian systems. The principal characteristics of the developed solvers is that they are fast…
In contexts where relevant problems can easily attain configuration spaces of enormous sizes, solving Linear Differential Equations (LDEs) can become a hard achievement for classical computers; on the other hand, the rise of quantum…
By exploiting double-penalty terms for the primal subproblem, we develop a novel relaxed augmented Lagrangian method for solving a family of convex optimization problems subject to equality or inequality constraints. The method is then…
In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work,…
We consider two-dimensional lattice equations defined on an elementary square of the Cartesian lattice and depending on the variables at the corners of the quadrilateral. For such equations the property often associated with integrability…