Related papers: Newton iteration for lexicographic Gr\"obner bases…
The Standard Model of particle physics can be deduced from a small number of axioms within Connes' noncommutative geometry (NCG). Boyle and Farnsworth [New J. Phys. 16 (2014) 123027] proposed to interpret Connes' approach as an algebra…
Several constructive homological methods based on noncommutative Gr\"obner bases are known to compute free resolutions of associative algebras. In particular, these methods relate the Koszul property for an associative algebra to the…
By employing the (de)homogenization technique in a relatively extensive setting, this note studies in detail the relation between non-homogeneous Gr\"obner bases and homogeneous Gr\"obner bases. As a consequence, a general principle of…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…
The numerical integration of an analytical function $f(x)$ using a finite set of equidistant points can be performed by quadrature formulas like the Newton-Cotes. Unlike Gaussian quadrature formulas however, higher-order Newton-Cotes…
For the ideal $I = \langle y_1 + \dots + y_n, y^2_1, \dots , y^2_n \rangle$ in $R = {\mathbb F}[y_1, \dots , y_n]$ with char($\mathbb F$) = 0, we show that the reduced Gr\"obner basis with lex-order consists of polynomials $g_\alpha$ that…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…
In this note we shall give a new proof to a quadrature formulae due to Newton.
We present some advances, both from a theoretical and from a computational point of view, on a quadratic vector equation (QVE) arising in Markovian Binary Trees. Concerning the theoretical advances, some irreducibility assumptions are…
Hyper-parameters play a major role in the learning and inference process of latent Dirichlet allocation (LDA). In order to begin the LDA latent variables learning process, these hyper-parameters values need to be pre-determined. We propose…
In the sl\_n case, A. Berenstein and A. Zelevinsky studied the Sch\"{u}tzenberger involution in terms of Lusztig's canonical basis, [3]. We generalize their construction and formulas for any semisimple Lie algebra. We use for this the…
Gr\"obner bases of binomial ideals arising from finite lattices will be studied. In terms of Gr\"obner bases and initial ideals, a characterization of finite distributive lattices as well as planar distributive lattices will be given.
We study the Newton stratification in the $B_\mathrm{dR}^+$-Grassmannian for $\mathrm{GL}_n$ associated to an arbitrary (possibly nonbasic) element of $B(\mathrm{GL}_n)$. Our main result classifies all nonempty Newton strata in an arbitrary…
We study almost complete intersection ideals in a polynomial ring, generated by powers of all the variables together with a power of their sum. Our main result is an explicit description of the reduced Gr\"obner bases for these ideals under…
We consider the convergence of iterative solvers for problems of nonlinear magnetostatics. Using the equivalence to an underlying minimization problem, we can establish global linear convergence of a large class of methods, including the…
We present a Newton-type method that converges fast from any initialization and for arbitrary convex objectives with Lipschitz Hessians. We achieve this by merging the ideas of cubic regularization with a certain adaptive…
We consider minimization of a smooth nonconvex objective function using an iterative algorithm based on Newton's method and the linear conjugate gradient algorithm, with explicit detection and use of negative curvature directions for the…
The scope of this paper is twofold. First, we derive rigorously a low-velocity and Galilei-covariant limit of the gravitoelectromagnetic (GEM) equations. Subsequently, these reduced GEM equations are coupled to the Schr\"odinger equation…