Related papers: An effective method for computing Grothendieck poi…
Ihe first author presented an efficient algorithm for computing involutive (and reduced Groebner) bases. In this paper, we consider a modification of this algorithm which simplifies matters to understand it and to implement. We prove…
We extend the Levenberg-Marquardt method on Euclidean spaces to Riemannian manifolds. Although a Riemannian Levenberg-Marquardt (RLM) method was produced by Peeters in 1993, to the best of our knowledge, there has been no analysis of…
For any commutative finite flat group scheme, Grothendieck constructed an embedding into some smooth group scheme. This embedding is called the Grothendieck resolution. Let $p$ be a prime number and $n$ a positive integer. In connection…
In this paper, we present a method using AI techniques to solve a case of pure mathematics applications for finding narrow admissible tuples. The original problem is formulated into a combinatorial optimization problem. In particular, we…
Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…
In this paper we introduce new notions of local extremality for finite and infinite systems of closed sets and establish the corresponding extremal principles for them called here rated extremal principles. These developments are in the…
This paper advocates a novel framework for segmenting a dataset in a Riemannian manifold $M$ into clusters lying around low-dimensional submanifolds of $M$. Important examples of $M$, for which the proposed clustering algorithm is…
Some affirmative answers are given to Huneke's problems. The calculation of local cohomology modules with respect to an arbitrary pair of ideals $I,J$ can be reduced to calculation of local cohomology modules with respect to a pair of…
The locally modified finite element method, which is introduced in [Frei, Richter: SINUM 52(2014), p. 2315-2334], is a simple fitted finite element method that is able to resolve weak discontinuities in interface problems. The method is…
This is a research announcement on what is best termed `nonlocal' methods in mathematics. (This is not to be confused with global analysis.) The nonlocal formulation of physics in \cite{principia} points to a fresh viewpoint in mathematics:…
Stable computational algorithms for the approximate solution of the Cauchy problem for nonstationary problems are based on implicit time approximations. Computational costs for boundary value problems for systems of coupled multidimensional…
This paper is motivated by questions such as P vs. NP and other questions in Boolean complexity theory. We describe an approach to attacking such questions with cohomology, and we show that using Grothendieck topologies and other ideas from…
In this paper we study local cohomology of finitely generated bigraded modules over a standard bigraded ring with respect to the irrelevant bigraded ideals and establish a duality theorem. Several applications are considered.
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…
Recently, the influence of potentially present symmetries has begun to be studied in complex networks. A typical way of studying symmetries is via the automorphism group of the corresponding graph. Since complex networks are often subject…
The study on the partial differential equations (systems) in the graph setting is a hot topic in recent years because of their applications to image processing and data clustering. Our motivation is to develop some existence results for…
A stochastic-gradient-based interior-point algorithm for minimizing a continuously differentiable objective function (that may be nonconvex) subject to bound constraints is presented, analyzed, and demonstrated through experimental results.…
Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very…
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…
In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…