English
Related papers

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

200 papers

We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n,k \in \N$ such that $k\, | \sum_{i=1}^ni$ and a partition $p_1+\cdots+p_k=n$, when is it possible to find a partition of the set…

Combinatorics · Mathematics 2026-05-08 Shlomo Hoory , Dani Kotlar

The fibre theorem \cite{schm2003} for the moment problem on closed semi-algebraic subsets of $\R^d$ is generalized to finitely generated real unital algebras. A charaterization of moment functionals on the polynomial algebra…

Functional Analysis · Mathematics 2014-06-03 Konrad Schmüdgen

In this article we provide an experimental algorithm that in many cases gives us an upper bound of the global infimum of a real polynomial on $\R^{n}$. It is very well known that to find the global infimum of a real polynomial on $\R^{n}$,…

Optimization and Control · Mathematics 2018-09-25 María López Quijorna

We examine possibility to design an efficient solving algorithm for problems of the class \np. It is introduced a classification of \np problems by the property that a partial solution of size $k$ can be extended into a partial solution of…

Data Structures and Algorithms · Computer Science 2007-05-23 Anatoly D. Plotnikov

We provide conditions ensuring that the KKT-type conditions characterizes the global optimality for quadratically constrained (possibly nonconvex) quadratic programming QCQP problems in Hilbert spaces. The key property is the convexity of a…

Optimization and Control · Mathematics 2023-02-15 Ewa M. Bednarczuk , Giovanni Bruccola

Suppose that $\sA$ is a finitely generated commutative unital real algebra and $K$ is a closed subset of the set $\hat{A}$ of characters of $\sA$. We study the following problem: When is {\it each} linear functional $L:{\sA} \to \dR$ an…

Functional Analysis · Mathematics 2024-05-16 Konrad Schmüdgen

In recent years, the so-called polynomial moment problem, motivated by the classical Poincare center-focus problem, was thoroughly studied, and the answers to the main questions have been found. The study of a similar problem for rational…

Complex Variables · Mathematics 2009-10-15 F. Pakovich , C. Pech , A. Zvonkin

We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…

Logic in Computer Science · Computer Science 2015-07-01 Benoit Larose , Cynthia Loten , Claude Tardif

The normaliser problem has as input two subgroups $H$ and $K$ of the symmetric group $S_n$, and asks for a generating set for $N_K(H)$: it is not known to have a subexponential time solution. It is proved in [Roney-Dougal & Siccha, 2020]…

Group Theory · Mathematics 2021-12-02 Mun See Chang , Colva M. Roney-Dougal

The $k$-CombDMR problem is that of determining whether an $n \times n$ distance matrix can be realised by $n$ vertices in some undirected graph with $n + k$ vertices. This problem has a simple solution in the case $k=0$. In this paper we…

Data Structures and Algorithms · Computer Science 2024-06-24 David L. Fairbairn , George B. Mertzios , Norbert Peyerimhoff

Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…

Symbolic Computation · Computer Science 2007-05-23 Dima Grigoriev , Dmitrii V. Pasechnik

Let $C$ be an arithmetic circuit of $poly(n)$ size given as input that computes a polynomial $f\in\mathbb{F}[X]$, where $X=\{x_1,x_2,\ldots,x_n\}$ and $\mathbb{F}$ is any field where the field arithmetic can be performed efficiently. We…

Data Structures and Algorithms · Computer Science 2020-06-03 V. Arvind , Abhranil Chatterjee , Rajit Datta , Partha Mukhopadhyay

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

Discrete Mathematics · Computer Science 2017-01-18 Joël Ouaknine , Amaury Pouly , João Sousa-Pinto , James Worrell

We present a polynomial-time quantum algorithm for the Hidden Subgroup Problem over $\mathbb{D}_{2^n}$. The usual approach to the Hidden Subgroup Problem relies on harmonic analysis in the domain of the problem, and the best known algorithm…

Quantum Physics · Physics 2022-02-24 Matthew Moore , Grace Young

We design a new algorithm for solving parametric systems having finitely many complex solutions for generic values of the parameters. More precisely, let $f = (f_1, \ldots, f_m)\subset \mathbb{Q}[y][x]$ with $y = (y_1, \ldots, y_t)$ and $x…

Symbolic Computation · Computer Science 2021-12-22 Huu Phuoc Le , Mohab Safey El Din

In this paper we study the linear functional $S$ on complex polynomials which is associated to a bounded complex Jacobi matrix $J$. The associated moment problem is considered: find a positive Borel measure $\mu$ on $\mathbb{C}$ subject to…

Classical Analysis and ODEs · Mathematics 2023-02-24 Sergey M. Zagorodnyuk

We prove that if a connected and simply connected Lie group $G$ admits connected closed normal subgroups $G_1\subseteq G_2\subseteq \cdots \subseteq G_m=G$ with $\dim G_j=j$ for $j=1,\dots,m$, then its group $C^*$-algebra has closed…

Operator Algebras · Mathematics 2025-04-15 Ingrid Beltita , Daniel Beltita

Let K be an algebraically closed field of characteristic zero, endowed with a complete nonarchimedean norm. Let X be a K-rigid analytic variety and \Sigma a semianalytic subset of X. Then the closure of \Sigma in X with respect to the…

Differential Geometry · Mathematics 2016-09-07 Hans Schoutens

We find necessary and sufficient conditions for the existence of a probability measure on $\mathbb{N}_0$, the nonnegative integers, whose first $n$ moments are a given $n$-tuple of nonnegative real numbers. The results, based on finding an…

Probability · Mathematics 2021-08-16 M. Infusino , T. Kuna , J. L. Lebowitz , E. R. Speer

Let $\K=\C$, or $\R$, and $S_f$ be the set of points in $\K^n$ at which a polynomial map $f:\K^n\rightarrow\K^n$ is non-proper. Jelonek proved that $S_f$ is a semi-algebraic set that is ruled by polynomial curves, with $\dim S_f\leq n-1$,…

Algebraic Geometry · Mathematics 2019-09-17 Boulos El Hilany