Related papers: Explicit Noether Normalization for Simultaneous Co…
The foundations of Ringel duality for split quasi-hereditary algebras over commutative Noetherian rings are strengthened. Several descriptions and properties of the smallest resolving subcategory containing all standard modules over split…
Numerical relativity (NR) simulations of binary black holes provide precise waveforms, but are typically too computationally expensive to produce waveforms with enough orbits to cover the whole frequency band of gravitational-wave…
Symmetry and dominance breaking can be crucial for solving hard combinatorial search and optimisation problems, but the correctness of these techniques sometimes relies on subtle arguments. For this reason, it is desirable to produce…
Strong bisimilarity on normed BPA is polynomial-time decidable, while weak bisimilarity on totally normed BPA is NP-hard. It is natural to ask where the computational complexity of branching bisimilarity on totally normed BPA lies. This…
In this document, some structured operator approximation theoretical methods for system identification of nearly eventually periodic systems, are presented. Let $\mathbb{C}^{n\times m}$ denote the algebra of $n\times m$ complex matrices.…
In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…
This paper aims at solving the Hermitian SDC problem, i.e., that of \textit{simultaneously diagonalizing via $*$-congruence} a collection of finitely many (not need pairwise commute) Hermitian matrices. Theoretically, we provide some…
In this paper, we propose two novel parallel hybrid methods for finding a common element of the set of solutions of a finite family of generalized equilibrium problems for monotone bifunctions $\left\{f_i\right\}_{i=1}^N$ and $\alpha$ -…
The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…
In this paper, we analyze the convergence %semi-convergence properties of projected non-stationary block iterative methods (P-BIM) aiming to find a constrained solution to large linear, usually both noisy and ill-conditioned, systems of…
We propose and investigate a method to optimize recurrence entanglement purification protocols. The approach is based on a numerical search in the whole set of SU(4) matrices with the aid of a quasi-Newton algorithm. Our method evaluates…
A connection between matrix orthogonal polynomials and non-abelian integrable lattices is investigated in this paper. The normalization factors of matrix orthogonal polynomials expressed by quasi-determinant are shown to be solutions of…
This paper is concerned with certifying that a given point is near an exact root of an overdetermined or singular polynomial system with rational coefficients. The difficulty lies in the fact that consistency of overdetermined systems is…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
This thesis is a study of various ways of measuring the size and complexity of finitely generated modules over a Noetherian local ring. The classical example is the multiplicity or degree. Here we investigate several variants of the degree…
There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely bounded homogeneous structures: the first one states that tractability of the CSP of such a structure is, when the structure is a model-complete…
This paper studies the multiplicity of normalized solutions to the Schr\"{o}dinger equation with mixed nonlinearities \begin{equation*} \begin{cases} -\Delta u=\lambda u+h(\epsilon x)|u|^{q-2}u+\eta |u|^{p-2}u,\quad x\in \mathbb{R}^N, \\…
Motivated by the philosophy and phenomenal success of compressed sensing, the problem of reconstructing a matrix from a sampling of its entries has attracted much attention recently. Such a problem can be viewed as an information-theoretic…
A polynomial identity testing algorithm must determine whether a given input polynomial is identically equal to 0. We give a deterministic black-box identity testing algorithm for univariate polynomials of the form $\sum_{j=0}^t c_j…
There have been some effective tools for solving (constant/parametric) semi-algebraic systems in Maple's library RegularChains since Maple 13. By using the functions of the library, e.g., RealRootClassfication, one can prove and discover…