Searcharxiv⌕ Search

arXiv subjects

Tian-Xiao He

Publications and source records attributed to Tian-Xiao He.

At least 19 recordsLinked to original sources

Exponential Double and Multiple Riordan Arrays as Fiber Products

A double Riordan array has nonzero entries only in positions $(n,k)$ with $n+k$ even, and its even and odd parts are Riordan arrays with the same multiplier function. We develop this observation systematically, with the emphasis on exponential double and exponential multiple Riordan arrays. Using generalized Riordan arrays with respect to a sequence $(c_n)$, we show that the double Riordan group, the exponential double Riordan group, the multiple Riordan group, and the exponential multiple Riordan group are fiber products of (generalized) Riordan groups over the Lagrange group. For exponential double and exponential multiple Riordan arrays this yields product and inverse formulas without square or $\ell$th roots, valid over any field of characteristic zero; an abelian normal subgroup with quotient the Lagrange group and a corresponding splitting; subgroups isomorphic to the Riordan group; an iterated split-extension description of the multiple groups; and a characterization of elements of finite order, including the fact that over ${\mathbb R}$ every element of finite order is an involution. We show that the $\ell$th power of the production matrix is the direct sum of the production matrices of the compressions, give an explicit formula for it in terms of partial Bell polynomials, and characterize these arrays by a shared $A$-sequence. Finally, we reverse the construction. Two Riordan arrays with a common multiplier can always be interleaved into a unique double Riordan array, and into an ordinary Riordan array exactly when their first functions satisfy one more condition. Examples include Pascal-, Catalan-, Morgan--Voyce-, and ballot-type arrays.

math.CO↗

Exponential Multiple Riordan Arrays

We extend exponential double Riordan arrays to exponential multiple Riordan arrays $[g;f_1,\ldots,f_\ell]$, whose columns are generated, in exponential form, by a function $g$ of $t^\ell$ and $\ell$ multipliers $f_1,\ldots,f_\ell$ used cyclically. We prove an $\ell$-case fundamental theorem, define the exponential multiple Riordan group, and determine its identity, inverses, and its Appell, associated, and $\ell$ Bell-type subgroups; the group is the semidirect product of its Appell and associated subgroups. We compute the production matrix in terms of $2\ell$ sequences, the $c_r$- and $r_r$-sequences ($0\leq r\leq \ell-1$), give its bivariate generating function in terms of generalized hyperbolic functions, and derive recurrence relations for the entries. Finally, we give two sequence characterizations: one by $\ell-1$ one-step $A$-sequences, an $\ell$-step $A$-sequence, and a $Z$-sequence, and one by a single $\ell$-step $A$-sequence and $\ell$ $Z$-sequences. For $\ell=2$ all results reduce to those for exponential double Riordan arrays.

math.CO↗

The Family $X_{qp^s}$ for Distinct Primes $q,p$ in Connection with Carmichael's Totient Conjecture

Shannon, Shiue, Saito and the author \cite{SSHS2025} studied the sets $X_k=\{n\in\mathbb{N}:φ(n)=k\}$ in connection with Carmichael's totient conjecture, and proved that for an odd prime $p\neq3$ and $s\in\{1,2,3,4\}$, $X_{2p^s}$ is empty whenever $2p^s+1$ is not prime (with $s=1$ fully characterized in both directions), conjecturing that this persists for every $s\ge1$. We resolve that conjecture in full, obtaining a complete characterization of $X_{2p^s}$ for every $s\ge1$ and every odd prime $p\neq3$, together with a parity dichotomy: $X_{2p^s}=\varnothing$ unconditionally whenever $s$ is even, while for odd $s$ both outcomes genuinely occur, determined exactly by the primality of $2p^s+1$. We then close the one remaining gap at $p=3$, where the proof technique degenerates, with a separate, unconditional characterization of $X_{2\cdot3^s}$. Building on these results, we consider the natural generalization $X_{qp^s}$, where $q\neq p$ are distinct primes and $s\ge1$. We show that this generalization splits into three cases of very different character. If $q$ and $p$ are both odd, the problem is trivial: $qp^s$ is odd, so $X_{qp^s}=\varnothing$ by elementary parity, with no case-analysis needed. If $q=2$, the problem is exactly the family $X_{2p^s}$ resolved above. If $p=2$, giving the ``mirror'' family $X_{2^sq}$ for an odd prime $q$, the problem is genuinely different. Beyond $s=1$, we give a complete resolution for $s=2$, recovering, with an explicit proof and solution sets, the qualitative dichotomy of \cite[Thm.~2.3.1]{SSHS2025}, but the problem remains open for $s\ge3$.

math.NT↗

Riordan array representation of recursive polynomial sequences, orthogonal polynomial sequences, and $d$-orthogonal polynomial sequences

We study when a polynomial sequence $\{p_n(x)\}$ satisfying a linear homogeneous recurrence with polynomial coefficients admits an ordinary Riordan array as its coefficient matrix. For second-order recurrences $p_{n+2}(x)=a(x)p_{n+1}(x)+b(x)p_n(x)$, we give a complete characterization. We extend this to a necessary condition and a full factorization criterion for recurrences of arbitrary order $\ell \geq 3$. We then develop a production-matrix framework for arbitrary orthogonal polynomial sequences (OPS), not restricted to the Riordan-array-type case: for any lower-triangular invertible coefficient matrix $A$ of an OPS, the production matrix $P_{A^{-1}}=ASA^{-1}$ is always the tridiagonal Jacobi matrix encoding the three-term recurrence, and the first column of $A^{-1}$ always gives the moment sequence -- even when, as for the Legendre polynomials, the recurrence coefficients are non-constant and no Riordan array representation of the coefficient matrix exists. We illustrate this with Legendre and Chebyshev polynomials as, respectively, non-Riordan-type and Riordan-type examples, and give an explicit closed-form coefficient matrix and its inverse for the generalized Gegenbauer--Humbert OPS. Finally, we extend the framework to $d$-orthogonal polynomial sequences, showing that the coefficient matrix of a $d$-orthogonal sequence is always invertible, that its associated production matrix is $(d+2)$-banded (lower Hessenberg) and encodes the corresponding $(d+2)$-term recurrence, and that the first $d$ columns of the inverse matrix recover the moment sequences of the defining vector functional -- identifying $d$-orthogonality with $(d+1)$-Hessenberg generalized Riordan arrays and extending the classical $d=1$ tridiagonal correspondence.

math.CO↗

Kantorovich--Kernel Neural Operators: Approximation Theory, Asymptotics, and Neural Network Interpretation

This paper studies a class of multivariate Kantorovich-kernel neural network operators, including the deep Kantorovich-type neural network operators studied by Sharma and Singh. We prove density results, establish quantitative convergence estimates, derive Voronovskaya-type theorems, analyze the limits of partial differential equations for deep composite operators, prove Korovkin-type theorems, and propose inversion theorems. This paper studies a class of multivariate Kantorovich-kernel neural network operators, including the deep Kantorovich-type neural network operators studied by Sharma and Singh. We prove density results, establish quantitative convergence estimates, derive Voronovskaya-type theorems, analyze the limits of partial differential equations for deep composite operators, prove Korovkin-type theorems, and propose inversion theorems. Furthermore, this paper discusses the connection between neural network architectures and the classical positive operators proposed by Chui, Hsu, He, Lorentz, and Korovkin.

stat.ML↗

The symmetric groups $S_n, n\geq 4$, and finite non-abelian simple groups are not embeddable in any Riordan group

We prove that the symmetric group of degree greater than three cannot be embedded into the Riordan group with coefficients in any commutative ring. We also prove the impossibility to embed finite non-abelian simple groups. As a closely related topic, we show why all truncated Riordan groups are solvable, in stark contrast to the unsolvability of the infinite-sized Riordan groups. Finally, we give an explicit embedding of the alternating group $A_4$ into the Lagrange subgroup with coefficients in a certain commutative ring, and prove that $A_4$ cannot be embedded into a substitution group.

math.GR↗

Sequence Characterization of Multiple Almost-Riordan Arrays and Their Compressions

This is the second paper of the paper series on multiple Riordan arrays. In this paper, based on the study of multiple Riordan arrays and the multiple Riordan group, we define multiple almost-Riordan arrays and find that the set of all multiple almost-Riordan arrays forms a group, called the multiple almost-Riordan group. We also obtain the sequence characteristics of multiple almost-Riordan arrays and give the production matrices for multiple almost-Riordan arrays. We define the compression of multiple almost-Riordan arrays and provide their sequence characterization.

math.CO↗

The Multiple Riordan Group and the Multiple Riordan Type Arrays

This is the first paper of a sequence papers on the multiple Riordan group and the multiple Riordon type arrays. We give a comprehensive discussion of the multiple Riordan arrays and characterize them by an $A$-sequence and multiple $Z$-sequences. The multiple Riordan group and some of its subgroups are defined. In addition, we give compressions of multiple Riordan arrays and their sequence characterizations. The total positivity of the compressions of multiple Riordan arrays is studied.

math.CO↗

On embeddability of Coxeter groups into the Riordan group

We discuss examples of linear representations of finite groups as subgroups of the Riordan group. In particular, we show that the symmetric group of degree three has no faithful representation as a subgroup of the Riordan group over the complex numbers, but can be embedded as a subgroup of the Riordan group over a field of characteristic three.

math.GR↗

The Double Almost-Riordan Arrays and Their Sequence Characterization, Compression, and Total Positivity

In this paper, we define double almost-Riordan arrays and find that the set of all double almost-Riordan arrays forms a group, called the double almost-Riordan group. We also obtain the sequence characteristics of double almost-Riordan arrays and give the production matrices for double almost-Riordan arrays. We define the compression of double almost-Riordan arrays and present their sequence characterization. Finally we give a characteristic for the total positivity of double Riordan arrays, by using which we discuss the total positivity for compressed double almost-Riordan arrays.

math.CO↗

Total Positivity of Quasi-Riordan Arrays

In this paper the total positivity of quasi-Riordan arrays is investigated with use of the sequence characterization of quasi-Riordan arrays. Due to the correlation between quasi-Riordan arrays and Riordan arrays, this study is an in-depth discussion of the total positivity of Riordan arrays.

math.CO↗

Total Positivity of Almost-Riordan Arrays

In this paper we study the total positivity of almost-Riordan arrays $(d(t)|\, g(t), f(t))$ and establish its necessary conditions and sufficient conditions, particularly, for some well used formal power series $d(t)$. We present a semidirect product of an almost-array and use it to transfer a total positivity problem for an almost-Riordan array to the total positivity problem for a quasi-Riordan array. We find the sequence characterization of total positivity of the almost-Riordan arrays. The production matrix $J$ of an almost-Riordan array $(d|\, g,f)$ is presented so that $J$ is totally positive implies the total positivity of both the almost-Riordan array $(d|\, g,f)$ and the Riordan array $(g,f)$. We also present a counterexample to illustrate that this sufficient condition is not necessary. If the production matrix $J$ is tridiagonal, then the expressions of its principal minors are given. By using expressions, we find a sufficient and necessary condition of the total positivity of almost-Riordan arrays with tridiagonal production matrices. A numerous examples are given to demonstrate our results.

math.CO↗

The $m$th-order Eulerian Numbers

We define the $m$th-order Eulerian numbers with a combinatorial interpretation. The recurrence relation of the $m$th-order Eulerian numbers, the row generating function and the row sums of the $m$th-order Eulerian triangle are presented. We also define the $m$th-order Eulerian fraction and its alternative form. Some properties of the $m$th-order Eulerian fractions are represented by using differentiation and integration. An inversion relationship between second-order Eulerian numbers and Stirling numbers of the second kind is given. Finally, we give the exact expression of the values of the $m$th-order Eulerian numbers.

math.CO↗

Divisibility of the Sums of the Power of Consecutive Integers

We study the divisibility of the sums of the odd power of consecutive integers, $S(m,k)=1^{mk}+2^{mk}+\cdots+k^{mk}$ and $1^k+2^k+\cdots+n^k$ for odd integers $m$ and $k$, by using the Girard-Waring identity. Faulhaber's approach for the divisibilities is discussed. Some expressions of power sums in terms of Stirling numbers of the second kind are represented.

math.CO↗

The Vertical Recursive Relation of Riordan Arrays and Their Matrix Representation

A vertical recursive relation approach to Riordan arrays is induced, while the horizontal recursive relation is represented by $A$- and $Z$-sequences. This vertical recursive approach gives a way to represent the entries of a Riordan array $(g,f)$ in terms of a recursive linear combinations of the coefficients of $g$. A matrix representation of the vertical recursive relation is also given. The set of all those matrices forms a group, called the quasi-Riordan group. The extensions of the horizontal recursive relation and the vertical recursive relation in terms of $c$- and $C$- Riordan arrays are defined with illustrations by using the rook triangle and the Laguerre triangle. Those extensions represent a way to study nonlinear recursive relations of the entries of some triangular matrices from linear recursive relations of the entries of Riordan arrays. In addition, the matrix representation of the vertical recursive relation of Riordan arrays provides transforms between lower order and high order finite Riordan arrays, where the $m$th order Riordan array is defined by $(g,f)_m=(d_{n,k})_{m\geq n,k\geq 0}$. Furthermore, the vertical relation approach to Riordan arrays provides a unified approach to construct identities.

math.CO↗

On the Solutions of Three Variable Frobenius Related Problems Using Order Reduction Approach

This paper presents a new approach to determine the number of solutions of three variable Frobenius related problems and to find their solutions by using order reducing methods. Here, the order of a Frobenius related problem means the number of variables appearing in the problem. We present two types of order reduction methods that can be applied to the problem of finding all nonnegative solutions of three variable Frobenius related problems. The first method is used to reduce the equation of order three from a three variable Frobenius related problem to be a system of equations with two fixed variables. The second method reduces the equation of order three into three equations of order two, for which an algorithm is designed with an interesting open problem on solutions left as a conjecture.

math.NT↗

Centralizers of the Riordan Group

In this paper, we discuss centralizers in the Riordan group. We will see that Faà di Bruno's formula is an application of the Fundamental Theorem of Riordan arrays. Then the composition group of formal power series in ${\cal F}_1$ is studied to construct the centralizers of Bell type and Lagrange type Riordan arrays. Our tools are the $A$-sequences of Riordan arrays and Faà di Bruno's formula. Some combinatorial explanation and discussion about related algebraic topics are also given.

math.CO↗

One-pth Riordan Arrays in the Construction of Identities

For an integer $p\geq 2$ we construct vertical and horizontal one-pth Riordan arrays from a Riordan array. When $p=2$, one-pth Riordan arrays reduced to well known half Riordan arrays. The generating functions of the $A$-sequences of vertical and horizontal one-pth Riordan arrays are found. The vertical and horizontal one-pth Riordan arrays provide an approach to construct many identities. They can also be used to verify some well known identities readily.

math.CO↗