Related papers: Homogeneous Buchberger algorithms and Sullivant's …
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…
We develop a notion of covariant differential calculus for Hopf algebroids. As a byproduct, we prove analogues of the fundamental theorem of Hopf modules and a Takeuchi-Schneider equivalence in the realm of Hopf algebroids. The resulting…
We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is…
Matrix-valued Cauchy bi-orthogonal polynomials were proposed in this paper, together with its quasideterminant expression. It is shown that the coefficients in four-term recurrence relation for matrix-valued Cauchy bi-orthogonal polynomials…
Motivated by Ridgway's proof of the perceptron algorithm, we study a simple subgradient method for convex inequality systems in Hilbert space. Assuming strict feasibility and bounded subgradients, we establish finite termination for several…
We study a method for solving the homogeneous Bethe-Salpeter equation. By introducing a `fictitious' eigenvalue $\lambda$ the homogeneous Bethe-Salpeter equation is interpreted as a linear eigenvalue equation, where the bound state mass is…
We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted…
Variational problems under uniform quasiconvex constraints on the gradient are studied. In particular, existence of solutions to such problems is proved as well as existence of lagrange multipliers associated to the uniform constraint. They…
In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…
For the spatially homogeneous Boltzmann equation with hard po- tentials and Grad's cutoff (e.g. hard spheres), we give quantitative estimates of exponential convergence to equilibrium, and we show that the rate of exponential decay is…
The aim of our paper is to construct pseudo $H$-type algebras from the covering free nilpotent two-step Lie algebra as the quotient algebra by an ideal. We propose an explicit algorithm of construction of such an ideal by making use of a…
We describe a new algorithm for computing Whitney stratifications of complex projective varieties. The main ingredients are (a) an algebraic criterion, due to L\^e and Teissier, which reformulates Whitney regularity in terms of conormal…
In this paper we shall consider the Lie algebra of column-finite infinite matrices indexed by positive integers $\mathbb{N}$, describe the lattice of its ideals for arbitrary field $K$ and study its derivations over any commutative, unital…
We present a general framework for matching with transferable utility (TU) that accommodates arbitrary heterogeneity without relying on the logit structure. The optimal assignment problem is characterized by tractable linear programming…
The paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in…
The molecule solution of an equation related to the lattice Boussinesq equation is derived with the help of determinantal identities. It is shown that this equation can for certain sequences be used as a numerical convergence acceleration…
In this paper we propose a variant of the random coordinate descent method for solving linearly constrained convex optimization problems with composite objective functions. If the smooth part of the objective function has Lipschitz…
We represent low dimensional quantum mechanical Hamiltonians by moderately sized finite matrices that reproduce the lowest O(10) boundstate energies and wave functions to machine precision. The method extends also to Hamiltonians that are…
Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…
Looking for an efficient algorithm for the computation of the homology groups of an algebraic set or even a semi-algebraic set is an important problem in the effective real algebraic geometry. Recently, Peter Burgisser, Felipe Cucker and…