Related papers: The truncated tracial moment problem
We show that the equivalence of deterministic linear top-down tree-to-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not necessarily order-preserving and can be used to express XML and…
The aim of this paper is to introduce truncated degenerate Bell polynomials and numbers and to investigate some of their properties. In more detail, we obtain explicit expressions, identities involving other special polynomials, integral…
In the wild, we often encounter collections of sequential data such as electrocardiograms, motion capture, genomes, and natural language, and sequences may be multichannel or symbolic with nonlinear dynamics. We introduce a new method to…
The detailed behaviour of a system is often represented as a labelled transition system (LTS) and the abstract behaviour as a stuttering-insensitive semantic congruence. Numerous congruences have been presented in the literature. On the…
In this paper we study truncated moment problems for $J$-self-adjoint, $J$-skew-self-adjoint and $J$-unitary operators. Conditions of the solvability are given. Some canonical solutions of the moment problems are constructed. As a…
Clocked Type Theory (CloTT) is a type theory for guarded recursion useful for programming with coinductive types, allowing productivity to be encoded in types, and for reasoning about advanced programming language features using an abstract…
We study Helson matrices (also known as multiplicative Hankel matrices), i.e. infinite matrices of the form $M(\alpha) = \{\alpha(nm)\}_{n,m=1}^\infty$, where $\alpha$ is a sequence of complex numbers. Helson matrices are considered as…
Trapezoidal words are words having at most $n+1$ distinct factors of length $n$ for every $n\ge 0$. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their…
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…
Nearly linear recurrences are a generalisation of linear recurrences and are instances of linear time-invariant systems in control theory and linear constraint loops in program analysis. In this paper we formulate the Positivity Problem for…
This paper is the continuation of \cite{htl}, where we deal with Lucas sequences. Here we study integers represented by integer sequences which satisfy binary recursive relations. In case of non-degenerate sequences we give bounds for the…
In this paper we investigate the existence and uniqueness of bounded, periodic and almost periodic solutions for second order differential equations involving reflection of the argument.The relationship between frequency modules of forced…
In this note, we show that if a multidimensional sequence generates Hankel tensors and all the Hankel matrices, generated by this sequence, are positive semi-definite, then this sequence is a multidimensional moment sequence.
Motivated by recent results in random matrix theory we will study the distributions arising from products of complex Gaussian random matrices and truncations of Haar distributed unitary matrices. We introduce an appropriately general class…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
The classical Truncated Moment problem asks for necessary and sufficient conditions so that a linear functional $L$ on $\mathcal{P}_{d}$, the vector space of real $n$-variable polynomials of degree at most $d$, can be written as integration…
The time-ordered exponential of a time-dependent matrix $\mathsf{A}(t)$ is defined as the function of $\mathsf{A}(t)$ that solves the first-order system of coupled linear differential equations with non-constant coefficients encoded in…
In studying the enumerative theory of super characters' of the group of upper triangular matrices over a finite field we found that the moments (mean, variance and higher moments) of novel statistics on set partitions have simple closed…
This paper is devoted to the study of the log-convexity of combinatorial sequences. We show that the log-convexity is preserved under componentwise sum, under binomial convolution, and by the linear transformations given by the matrices of…
A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…