Related papers: On the moment problem of closed semi-algebraic set…
We propose a well-posed Maxwell-type boundary condition for the linear moment system in half-space. As a reduction of the Boltzmann equation, the moment equations are available to model Knudsen layers near a solid wall, where proper…
The following is an improved version of Chapter 12 of my book [Sm17]. Among others, we present a new unified approach to the Archimedean Positivstellens\"atze for quadratic modules and semirings in Section 12.4 and we add a number of new…
In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…
We introduce moment maps for continuous unitary representations of general topological groups. For solvable separable locally compact groups, we prove that the closure of the image of the moment map of any representation is convex.
This paper is about the general truncated matrix-valued moment problem. Let $\mathcal{H}_q$ denote the complex Hermitian $q\times q$-matrices, $q\in \mathbb{N}$. Suppose that $(\mathcal{X},\mathfrak{X})$ is a measurable space and…
We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…
Given a multi-index sequence $\mu_{\mathbf{k}}$, $\mathbf{k} = (k_1,..., k_n) \in \mathbb{N}_0^n$, necessary and sufficient conditions are given for the existence of a regular Borel polymeasure $\gamma$ on the unit interval $I= [0,1]$ such…
We introduce the problem of finding a satisfying assignment to a CNF formula that must further belong to a prescribed input subspace. Equivalent formulations of the problem include finding a point outside a union of subspaces (the…
In this note we introduce three problems related to the topic of finite Hausdorff moments. Generally speaking, given the first n+1 (n in N or n=0) moments, alpha(0), alpha(1),..., alpha(n), of a real-valued continuously differentiable…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…
A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…
In this paper, we propose two new methods for solving Set Constraint Problems, as well as a potential polynomial solution for NP-Complete problems using quantum computation. While current methods of solving Set Constraint Problems focus on…
The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…
In this paper, we propose a new easily implementable method for solving a class of semi-infinite programs, where an approximate linear semidefinite program is constructed for the concerned semi-infinite program based on the duality theory…
We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable…
We study the truncated two-dimensional moment problem (with rectangular data): to find a non-negative measure $\mu(\delta)$, $\delta\in\mathfrak{B}(\mathbb{R}^2)$, such that $\int_{\mathbb{R}^2} x_1^m x_2^n d\mu = s_{m,n}$, $0\leq m\leq…
In the Hedge Cut problem, the edges of a graph are partitioned into groups called hedges, and the question is what is the minimum number of hedges to delete to disconnect the graph. Ghaffari, Karger, and Panigrahi [SODA 2017] showed that…
In this paper we improve the bounds for the Carath\'eodory number, especially on algebraic varieties and with small gaps (not all monomials are present). We provide explicit lower and upper bounds on algebraic varieties, $\mathbb{R}^n$, and…