English
Related papers

Related papers: On the moment problem of closed semi-algebraic set…

200 papers

For the truncated multidimensional moment problem we introduce a notion of a canonical solution. Namely, canonical solutions are those solutions which are generated by commuting self-adjoint extensions inside the associated Hilbert space.…

Classical Analysis and ODEs · Mathematics 2024-07-01 Sergey M. Zagorodnyuk

To any fixed, finite relational structure, $\mathbb{D}$, there is an associated decision problem, CSP$(\mathbb{D})$, which is a restricted version of the constraint satisfaction problem. In [8], the so called "algebraic approach" to the…

Logic · Mathematics 2016-09-14 Ian Payne

Given polynomials f(x), g_i(x), h_j(x), we study how to minimize f on the semialgebraic set S = { x \in R^n: h_1(x)=...=h_{m_1}(x) =0, g_1(x) >= 0, ..., g_{m_2}(x) >= 0}. Let f_{min} be the minimum of f on S. Suppose S is nonsingular and…

Optimization and Control · Mathematics 2010-06-15 Jiawang Nie

In this note we consider linear functionals on an unital commutative R-algebra. We give an integral representation of a nonnegative functional on an Archimedean cone where we do not assume that this cone is a semiring or a quadratic module.…

Functional Analysis · Mathematics 2026-05-18 Dragu Atanasiu

By a result of Horv\'ath the equation solvability problem over finite nilpotent groups and rings is in P. We generalize his result, showing that the equation solvability over every finite supernilpotent Mal'cev algebra is in P. We also give…

Rings and Algebras · Mathematics 2018-05-15 Michael Kompatscher

This is the latest in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. In the previous papers, we have proved that the sat CNF problem is polynomially reduced to the problem of finding a…

Computational Complexity · Computer Science 2023-11-01 Stepan G. Margaryan

We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…

Group Theory · Mathematics 2024-03-22 Derek Holt , Markus Lohrey , Saul Schleimer

A truncated moment sequence (tms) of degree d is a vector indexed by monomials whose degree is at most d. Let K be a semialgebraic set.The truncated K-moment problem (TKMP) is: when does a tms y admit a positive Borel measure supported?…

Functional Analysis · Mathematics 2012-09-07 J. William Helton , Jiawang Nie

Let P be a non-linear polynomial, K_P the filled Julia set of P, f a renormalization of P and K_f the filled Julia set of f. We show, loosely speaking, that there is a finite-to-one function \lambda from the set of P-external rays having…

Dynamical Systems · Mathematics 2021-02-23 Genadi Levin

We give a polynomial-time approximation algorithm for the (not necessarily metric) $k$-Median problem. The algorithm is an $\alpha$-size-approximation algorithm for $\alpha < 1 + 2 \ln(n/k)$. That is, it guarantees a solution having size at…

Data Structures and Algorithms · Computer Science 2025-11-18 Neal E. Young

This paper studies Positivstellens\"atze and moment problems for sets $K$ that are given by universal quantifiers. Let $Q$ be a closed set and let $g = (g_1,...,g_s)$ be a tuple of polynomials in two vector variables $x$ and $y$. Then $K$…

Optimization and Control · Mathematics 2024-12-04 Xiaomeng Hu , Igor Klep , Jiawang Nie

The paper treats several aspects of the truncated matricial $[\alpha,\beta]$-Hausdorff type moment problems. It is shown that each $[\alpha,\beta]$-Hausdorff moment sequence has a particular intrinsic structure. More precisely, each element…

Complex Variables · Mathematics 2017-01-26 Bernd Fritzsche , Bernd Kirstein , Conrad Mädler

The satisfiability problem in real closed fields is decidable. In the context of satisfiability modulo theories, the problem restricted to conjunctive sets of literals, that is, sets of polynomial constraints, is of particular importance.…

Logic in Computer Science · Computer Science 2015-11-05 Maximilian Jaroschek , Pablo Federico Dobal , Pascal Fontaine

This paper is a continuation of our previous investigations on the truncated matrix trigonometric moment problem in Ukrainian Math. J., 2011, \textbf{63}, no. 6, 786-797, and Ukrainian Math. J., 2013, \textbf{64}, no. 8, 1199-1214. In this…

Functional Analysis · Mathematics 2015-05-19 Sergey M. Zagorodnyuk

We establish new convergence rates for the Moment-Sum-of-Squares (Moment-SoS) relaxations for the Generalized Moment Problem (GMP) with countable moment constraints on vectors of measures, under dual optimum attainment, $S$-fullness and…

Optimization and Control · Mathematics 2025-09-03 Lucas Gamertsfelder , Bernard Mourrain

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

Discrete Mathematics · Computer Science 2023-09-12 Ruiwen Dong

Consider the problem of minimizing a lower semi-continuous semi-algebraic function $f \colon \mathbb{R}^n \to \mathbb{R} \cup \{+\infty\}$ on an unbounded closed semi-algebraic set $S \subset \mathbb{R}^n.$ Employing adequate tools of…

Optimization and Control · Mathematics 2023-08-11 Jae Hyoung Lee , Gue Myung Lee , Tien Son Pham

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…

Algebraic Topology · Mathematics 2018-02-15 Saugata Basu , Cordian Riener

We introduce a new strategy in solving the truncated complex moment problem. To this aim we investigate recursive doubly indexed sequences and their characteristic polynomials. A characterization of recursive doubly indexed \emph{moment}…

Functional Analysis · Mathematics 2016-10-14 Kaissar Idrissi , El Hassan Zerouali

We discuss a universal algebraic approach to quasi-exactly solvable models which allows us to interpret them as constrained Hamiltonian systems with a finite number of physical states. Using this approach we reproduce well-known…

Mathematical Physics · Physics 2009-12-18 Sergey Klishevich
‹ Prev 1 3 4 5 6 7 10 Next ›