English
Related papers

Related papers: A new approach to the 2-variable subnormal complet…

200 papers

The (classical) truncated moment problem, extensively studied by Curto and Fialkow, asks to characterize when a finite sequence of real numbers indexes by words in commuting variables can be represented with moments of a positive Borel…

Functional Analysis · Mathematics 2018-06-06 Abhishek Bhardwaj , Aljaž Zalar

Machine learning (ML) approaches are increasingly being used to accelerate combinatorial optimization (CO) problems. We investigate the Set Cover Problem (SCP) and propose Graph-SCP, a graph neural network method that augments existing…

Machine Learning · Computer Science 2025-10-10 Zohair Shafi , Benjamin A. Miller , Tina Eliassi-Rad , Rajmonda S. Caceres

Models of spontaneous CP violation can solve the Strong CP problem without the need of an anomalous Peccei-Quinn symmetry. In this work we review the Nelson-Barr approach, quantifying a peculiar coincidence between unrelated mass scales…

High Energy Physics - Phenomenology · Physics 2022-05-10 Alessandro Valenti

The truncated moment problem consists of determining whether a given finitedimensional vector of real numbers y is obtained by integrating a basis of the vector space of polynomials of bounded degree with respect to a non-negative measure…

Algebraic Geometry · Mathematics 2023-02-15 Didier Henrion , Simone Naldi , Mohab Safey El Din

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

The main result of the paper gives criteria for extendibility of sesquilinear form-valued mappings defined on symmetric subsets of *-semigroups to positive definite ones. By specifying this we obtain new solutions of: * the truncated…

Functional Analysis · Mathematics 2009-07-01 D. Cichoń , J. Stochel , F. H. Szafraniec

The Set Cover problem (SCP) and Set Packing problem (SPP) are standard NP-hard combinatorial optimization problems. Their decision problem versions are shown to be NP-Complete in Karp's 1972 paper. We specify a rough guide to constructing…

Data Structures and Algorithms · Computer Science 2013-05-16 David Kordalewski

We study the class of hyponormal 2-variable weighted shifts with two consecutive equal weights in the weight sequence of one of the coordinate operators. We show that under natural assumptions on the coordinate operators, the presence of…

Functional Analysis · Mathematics 2007-05-23 Raul E. Curto , Jasang Yoon

We characterize the existence of the Lebesgue integrable solutions of the truncated problem of moments in several variables on unbounded supports by the existence of some maximum entropy -- type representing densities and discuss a few…

Functional Analysis · Mathematics 2013-01-01 Calin-Grigore Ambrozie

The deconfined quantum critical point (DQCP) was originally proposed as a continuous transition between two spontaneous symmetry breaking phases in 2D spin-1/2 systems. While great efforts have been spent on the DQCP for 2D systems, both…

Strongly Correlated Electrons · Physics 2019-09-23 Rui-Zhen Huang , Da-Chuan Lu , Yi-Zhuang You , Zi Yang Meng , Tao Xiang

We develop a polynomial time $\Omega\left ( \frac 1R \log R \right)$ approximate algorithm for Max 2CSP-$R$, the problem where we are given a collection of constraints, each involving two variables, where each variable ranges over a set of…

Data Structures and Algorithms · Computer Science 2015-04-07 Guy Kindler , Alexandra Kolla , Luca Trevisan

We characterize the existence of the $L^1$ solutions of the truncated moments problem in several real variables on unbounded supports by the existence of the maximum of certain concave Lagrangian functions. A natural regularity assumption…

Functional Analysis · Mathematics 2012-09-04 Calin-Grigore Ambrozie

Constraint satisfaction problems have been studied in numerous fields with practical and theoretical interests. In recent years, major breakthroughs have been made in a study of counting constraint satisfaction problems (or #CSPs). In…

Computational Complexity · Computer Science 2012-10-23 Tomoyuki Yamakami

We consider the problem of finding a (non-negative) measure $\mu$ on $\mathfrak{B}(\mathbb{C}^n)$ such that $\int_{\mathbb{C}^n} \mathbf{z}^{\mathbf{k}} d\mu(\mathbf{z}) = s_{\mathbf{k}}$, $\forall \mathbf{k}\in\mathcal{K}$. Here…

Functional Analysis · Mathematics 2021-02-12 Sergey M. Zagorodnyuk

We propose and mathematically analyze a new Shifted Boundary Method for the treatment of Dirichlet and Neumann boundary conditions, with provable optimal accuracy in the $L^2$- and $H^1$-norms of the error. The proposed method is built on…

Numerical Analysis · Mathematics 2025-08-14 J. Haydel Collins , Kangan Li , Alexei Lozinski , Guglielmo Scovazzi

We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability…

Discrete Mathematics · Computer Science 2012-02-06 Harold Connamacher , Michael Molloy

We examine the possibility of building a natural non-supersymmetric model of spontaneous CP violation equipped with the Nelson-Barr (NB) mechanism to address the strong CP problem. Our approach is to utilize a doubly composite dynamics…

High Energy Physics - Phenomenology · Physics 2022-12-28 Sudhakantha Girmohanta , Seung J. Lee , Yuichiro Nakai , Motoo Suzuki

Moment evaluations are important for the study of non-classical orthogonal polynomial systems for which explicit representations are not known. In this paper we compute, in terms of the hypergeometric function, the moments associated with a…

Classical Analysis and ODEs · Mathematics 2019-01-15 Hashem AlSabi , James Griffin

In the study of the geometrically regular weighted shifts (GRWS) -- see [5] -- signed power representing measures (which we call Berger-type charges) played an important role. Motivated by their utility in that context, we establish a…

Functional Analysis · Mathematics 2026-05-12 Chafiq Benhida , Raúl E. Curto , George R. Exner

We study constraint satisfaction problems (CSPs) in the presence of counting quantifiers $\exists^{\geq j}$, asserting the existence of $j$ distinct witnesses for the variable in question. As a continuation of our previous (CSR 2012) paper,…

Logic in Computer Science · Computer Science 2013-12-31 Barnaby Martin , Juraj Stacho