English
Related papers

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

200 papers

Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which…

Data Structures and Algorithms · Computer Science 2010-02-03 Andreas Björklund

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

Computational Complexity · Computer Science 2020-10-23 Paweł Idziak , Piotr Kawałek , Jacek Krzaczkowski , Armin Weiß

We study the problem of deciding whether a point escapes a closed subset of $\mathbb{R}^d$ under the iteration of a continuous map $f \colon \mathbb{R}^d \to \mathbb{R}^d$ in the bit-model of real computation. We give a sound partial…

Logic in Computer Science · Computer Science 2025-06-27 Eike Neumann

A family of maximally superintegrable systems containing the Coulomb atom as a special case is constructed in N-dimensional Euclidean space. Two different sets of N commuting second order operators are found, overlapping in the Hamiltonian…

Mathematical Physics · Physics 2009-11-07 Miguel A. Rodriguez , Pavel Winternitz

We consider the problem of computing the Lebesgue volume of compact basic semi-algebraic sets. In full generality, it can be approximated as closely as desired by a converging hierarchy of upper bounds obtained by applying the Moment-SOS…

Optimization and Control · Mathematics 2022-07-05 Matteo Tacchi , Jean B Lasserre , Didier Henrion

We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem…

Computational Complexity · Computer Science 2013-01-07 Adam Klivans , Raghu Meka

Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…

Computational Geometry · Computer Science 2025-04-24 Jean Cardinal , Xavier Goaoc , Sarah Wajsbrot

The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…

Computational Geometry · Computer Science 2024-08-07 Mikkel Abrahamsen , Tillmann Miltzow , Nadja Seiferth

The problem of when a given digraph contains a subdivision of a fixed digraph $F$ is considered. Bang-Jensen et al. laid out foundations for approaching this problem from the algorithmic point of view. In this paper we give further support…

Combinatorics · Mathematics 2017-08-08 Frédéric Havet , A. Karolinna Maia , Bojan Mohar

Given a proper cone $K \subseteq \mathbb{R}^n$, a multivariate polynomial $f \in \mathbb{C}[z] = \mathbb{C}[z_1, \ldots, z_n]$ is called $K$-stable if it does not have a root whose vector of the imaginary parts is contained in the interior…

Algebraic Geometry · Mathematics 2020-08-31 Papri Dey , Stephan Gardoll , Thorsten Theobald

We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…

Logic in Computer Science · Computer Science 2021-12-02 Libor Barto , William DeMeo , Antoine Mottet

In this paper, we consider linear functionals defined on an unital commutative real algebra A and establish characterizations for moment functionals on compact sets of characters that depend only on the given functional. For example, we…

Functional Analysis · Mathematics 2025-12-09 Dragu Atanasiu

In a paper from 2016 D. R. Yafaev considers Hankel operators associated with Hamburger moment sequences q_n and claims that the corresponding Hankel form is closable if and only if the moment sequence tends to 0. The claim is not correct,…

Functional Analysis · Mathematics 2019-06-05 Christian Berg , Ryszard Szwarc

The matrix Fej\'er-Riesz theorem characterizes positive semidefinite matrix polynomials on the real line. In the previous work of the second-named author this was extended to the characterization on arbitrary closed semialgebraic sets $K$…

Functional Analysis · Mathematics 2026-01-07 Shengding Sun , Aljaž Zalar

For any truncated path algebra $\Lambda$ of a quiver, we classify, by way of representation-theoretic invariants, the irreducible components of the parametrizing varieties $\mathbf{Rep}_{\mathbf{d}}(\Lambda)$ of the $\Lambda$-modules with…

Representation Theory · Mathematics 2019-12-20 K. R. Goodearl , B. Huisgen-Zimmermann

Consider an $L^1$-continuous functional $\ell$ on the vector space of polynomials of Brownian motion at given times, suppose $\ell $ commutes with the quadratic variation in a natural sense, and consider a finite set of polynomials of…

Probability · Mathematics 2007-05-23 Frederik S Herzberg

We study the problem of \emph{robust satisfiability} of systems of nonlinear equations, namely, whether for a given continuous function $f:\,K\to\mathbb{R}^n$ on a~finite simplicial complex $K$ and $\alpha>0$, it holds that each function…

Computational Complexity · Computer Science 2014-02-05 Peter Franek , Marek Krcal

We use integrals of left coideal subalgebras to develop Harmonic analysis for semisimple Hopf algebras. We show how $N^*,$ the space of functional on $N,$ is embedded in $H^*.$ We define a bilinear form on $N^*$ and show that irreducible…

Quantum Algebra · Mathematics 2016-04-27 M. Cohen , S. Westreich

In this paper we consider two related objects: singular positive semidefinite Hankel block--matrices and associated degenerate truncated matrix Hamburger moment problems. The description of all solutions of a degenerate matrix Hamburger…

Classical Analysis and ODEs · Mathematics 2008-12-25 Vladimir Bolotnikov

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer