Related papers: Triangular resolutions and effectiveness for holom…
The standard generators of tridiagonal algebras, recently introduced by Terwilliger, are shown to generate a new (in)finite family of mutually commuting operators which extends the Dolan-Grady construction. The involution property relies on…
In this paper, we present a generalized Cuppen's divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. We extend the Cuppen's work to the rank two modifications of the form $A =T +\beta_1\bw_1\bw_1^T +…
We propose an approach based on quadratic approximations for solving general Mixed-Integer Nonlinear Programming (MINLP) problems. Specifically, our approach entails the global approximation of the epigraphs of constraint functions by means…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
Numerous interesting properties in nonlinear systems analysis can be written as polynomial optimization problems with nonconvex sum-of-squares problems. To solve those problems efficiently, we propose a sequential approach of local…
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…
We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…
Super-resolution imaging aims at improving the resolution of an image by enhancing it with other images or data that might have been acquired using different imaging techniques or modalities. In this paper we consider the task of doubling,…
Stochastic Barrier Functions (SBFs) certify the safety of stochastic systems by formulating a functional optimization problem, which state-of-the-art methods solve using Sum-of-Squares (SoS) polynomials. This work focuses on polynomial SBFs…
The paper is concerned with the existence of positive weak solutions for a new class of $\left( p,q\right) $-Laplacian elliptic systems in a bounded domain by means of the method of sub-super solutions. Particularly, we do not need any sign…
The objective of this study is to present a novel, efficient, and fast direct method for solving linear systems of equations whose coefficient matrix is a tridiagonal Quasi-Toeplitz matrix. Such matrices are frequently encountered in the…
Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…
We approach the Max-3-Cut problem through the lens of maximizing complex-valued quadratic forms and demonstrate that low-rank structure in the objective matrix can be exploited, leading to alternative algorithms to classical semidefinite…
A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…
We consider the NP-hard problem of minimizing a separable concave quadratic function over the integral points in a polyhedron, and we denote by D the largest absolute value of the subdeterminants of the constraint matrix. In this paper we…
Fault tolerant algorithms for the numerical approximation of elliptic partial differential equations on modern supercomputers play a more and more important role in the future design of exa-scale enabled iterative solvers. Here, we combine…
The goal of this paper is to give a new method of constructing finite-dimensional semisimple triangular Hopf algebras, including minimal ones which are non-trivial (i.e. not group algebras). The paper shows that such Hopf algebras are quite…
In this paper, new schemes for a squarer, multiplier and divider of complex numbers are proposed. Traditional structural solutions for each of these operations require the presence some number of general-purpose binary multipliers. The…
Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…
In the context of 4d effective gravity theories with 8 supersymmetries, we propose to unify, strenghten, and refine the several swampland conjectures into a single statement: the structural criterion, modelled on the structure theorem in…