Related papers: Another method to solve the grasshopper problem (t…
We construct a Gr\"obner Basis of the relation ideal of a polynomial, give an interpolation formula for the basis elements and explain the connection of the interpolation formula to the Buchberger--M\"oller algorithm. We present a situation…
This work wishes to support various mathematical issues concerning the iterative methods with the help of new programming languages. We consider a way to show how problems in math have an answer by using different academic resources and…
Wasserstein distance plays increasingly important roles in machine learning, stochastic programming and image processing. Major efforts have been under way to address its high computational complexity, some leading to approximate or…
In this paper, we consider lasso problems with zero-sum constraint, commonly required for the analysis of compositional data in high-dimensional spaces. A novel algorithm is proposed to solve these problems, combining a tailored active-set…
We present an alternative relatively easy way to understand and determine the zeros of a quintic whose Galois group is isomorphic to the group of rotational symmetries of a regular icosahedron. The extensive algebraic procedures of Klein in…
In the past three decades, deductive games have become interesting from the algorithmic point of view. Deductive games are two players zero sum games of imperfect information. The first player, called "codemaker", chooses a secret code and…
In the late nineteenth century, Felix Klein revived the problem of solving the quintic equation from the moribund state into which Galois had placed it. Klein's approach was a mix of algebra and geometry built on the structure of the…
According to Aristotle, a philosopher in Ancient Greece, "the whole is greater than the sum of its parts". This observation was adopted to explain human perception by the Gestalt psychology school of thought in the twentieth century. Here,…
A linear inverse problem is proposed that requires the determination of multiple unknown signal vectors. Each unknown vector passes through a different system matrix and the results are added to yield a single observation vector. Given the…
The prize-collecting Steiner tree problem PCSTP is a well-known generalization of the classical Steiner tree problem in graphs, with a large number of practical applications. It attracted particular interest during the latest (11th) DIMACS…
Many real world problems are NP-Hard problems are a very large part of them can be represented as graph based problems. This makes graph theory a very important and prevalent field of study. In this work a new bio-inspired meta-heuristics…
A wide variety of articles, starting with the famous paper (Gidas, Ni and Nirenberg in Commun. Math. Phys. 68, 209-243 (1979)) is devoted to the uniqueness question for the semilinear elliptic boundary value problem…
Although it is important both in theory as well as in applications, a theory of Birkhoff interpolation with main emphasis on the shape of the set of nodes is still missing. Although we will consider various shapes (e.g. we find all the…
We consider a general statistical linear inverse problem, where the solution is represented via a known (possibly overcomplete) dictionary that allows its sparse representation. We propose two different approaches. A model selection…
We propose a generalization of the Weierstrass iteration for over-constrained systems of equations and we prove that the proposed method is the Gauss-Newton iteration to find the nearest system which has at least $k$ common roots and which…
The aim of this paper is to introduce a new Newton-type iterative method and then to show that this process converges to the unique solution of the scalar nonlinear equation f(x)=0 under weaker conditions involving only f and f' by fixed…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…
Grasping user-specified objects is crucial for robotic assistants; however, most current 6-DoF grasp detection methods are object-agnostic, making it challenging to grasp specific targets from a scene. To achieve that, we present GoalGrasp,…
We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…
The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals $\left\{[a_{i,1},a_{i,2}]\right\}_{i=1}^n$ and a target integer $T,$ the ISSP is to find a set of integers, at most…