Related papers: The truncated tracial moment problem
For a sample of Exponentially distributed durations we aim at point estimation and a confidence interval for its parameter. A duration is only observed if it has ended within a certain time interval, determined by a Uniform distribution.…
We give the trace representation of a family of binary sequences derived from Euler quotients by determining the corresponding defining polynomials. Trace representation can help us producing the sequences efficiently and analyzing their…
By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…
We present the notion of temporal Lorentzian spectral triple which is an extension of the notion of pseudo-Riemannian spectral triple with a way to ensure that the signature of the metric is Lorentzian. A temporal Lorentzian spectral triple…
A Riemannian gradient descent algorithm and a truncated variant are presented to solve systems of phaseless equations $|Ax|^2=y$. The algorithms are developed by exploiting the inherent low rank structure of the problem based on the…
Variable Length Memory Chains (VLMC), which are generalizations of finite order Markov chains, turn out to be an essential tool to modelize random sequences in many domains, as well as an interesting object in contemporary probability…
This work investigates the algorithmic complexity of non-classical logics, focusing on superintuitionistic and modal systems. It is shown that propositional logics are usually polynomial-time reducible to their fragments with at most two…
Let $T$ be an $n\times n$ truncation of an $(n+\alpha)\times (n+\alpha)$ Haar distributed unitary matrix. We consider the disk counting statistics of the eigenvalues of $T$. We prove that as $n\to + \infty$ with $\alpha$ fixed, the…
The bispectral problem is motivated by an effort to understand and extend a remarkable phenomenon in Fourier analysis on the real line: the operator of time-and-band limiting is an integral operator admitting a second-order differential…
The paper gives a parametrization of the solution set of a matricial Stieltjes-type truncated power moment problem in the non-degenerate and degenerate cases. The key role plays the solution of the corresponding system of Potapov's…
Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. Several recent applications need to represent highly…
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…
Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…
We describe various computational models based initially, but not exclusively, on that of the Turing machine, that are generalized to allow for transfinitely many computational steps. Variants of such machines are considered that have…
In this paper we introduce {\em weak ascent sequences}, a class of number sequences that properly contains ascent sequences. We show how these sequences uniquely encode each of the following objects: permutations avoiding a particular…
A partial Hadamard matrix $H\in M_{M\times N}(\mathbb C)$ is called of "classical type" if the associated quantum semigroup $G\subset\widetilde{S}_M^+$ is classical. In combinatorial terms, if $H_1,\ldots,H_M\in\mathbb T^N$ are the rows of…
We develop a framework to track the structure of temporal networks with a signal processing approach. The method is based on the duality between networks and signals using a multidimensional scaling technique. This enables a study of the…
Computing $\log\det(A)$ for large symmetric positive definite matrices arises in Gaussian process inference and Bayesian model comparison. Standard methods combine matrix-vector products with polynomial approximations. We study a different…
Invariance times are stopping times $\tau$ such that local martingales with respect to some reduced filtration and an equivalently changed probability measure, stopped before $\tau$ , are local martingales with respect to the original model…
Considering the use of dynamical systems in practical applications, often only limited regions in the time or frequency domain are of interest. Therefor, it usually pays off to compute local approximations of the used dynamical systems in…