scholarly journals The multidimensional truncated moment problem: Carathéodory numbers from Hilbert functions

Author(s):  
Philipp J. di Dio ◽  
Mario Kummer

AbstractIn this paper we improve the bounds for the Carathéodory 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$$ R n , and $$[0,1]^n$$ [ 0 , 1 ] n . We also treat moment problems with small gaps. We find that for every $$\varepsilon >0$$ ε > 0 and $$d\in \mathbb {N}$$ d ∈ N there is a $$n\in \mathbb {N}$$ n ∈ N such that we can construct a moment functional $$L:\mathbb {R}[x_1,\cdots ,x_n]_{\le d}\rightarrow \mathbb {R}$$ L : R [ x 1 , ⋯ , x n ] ≤ d → R which needs at least $$(1-\varepsilon )\cdot \left( {\begin{matrix} n+d\\ n\end{matrix}}\right) $$ ( 1 - ε ) · n + d n atoms $$l_{x_i}$$ l x i . Consequences and results for the Hankel matrix and flat extension are gained. We find that there are moment functionals $$L:\mathbb {R}[x_1,\cdots ,x_n]_{\le 2d}\rightarrow \mathbb {R}$$ L : R [ x 1 , ⋯ , x n ] ≤ 2 d → R which need to be extended to the worst case degree 4d, $$\tilde{L}:\mathbb {R}[x_1,\cdots ,x_n]_{\le 4d}\rightarrow \mathbb {R}$$ L ~ : R [ x 1 , ⋯ , x n ] ≤ 4 d → R , in order to have a flat extension.

2013 ◽  
Vol 2013 ◽  
pp. 1-17 ◽  
Author(s):  
Octav Olteanu

The present work deals with the existence of the solutions of some Markov moment problems. Necessary conditions, as well as necessary and sufficient conditions, are discussed. One recalls the background containing applications of extension results of linear operators with two constraints to the moment problem and approximation by polynomials on unbounded closed finite-dimensional subsets. Two domain spaces are considered: spaces of absolute integrable functions and spaces of analytic functions. Operator valued moment problems are solved in the latter case. In this paper, there is a section that contains new results, making the connection to some other topics: bang-bang principle, truncated moment problem, weak compactness, and convergence. Finally, a general independent statement with respect to polynomials is discussed.


1995 ◽  
Vol 2 (46) ◽  
Author(s):  
Dany Breslauer ◽  
Livio Colussi ◽  
Laura Toniolo

In this paper we study the exact comparison complexity of the string<br />prefix-matching problem in the deterministic sequential comparison model<br />with equality tests. We derive almost tight lower and upper bounds on<br />the number of symbol comparisons required in the worst case by on-line<br />prefix-matching algorithms for any fixed pattern and variable text. Unlike<br />previous results on the comparison complexity of string-matching and<br />prefix-matching algorithms, our bounds are almost tight for any particular pattern.<br />We also consider the special case where the pattern and the text are the<br />same string. This problem, which we call the string self-prefix problem, is<br />similar to the pattern preprocessing step of the Knuth-Morris-Pratt string-matching<br />algorithm that is used in several comparison efficient string-matching<br />and prefix-matching algorithms, including in our new algorithm.<br />We obtain roughly tight lower and upper bounds on the number of symbol<br />comparisons required in the worst case by on-line self-prefix algorithms.<br />Our algorithms can be implemented in linear time and space in the<br />standard uniform-cost random-access-machine model.


Axioms ◽  
2022 ◽  
Vol 11 (1) ◽  
pp. 20
Author(s):  
Sergey Zagorodnyuk

We consider the problem of finding a (non-negative) measure μ on B(Cn) such that ∫Cnzkdμ(z)=sk, ∀k∈K. Here, K is an arbitrary finite subset of Z+n, which contains (0,…,0), and sk are prescribed complex numbers (we use the usual notations for multi-indices). There are two possible interpretations of this problem. Firstly, one may consider this problem as an extension of the truncated multidimensional moment problem on Rn, where the support of the measure μ is allowed to lie in Cn. Secondly, the moment problem is a particular case of the truncated moment problem in Cn, with special truncations. We give simple conditions for the solvability of the above moment problem. As a corollary, we have an integral representation with a non-negative measure for linear functionals on some linear subspaces of polynomials.


2007 ◽  
Vol 100 (1) ◽  
pp. 161 ◽  
Author(s):  
Hiroyuki Osaka ◽  
Sergei Silvestrov ◽  
Jun Tomiyama

The article is devoted to investigation of the classes of functions belonging to the gaps between classes $P_{n+1}(I)$ and $P_{n}(I)$ of matrix monotone functions for full matrix algebras of successive dimensions. In this paper we address the problem of characterizing polynomials belonging to the gaps $P_{n}(I) \setminus P_{n+1}(I)$ for bounded intervals $I$. We show that solution of this problem is closely linked to solution of truncated moment problems, Hankel matrices and Hankel extensions. Namely, we show that using the solutions to truncated moment problems we can construct continuum many polynomials in the gaps. We also provide via several examples some first insights into the further problem of description of polynomials in the gaps that are not coming from the truncated moment problem. Also, in this article, we deepen further in another way into the structure of the classes of matrix monotone functions and of the gaps between them by considering the problem of position in the gaps of certain interesting subclasses of matrix monotone functions that appeared in connection to interpolation of spaces and in a proof of the Löwner theorem on integral representation of operator monotone functions.


1990 ◽  
Vol 19 (335) ◽  
Author(s):  
Peter Bro Miltersen

We analyze the concept of <em> malignness</em>, which is the property of probability ensembles of making the average case running time equal to the worst case running time for a class of algorithms. We derive lower and upper bounds on the complexity of malign ensembles, which are tight for exponential time algorithms, and which show that no polynomial time computable malign ensemble exists for the class of superlinear algorithms. Furthermore, we show that for no class of superlinear algorithms a polynomial time computable malign ensemble exists, unless every language in P has an expected polynomial time constructor.


1997 ◽  
Vol 84 (1) ◽  
pp. 176-178
Author(s):  
Frank O'Brien

The author's population density index ( PDI) model is extended to three-dimensional distributions. A derived formula is presented that allows for the calculation of the lower and upper bounds of density in three-dimensional space for any finite lattice.


Author(s):  
S. Yahya Mohamed ◽  
A. Mohamed Ali

In this paper, the notion of energy extended to spherical fuzzy graph. The adjacency matrix of a spherical fuzzy graph is defined and we compute the energy of a spherical fuzzy graph as the sum of absolute values of eigenvalues of the adjacency matrix of the spherical fuzzy graph. Also, the lower and upper bounds for the energy of spherical fuzzy graphs are obtained.


Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 940
Author(s):  
Zijing Wang ◽  
Mihai-Alin Badiu ◽  
Justin P. Coon

The age of information (AoI) has been widely used to quantify the information freshness in real-time status update systems. As the AoI is independent of the inherent property of the source data and the context, we introduce a mutual information-based value of information (VoI) framework for hidden Markov models. In this paper, we investigate the VoI and its relationship to the AoI for a noisy Ornstein–Uhlenbeck (OU) process. We explore the effects of correlation and noise on their relationship, and find logarithmic, exponential and linear dependencies between the two in three different regimes. This gives the formal justification for the selection of non-linear AoI functions previously reported in other works. Moreover, we study the statistical properties of the VoI in the example of a queue model, deriving its distribution functions and moments. The lower and upper bounds of the average VoI are also analysed, which can be used for the design and optimisation of freshness-aware networks. Numerical results are presented and further show that, compared with the traditional linear age and some basic non-linear age functions, the proposed VoI framework is more general and suitable for various contexts.


Sign in / Sign up

Export Citation Format

Share Document