Jia Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jia Huang has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
Jun-Ming Xu
Department of Mathematics, University of Science and Technology of China, Hefei, Anhui, 230026, China
7 shared publications- Brendon Rhoades
Department of Mathematics, University of California, San Diego, La Jolla, USA
3 shared publications - Erkko Lehtonen
Department of Mathematics, Khalifa University of Science and Technology, Abu Dhabi, United Arab Emirates
3 shared publications - Victor Reiner
School of Mathematics, University of Minnesota, Minneapolis, USA
3 shared publications - Darij Grinberg
Drexel University, Philadelphia, USA
2 shared publications - Nickolas Hein2 shared publications
Latest Publications
- 3 August 2026
- Published by Taylor & Francis in The Fibonacci Quarterly
- Vol. 64 (4) , 714-728
A Coin Flip Game and Generalizations of Fibonacci Numbers
1. In an X-post on March 16, 2024, Litt [6] asked the following question (see also Cheplyaka [3]): If you flip a coin 100 times, will HT (a heads followed by a tails) occur more often than HH (two ...
- 3 August 2026
- Published by Taylor & Francis in The Fibonacci Quarterly
- Vol. 64 (4) , 714-728
A Coin Flip Game and Generalizations of Fibonacci Numbers
1. In an X-post on March 16, 2024, Litt [6] asked the following question (see also Cheplyaka [3]): If you flip a coin 100 times, will HT (a heads followed by a tails) occur more often than HH (two ...
- Open Access
- 4 July 2025
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 32 (3) , P3.48
Dimensions of Compositions Modulo a Prime
The (ordinary) representation theory of the symmetric group is fascinating and has rich connections to combinatorics, including the Frobenius correspondence to the self-dual graded Hopf algebra of symmetric functions. The $0$-Hecke algebra (type $A$) is a deformation of the group algebra of the symmetric group, and its representation theory has an analogous correspondence to the dual graded Hopf algebras of quasisymmetric functions and noncommutative symmetric functions. Macdonald used the hook length formula for the number of standard Young tableaux of a fixed shape to determine how many irreducible representations of the symmetric group have dimensions indivisible by a prime $p$. In this paper, we study the dimensions of the projective indecomposable modules of the $0$-Hecke algebra modulo $p$; such a module is indexed by a composition and its dimension is given by a ribbon number, i.e., the cardinality of a descent class. Applying a result of Dickson on the congruence of multinomial coefficients, we count how many ribbon numbers belong to each congruence class modulo $p$ and extend the result to other finite Coxeter groups.- 4 July 2025
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 32 (3) , P3.48
Open AccessDimensions of Compositions Modulo a Prime
The (ordinary) representation theory of the symmetric group is fascinating and has rich connections to combinatorics, including the Frobenius correspondence to the self-dual graded Hopf algebra of symmetric functions. The $0$-Hecke algebra (type $A$) is a deformation of the group algebra of the symmetric group, and its representation theory has an analogous correspondence to the dual graded Hopf algebras of quasisymmetric functions and noncommutative symmetric functions. Macdonald used the hook length formula for the number of standard Young tableaux of a fixed shape to determine how many irreducible representations of the symmetric group have dimensions indivisible by a prime $p$. In this paper, we study the dimensions of the projective indecomposable modules of the $0$-Hecke algebra modulo $p$; such a module is indexed by a composition and its dimension is given by a ribbon number, i.e., the cardinality of a descent class. Applying a result of Dickson on the congruence of multinomial coefficients, we count how many ribbon numbers belong to each congruence class modulo $p$ and extend the result to other finite Coxeter groups. - Open Access
Dimensions of compositions modulo a prime
The (ordinary) representation theory of the symmetric group is fascinating and has rich connections to combinatorics, including the Frobenius correspondence to the self-dual graded Hopf algebra of symmetric functions. The $0$-Hecke algebra (of type $A$) is a deformation of the group algebra of the symmetric group, and its representation theory has an analogous correspondence to the dual graded Hopf algebras of quasisymmetric functions and noncommutative symmetric functions. Macdonald used the hook length formula for the number of standard Young tableaux of a fixed shape to determine how many irreducible representations of the symmetric group have dimensions indivisible by a prime $p$. In this paper, we study the dimensions of the projective indecomposable modules of the $0$-Hecke algebra modulo $p$; such a module is indexed by a composition and its dimension is given by a ribbon number, i.e., the cardinality of a descent class. Applying a result of Dickson on the congruence of multinomial coefficients, we count how many ribbon numbers belong to each congruence class modulo $p$. We also extend the result to other finite Coxeter groups.Open AccessDimensions of compositions modulo a prime
The (ordinary) representation theory of the symmetric group is fascinating and has rich connections to combinatorics, including the Frobenius correspondence to the self-dual graded Hopf algebra of symmetric functions. The $0$-Hecke algebra (of type $A$) is a deformation of the group algebra of the symmetric group, and its representation theory has an analogous correspondence to the dual graded Hopf algebras of quasisymmetric functions and noncommutative symmetric functions. Macdonald used the hook length formula for the number of standard Young tableaux of a fixed shape to determine how many irreducible representations of the symmetric group have dimensions indivisible by a prime $p$. In this paper, we study the dimensions of the projective indecomposable modules of the $0$-Hecke algebra modulo $p$; such a module is indexed by a composition and its dimension is given by a ribbon number, i.e., the cardinality of a descent class. Applying a result of Dickson on the congruence of multinomial coefficients, we count how many ribbon numbers belong to each congruence class modulo $p$. We also extend the result to other finite Coxeter groups. - 1 January 2025
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 45 (3) , 927
Dissociation in circulant graphs and integer distance graphs
- 1 January 2025
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 45 (3) , 927
Dissociation in circulant graphs and integer distance graphs
- Open Access
Even and odd compositions with restricted parts
A result of Legendre asserts that the difference between the numbers of (length) even and odd partitions of $n$ into distinct parts is $0$, $1$, or $-1$; this also follows from Euler's pentagonal number theorem. We establish an analogous result for compositions and obtain some generalizations that are related to various entries in the On-Line Encyclopedia of Integer Sequences.Open AccessEven and odd compositions with restricted parts
A result of Legendre asserts that the difference between the numbers of (length) even and odd partitions of $n$ into distinct parts is $0$, $1$, or $-1$; this also follows from Euler's pentagonal number theorem. We establish an analogous result for compositions and obtain some generalizations that are related to various entries in the On-Line Encyclopedia of Integer Sequences. - Open Access
Associative-commutative spectra for some varieties of groupoids
The associative spectrum of a groupoid (i.e., a set with a binary operation) measures its nonassociativity while the associative-commutative spectrum measures both nonassociativity and noncommutativity of the groupoid. The two spectra are also the coefficients of the Hilbert series of certain operads. We establish upper bounds for the two spectra of various varieties of groupoids defined by different sets of identities and provide examples (often groupoids with three elements) for which the upper bounds are achieved. Our results have connections to many interesting combinatorial objects and integer sequences and naturally lead to some questions for future studies.
Open AccessAssociative-commutative spectra for some varieties of groupoids
The associative spectrum of a groupoid (i.e., a set with a binary operation) measures its nonassociativity while the associative-commutative spectrum measures both nonassociativity and noncommutativity of the groupoid. The two spectra are also the coefficients of the Hilbert series of certain operads. We establish upper bounds for the two spectra of various varieties of groupoids defined by different sets of identities and provide examples (often groupoids with three elements) for which the upper bounds are achieved. Our results have connections to many interesting combinatorial objects and integer sequences and naturally lead to some questions for future studies.
- 7 June 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (10)
The associative-commutative spectrum of a binary operation
- 7 June 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (10)
The associative-commutative spectrum of a binary operation
- Open Access
The associative-commutative spectrum of a binary operation
We initiate the study of a quantitative measure for the failure of a binary operation to be commutative and associative. We call this measure the associative-commutative spectrum as it extends the so-called associative spectrum (also known as the subassociativity type), which measures the nonassociativity of a binary operation. In fact, the associative-commutative spectrum (resp. associative spectrum) is the cardinality of the symmetric (resp. nonsymmetric) operad obtained naturally from a groupoid (a set with a binary operation). In this paper we provide some general results on the associative-commutative spectrum, precisely determine this measure for certain binary operations, and propose some problems for future study.
Open AccessThe associative-commutative spectrum of a binary operation
We initiate the study of a quantitative measure for the failure of a binary operation to be commutative and associative. We call this measure the associative-commutative spectrum as it extends the so-called associative spectrum (also known as the subassociativity type), which measures the nonassociativity of a binary operation. In fact, the associative-commutative spectrum (resp. associative spectrum) is the cardinality of the symmetric (resp. nonsymmetric) operad obtained naturally from a groupoid (a set with a binary operation). In this paper we provide some general results on the associative-commutative spectrum, precisely determine this measure for certain binary operations, and propose some problems for future study.
- Open Access
Partially Palindromic Compositions
We generalize recent work of Andrews, Just, and Simay on modular palindromic compositions and anti-palindromic compositions by viewing all compositions partially (modular) palindromic or anti-palindromic. More precisely, we enumerate compositions by the extent to which they are (modular) palindromic or anti-palindromic. We obtain various closed formulas from generating functions and provide bijective proofs for many of them. We recover some known results of Andrews, Just, and Simay and discover new connections with numerous sequences in The On-Line Encyclopedia of Integer Sequences (OEIS).
Open AccessPartially Palindromic Compositions
We generalize recent work of Andrews, Just, and Simay on modular palindromic compositions and anti-palindromic compositions by viewing all compositions partially (modular) palindromic or anti-palindromic. More precisely, we enumerate compositions by the extent to which they are (modular) palindromic or anti-palindromic. We obtain various closed formulas from generating functions and provide bijective proofs for many of them. We recover some known results of Andrews, Just, and Simay and discover new connections with numerous sequences in The On-Line Encyclopedia of Integer Sequences (OEIS).
- 6 May 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 317, 1-9
Domination ratio of a family of integer distance digraphs with arbitrary degree
- 6 May 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 317, 1-9
Domination ratio of a family of integer distance digraphs with arbitrary degree