Brice Huang

activity

20182026

most citedCyclic Descents for General Skew Tableaux

13 citations · 42 across the 23 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2022★ 1 cited

Improved Lower Bound for Frankl's Union-Closed Sets Conjecture

Ryan Alweiss, Brice Huang, Mark Sellke

We verify an explicit inequality conjectured recently by Gilmer, thus proving that for any nonempty union-closed family $F \subseteq 2^{[n]}$ , some $i \in [n]$ is contained in at le…

math.CO2018★ 6 cited

An Upper Bound on the Number of $(132, 213)$ -Avoiding Cyclic Permutations

Brice Huang

We show a $n^{2} \cdot 2^{n /2}$ upper bound on the number of $(132, 213)$ avoiding cyclic permutations. This is the first nontrivial upper bound on the number of such permutations. We…

math.CO2018★ 13 cited

Cyclic Descents for General Skew Tableaux

Brice Huang

A cyclic descent function on standard Young tableaux of size $n$ is a function that restricts to the usual descent function when $n$ is omitted, such that the number of standard Yo…

math.CO2018★ 1 cited

On the Local Geometry of Graphs in Terms of Their Spectra

Brice Huang, Mustazee Rahman

In this paper we consider the relation between the spectrum and the number of short cycles in large graphs. Suppose $G_{1}, G_{2}, G_{3}, \dots$ is a sequence of finite and connected gr…

Improved Lower Bound for Frankl's Union-Closed Sets Conjecture

An Upper Bound on the Number of (132,213)-Avoiding Cyclic Permutations

Cyclic Descents for General Skew Tableaux

On the Local Geometry of Graphs in Terms of Their Spectra

An Upper Bound on the Number of $(132, 213)$ -Avoiding Cyclic Permutations