Related papers: The signed enhanced principal rank characteristic …

Repeat consumption, such as repurchasing items and relistening songs, is a common scenario in daily life. To model repeat consumption, the repeat-aware recommendation has been proposed to predict which item will be re-interacted based on…

Regular sequences generalize the extensively studied automatic sequences. Let $S$ be an abstract numeration system. When the numeration language $L$ is prefix-closed and regular, a sequence is said to be $S$-regular if the module generated…

Let $\mathcal{S}$ be a commutative semigroup, and let $T$ be a sequence of terms from the semigroup $\mathcal{S}$. We call $T$ an (additively) {\sl irreducible} sequence provided that no sum of its some terms vanishes. Given any element $a$…

Sequential tests and their implied confidence sequences, which are valid at arbitrary stopping times, promise flexible statistical inference and on-the-fly decision making. However, strong guarantees are limited to parametric sequential…

We establish Hadamard-type inequalities for a class of symmetric matrices called $k$-positive matrices for which the $m$-th elementary symmetric functions of their eigenvalues are positive for all $m\leq k$. These matrices arise naturally…

A set $A$ of positive integers is said to be Schreier if either $A = \emptyset$ or $\min A\ge |A|$. We give a bijective map to prove the recurrence of the sequence $(|\mathcal{K}_{n, p, q}|)_{n=1}^\infty$ (for fixed $p\ge 1$ and $q\ge 2$),…

The partial sums of a sequence ${\mathbf x} = x_1, x_2, \ldots, x_k$ of distinct non-identity elements of a group $(G,\cdot)$ are $s_0 = id_G$ and $s_j = \prod_{i=1}^j x_i$ for $0 < j \leq k$. If the partial sums are all different then…

We study the factor complexity and closure properties of automatic sequences based on Parry or Bertrand numeration systems. These automatic sequences can be viewed as generalizations of the more typical $k$-automatic sequences and…

We introduce and study a generalized Parikh matrix mapping based on tracking the occurrence counts of special types of subsequences. These matrices retain more information about a word than the original Parikh matrix mapping while…

A finite word is closed if it contains a factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We are interested in the {\it oc-sequence} of a word, which is the binary sequence…

We study the properties of the third order sequence $(w_n)=\left(w_n(a,b,c; r, s,t)\right)$ defined by the recurrence relation $w_n = rw_{n - 1} + sw_{n - 2} + tw_{n - 3}\, (n \ge 3)$ with $w_0 = a,\,w_1 = b,\,w_2=c$, where $a$, $b$, $c$,…

Let g be a complex finite-dimensional simple Lie algebra. Given a positive integer k and a dominant weight \lambda, we define a preorder on the set $P(\lambda, k)$ of k-tuples of dominant weights which add up to \lambda. Let $P(\lambda,…

Let $A, B$ be positive definite matrices, $p=1, 2$ and $r\ge 0$. It is shown that \begin{equation*} ||A+ B + r(A\sharp_t B+A\sharp_{1-t} B)||_p \le ||A+ B + r(A^{t}B^{1-t} + A^{1-t}B^t)||_p. \end{equation*} We also prove that for positive…

This paper is a follow-up to the paper [Matrix periods and competition periods of Boolean Toeplitz matrices, {\it Linear Algebra Appl.} 672:228--250, (2023)]. Given subsets $S$ and $T$ of $\{1,\ldots,n-1\}$, an $n\times n$ Toeplitz matrix…

Let $G$ be a finite cyclic group of order $n \ge 2$. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot ... \cdot (n_lg)$ where $g\in G$ and $n_1,..., n_l \in [1,\ord(g)]$, and the index $\ind (S)$ of $S$ is defined as…

We prove an identity on Hermitian random matrix models with external source relating the high rank cases to the rank 1 cases. This identity was proved and used in a previous paper of ours to study the asymptotics of the top eigenvalues. In…

A sequence $(a_1, \ldots, a_n)$ of nonnegative integers is an {\em ascent sequence} if $a_0 =0$ and for all $i \geq 2$, $a_i$ is at most 1 plus the number of ascents in $(a_1, \ldots, a_{i-1})$. Ascent sequences were introduced by…

A one-parameter family of hermiticity-preserving superoperators is a time-dependent family $\{\Phi_{t}\colon\mathbb{M}_{n}(\mathbb{C})\rightarrow\mathbb{M}_{n}(\mathbb{C})\}_{t\in\mathbb{R}}$ of hermiticity-preserving superoperators…

Let $B$ be some invertible Hermitian or skew-Hermitian matrix. A matrix $A$ is called $B$-normal if $AA^\star = A^\star A$ holds for $A$ and its adjoint matrix $A^\star := B^{-1}A^HB$. In addition, a matrix $Q$ is called $B$-unitary, if…

A sign pattern is a matrix whose entries are from the set $\{+,-, 0\}$. A square sign pattern $A$ is called sign $k$-potent if $k$ is the smallest positive integer for which $A^{k+1}=A$, and for $k=1$, $A$ is called sign idempotent. In…