相关论文: A graph-theoretic remark on Stieltjes moment seque…

Let $A(G)$ be the adjacency matrix of a graph $G$ with $\lambda_{1}(G)$, $\lambda_{2}(G)$, ..., $\lambda_{n}(G)$ being its eigenvalues in non-increasing order. Call the number $S_k(G):=\sum_{i=1}^{n}\lambda_{i}^k(G) (k=0,1,...,n-1)$ the…

The Stieltjes classes play a significant role in the moment problem since they permit to expose an infinite family of probability distributions all having equal moments of all orders. Given a moment-indeterminate distribution, it may not be…

Let $n$ be a positive integer. For each $0\leq j \leq n-1$ we let $C_n^j$ denote the Cayley graph of the cyclic group $\mathbb{Z}_n$ with respect to the subset $\{1,j\}$. Utilizing the Smith Normal Form process, we give an explicit…

This paper aims at finding conditions on a Hamburger or Stieltjes moment sequence, under which the change of at most a finite number of its entries produces another sequence of the same type. It turns out that a moment sequence allows all…

We revisit an unpublished paper of Vervoort (2002) on the once reinforced random walk, and prove that this process is recurrent on any graph of the form $\mathbb{Z}\times \Gamma$, with $\Gamma$ a finite graph, for sufficiently large…

We prove formulas for power moments for point counts of elliptic curves over a finite field $k$ such that the groups of $k$-points of the curves contain a chosen subgroup. These formulas express the moments in terms of traces of Hecke…

Stieltjes moment sequences $\{a_n\}_{n=0}^\infty$ whose $\varkappa\,$th roots $\{\sqrtk{a_n}\}_{n=0}^\infty$ are Stieltjes moment sequences are studied ($\varkappa$ is a fixed integer greater than or equal to 2). A formula connecting the…

We consider a normalized indeterminate Hamburger moment sequence s which is supposed to be Stieltjes. We revisit old results about determinacy/indeterminacy in the sense of Stieltjes for s and we prove some new results about the concepts…

Suppose that $[n]=\left\{0,1,2,...,n\right\}$ is a set of non-negative integers and $h,k \in [n]$. The $L(h,k)$-labeling of graph $G$ is the function $l:V(G)\rightarrow[n]$ such that $\left|l(u)-l(v)\right|\geq h$ if the distance $d(u,v)$…

Let $G_S$ be a graph with loops attached at each vertex in $S \subseteq V(G).$ In this article, we develop exact formulae for the number of closed $3$- and $4$-walks on $G_S$ in terms of vertex degrees and certain elementary subgraphs of…

In this note we observe that a bijection related to Littelmann's root operators (for type $A_1$) transparently explains the well known enumeration by length of walks on $\N$ (left factors of Dyck paths), as well as some other enumerative…

We investigate conditions in order to decide whether a given sequence of real numbers represents expected record values arising from an independent, identically distributed, sequence of random variables. The main result provides a necessary…

In this work, we extend the concept of the Stieltjes derivative to encompass left-continuous derivators with bounded variation, thereby relaxing the monotonicity constraint. This generalization necessitates a refined definition of the…

Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one…

We study continuous-time open quantum walks in one dimension through a matrix representation, focusing on nearest-neighbor transitions for which an associated weight matrix exists. Statistics such as site recurrence are studied in terms of…

Let $G$ be a graph with vertex set $V=\{v_{1},\dots,v_{n}\}$ and adjacency matrix $A.$ For a subset $S$ of $V$ let $\e=(x_{1},\,\dots,\,x_{n})^{\tt T}$ be the characteristic vector of $S,$ that is, $x_{\ell}=1$ if $v_{\ell}\in S$ and…

We classify all functions which, when applied term by term, leave invariant the sequences of moments of positive measures on the real line. Rather unexpectedly, these functions are built of absolutely monotonic components, or reflections of…

We prove joint functional limit theorems in the Skorokhod space equipped with the $J_1$-topology for successive Lebesgue-Stieltjes convolutions of nondecreasing stochastic processes with themselves. These convolutions arise naturally in…

Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$…

A class of Stieltjes functions of finite type is introduced. These satisfy Widder's conditions on the successive derivatives up to some finite order, and are not necessarily smooth. We show that such functions have a unique integral…