Related papers: A Majorization Order on Monomials and Termination …
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it is done in transformational approaches to logic program…
Dimensionality reduction in mechanical vibratory systems poses challenges for distributed structures including geometric nonlinearities, mainly because of the lack of invariance of the linear subspaces. A reduction method based on direct…
Nowadays, many strategies to solve polynomial systems use the computation of a Gr{\"o}bner basis for the graded reverse lexicographical ordering, followed by a change of ordering algorithm to obtain a Gr{\"o}bner basis for the…
We consider the semiconjugate factorization and reduction of order for non-autonomous, nonlinear, higher order difference equations containing linear arguments. These equations have appeared in several mathematical models in biology and…
Fast algorithms for submodular maximization problems have a vast potential use in applicative settings, such as machine learning, social networks, and economics. Though fast algorithms were known for some special cases, only recently…
An algebraic approach for factorizing nonlinear partial differential equations (PDEs) and systems of PDEs is provided. In the particular case of second order linear and nonlinear PDEs and systems of PDEs, necessary and sufficient conditions…
Randomization is a fundamental tool used in many theoretical and practical areas of computer science. We study here the role of randomization in the area of submodular function maximization. In this area most algorithms are randomized, and…
Maximizing monotone submodular functions under a matroid constraint is a classic algorithmic problem with multiple applications in data mining and machine learning. We study this classic problem in the fully dynamic setting, where elements…
In this paper we close the cases that were left open in our earlier works on the study of conformally invariant systems of second-order differential operators for degenerate principal series. More precisely, for these cases, we find the…
We set up a parametrised monadic translation for a class of call-by-value functional languages, and prove a corresponding soundness theorem. We then present a series of concrete instantiations of our translation, demonstrating that a number…
We consider a large family of problems in which an ordering (or, more precisely, a chain of subsets) of a finite set must be chosen to minimize some weighted sum of costs. This family includes variations of Min Sum Set Cover (MSSC), several…
The primary focus of this paper is on designing an inexact first-order algorithm for solving constrained nonlinear optimization problems. By controlling the inexactness of the subproblem solution, we can significantly reduce the…
Employing the general ordering theorem, operational methods and the incomplete 2-dimensional Hermite polynomials we have derived the t-ordered expansion of the Fock space projectors. Using the result, a new integration formula regarding…
Sum of squares (SOS) optimization is a powerful technique for solving problems where the positivity of a polynomials must be enforced. The common approach to solve an SOS problem is by relaxation to a Semidefinite Program (SDP). The main…
We prove that majorization relations hold step by step in the Quantum Fourier Transformation (QFT) for phase-estimation algorithms considered in the canonical decomposition. Our result relies on the fact that states which are mixed by…
In this paper, we show that higher-order optimality conditions can be obtain for arbitrary nonsmooth function. We introduce a new higher-order directional derivative and higher-order subdifferential of Hadamard type of a given proper…
We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general solution, but if the set of atoms permitted in…
The purpose of this work is to introduce a new idea of how to avoid the factorization of large matrices during the solution of stiff systems of ODEs. Starting from the general form of an explicit linear multistep method we suggest to…
We construct explicit representations of the Heisenberg-Weyl algebra [P,M]=1 in terms of ladder operators acting in the space of Sheffer-type polynomials. Thus we establish a link between the monomiality principle and the umbral calculus.…
Derivatives are an important tool for single-objective optimization. In fact, it is commonly accepted that derivative-based methods present a better performance than derivative-free optimization approaches. In this work, we will show that…