惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

雷峰网
雷峰网
L
LangChain Blog
GbyAI
GbyAI
F
Fortinet All Blogs
腾讯CDC
Last Week in AI
Last Week in AI
A
About on SuperTechFans
J
Java Code Geeks
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - Franky
B
Blog
D
Docker
G
Google Developers Blog
月光博客
月光博客
博客园 - 三生石上(FineUI控件)
S
SegmentFault 最新的问题
Apple Machine Learning Research
Apple Machine Learning Research
酷 壳 – CoolShell
酷 壳 – CoolShell
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
T
Tailwind CSS Blog
宝玉的分享
宝玉的分享
U
Unit 42
Blog — PlanetScale
Blog — PlanetScale
B
Blog RSS Feed

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Elements of Finite Order in the Riordan Group and Their E...
Marshall M. Cohen · 2018-06-18 · via math.CO updates on arXiv.org

We consider elements of finite order in the Riordan group $\cal R$ over a field of characteristic $0$. Viewing $\cal R$ as a semi-direct product of groups of formal power series, we solve, for all $n \geq 2$, two foundational questions posed by L. Shapiro for the case $n = 2$ (`involutions'): Given a formal power series $F(x)$ of finite compositional order and an integer $n\geq 2$, Theorem 1 states, exactly which $g(x)$ make $\big(g(x), F(x)\big)$ a Riordan element of order $n$. Theorem 2 classifies finite-order Riordan group elements up to conjugation in $\cal R$. Viewing $\cal R$ as a group of infinite lower triangular matrices, we interpret Theorem 1 in terms of existence of eigenvectors and Theorem 2 as a normal form for finite order Riordan arrays under similarity. These lead to Theorem 3, a formula for all eigenvectors of finite order Riordan arrays; and we show how this can lead to interesting combinatorial identities. We then relate our work to papers of Cheon and Kim which motivated this paper and we solve the Open question which they posed. Finally, this circle of ideas gives a new proof of C. Marshall's theorem, which finds the unique $F(x)$, given bi-invertible $g(x)$, such that $\big(g(x), F(x))$ is an involution.