Related papers: A matrix criterion and algorithmic approach for th…

Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…

We denote by $\mathbb Z_2$ the prime field of two elements and by $P_t = \mathbb Z_2[x_1, \ldots, x_t]$ the polynomial algebra of $t$ generators $x_1, \ldots, x_t$ with the degree of each $x_i$ being one. Let $\mathcal A_2$ be the Steenrod…

This paper introduces a Moment-Quaternion-Sum-of-Squares (QSOS) hierarchy for solving a class of quaternion polynomial optimization problems. This hierarchy is formulated directly in the quaternion domain and consists of a sequence of…

Let (E,D,P) be a flat vector bundle with a parabolic structure over a punctured Riemann surface, (M,g). We consider a deformation of the harmonic metric equation which we call the Poisson metric equation. This equation arises naturally as…

In this paper, an exact algorithm in polynomial time is developed to solve unrestricted binary quadratic programs. The computational complexity is $O\left( n^{\frac{15}{2}}\right) $, although very conservative, it is sufficient to prove…

Let $P_k$ be the graded polynomial algebra $\mathbb F_2[x_1,x_2,\ldots ,x_k]$, with the degree of each $x_i$ being 1, regarded as a module over the mod-2 Steenrod algebra $\mathcal A$, and let $GL_k$ be the general linear group over the…

We consider the problem of counting matrices over a finite field with fixed rank and support contained in a fixed set. The count of such matrices gives a $q$-analogue of the classical rook and hit numbers, known as the $q$-rook and $q$-hit…

A large number of NP-hard graph problems can be solved in $f(w)n^{O(1)}$ time and space when the input graph is provided together with a tree decomposition of width $w$, in many cases with a modest exponential dependence $f(w)$ on $w$.…

We study the computational complexity of the problem SFT (Sum-free Formula partial Trace): given a tensor formula F over a subsemiring of the complex field (C,+,.) plus a positive integer k, under the restrictions that all inputs are column…

For a finite set $\mathcal{F}$ of graphs, the $\mathcal{F}$-Hitting problem aims to compute, for a given graph $G$ (taken from some graph class $\mathcal{G}$) of $n$ vertices (and $m$ edges) and a parameter $k\in\mathbb{N}$, a set $S$ of…

In the classic Integer Programming (IP) problem, the objective is to decide whether, for a given $m \times n$ matrix $A$ and an $m$-vector $b=(b_1,\dots, b_m)$, there is a non-negative integer $n$-vector $x$ such that $Ax=b$. Solving (IP)…

Let $\RR$ be a real closed field (e.g. the field of real numbers) and $\mathscr{S} \subset \RR^n$ be a semi-algebraic set defined as the set of points in $\RR^n$ satisfying a system of $s$ equalities and inequalities of multivariate…

Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…

In recent years, various subspace algorithms have been developed to handle large-scale optimization problems. Although existing subspace Newton methods require fewer iterations to converge in practice, the matrix operations and full…

The motivic hit problem asks for a minimal set of generators of $H^{*,*}(BV_n;\mathbb{F}_2)$ as a module over the motivic Steenrod algebra. For the distinguished degrees $d=k+2d_1$ with $d_1=(n-1)(2^k-1)$, Kameko constructed a top layer…

We study solutions of a homogeneous quadratic equation $q(x_0,\dots, x_n)=0$, defined over a field $K$, where the $x_i$ are themselves homogeneous polynomials of some degree $d$ in $r+1$ variables. Equivalently, we are looking at rational…

In this paper we present the first deterministic polynomial time algorithm for determining the existence of a Hamiltonian cycle and finding a Hamiltonian cycle in general graphs. Our algorithm can also solve the Hamiltonian path problem in…

In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…

We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in…

Partial differential equations (PDEs) play a crucial role in financial mathematics, particularly in portfolio optimization, and solving them using classical numerical or neural network methods has always posed significant challenges. Here,…