activity
20102026
most citedThe enumeration of generalized Tamari intervals

29 citations · 129 across the 32 of their papers we have counts for

collaborators

34 papers

math.CO2026

Symmetries on vector parking functions via bounded lattice paths

Wenjie Fang, Yang Li, Zhicong Lin

Partly motivated by enumeration of parking functions and their variants, there is a long-standing interest in lattice paths refined by several statistics, including the notable $\m…

math.CO2026

Decomposition of Greedy Tamari Intervals and Bipartite Planar Maps

Philippe Biane, Wenjie Fang

The greedy Tamari poset, inspired by the well-studied Tamari lattice, was recently defined by Dermenjian in the more general setting of greedy -Tamari posets. Bousquet-Mélou and…

math.CO2026

On the area-depth symmetry on Łukasiewicz paths

Wenjie Fang

In an effort to further understanding -Catalan statistics, a new statistic on Dyck paths called was proposed in Pappe, Paul and Schilling (2022) and was shown…

math.CO2025

Asymptotic normality of embedding distributions of some families of graphs

Yichao Chen, Wenjie Fang, Zhicheng Gao +1

Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and co…

math.CO2025

Bivariate asymptotics via random walks: application to large genus maps

Andrew Elvey Price, Wenjie Fang, Baptiste Louf +1

We obtain bivariate asymptotics for the number of (unicellular) combinatorial maps (a model of discrete surfaces) as both the size and the genus grow. This work is related to two r…

math.CO2025

A new definition for m-Cambrian lattices

Clément Chenevière, Wenjie Fang, Corentin Henriet

The Cambrian lattices, introduced in (Reading, 2006), generalize the Tamari lattice to any choice of Coxeter element in any finite Coxeter group. They are further generalized to th…

math.CO2024

Maximal number of subword occurrences in a word

Wenjie Fang

We consider the number of occurrences of subwords (non-consecutive sub-sequences) in a given word. We first define the notion of subword entropy of a given word that measures the m…

math.CO2023

Tamari intervals and blossoming trees

Wenjie Fang, Éric Fusy, Philippe Nadeau

We introduce a simple bijection between Tamari intervals and the blossoming trees (Poulalhon and Schaeffer, 2006) encoding planar triangulations, using a new meandering representat…

math.CO2022★ 1 cited

Bijective proof of a conjecture on unit interval posets

Wenjie Fang

In a recent preprint, Matherne, Morales and Selover conjectured that two different representations of unit interval posets are related by the famous zeta map in -Catalan combi…

math.NT2022

Searching on the boundary of abundance for odd weird numbers

Wenjie Fang

Weird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the existence of odd weird numbers has been an open problem. In this work, we describe our…

math.CO2022

Bijections between planar maps and planar linear normal -terms with connectivity condition

Wenjie Fang

The enumeration of linear -terms has attracted quite some attention recently, partly due to their link to combinatorial maps. Zeilberger and Giorgetti (2015) gave a recursive bi…

math.CO2021★ 1 cited

Parabolic Tamari Lattices in Linear Type B

Wenjie Fang, Henri Mühle, Jean-Christophe Novelli

We study parabolic aligned elements associated with the type- Coxeter group and the so-called linear Coxeter element. These elements were introduced algebraically in (Mühle and…

math.CO2021★ 2 cited

Efficient recurrence for the enumeration of permutations with fixed pinnacle set

Wenjie Fang

Initiated by Davis, Nelson, Petersen and Tenner (2018), the enumerative study of pinnacle sets of permutations has attracted a fair amount of attention recently. In this article, w…

math.CO2020★ 1 cited

A Consecutive Lehmer Code for Parabolic Quotients of the Symmetric Group

Wenjie Fang, Henri Mühle, Jean-Christophe Novelli

In this article we define an encoding for parabolic permutations that distinguishes between parabolic -avoiding permutations. We prove that the componentwise order on these co…

math.CO2020★ 1 cited

A character approach to directed genus distribution of graphs: the bipartite single-black-vertex case

Yichao Chen, Wenjie Fang

Given an Eulerian digraph, we consider the genus distribution of its face-oriented embeddings. We prove that such distribution is log-concave for two families of Eulerian digraphs,…

math.CO2020★ 2 cited

Bijective link between Chapoton's new intervals and bipartite planar maps

Wenjie Fang

In 2006, Chapoton defined a class of Tamari intervals called "new intervals" in his enumeration of Tamari intervals, and he found that these new intervals are equi-enumerated with…

math.CO2019★ 10 cited

Compacted binary trees admit a stretched exponential

Andrew Elvey Price, Wenjie Fang, Michael Wallner

A compacted binary tree is a directed acyclic graph encoding a binary tree in which common subtrees are factored and shared, such that they are represented only once. We show that…

math.CA2019★ 6 cited

Absolute root separation

Yann Bugeaud, Andrej Dujella, Wenjie Fang +2

The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be…

math.CO2019★ 7 cited

The Steep-Bounce Zeta Map in Parabolic Cataland

Cesar Ceballos, Wenjie Fang, Henri Mühle

As a classical object, the Tamari lattice has many generalizations, including -Tamari lattices and parabolic Tamari lattices. In this article, we unify these generalizations in…

math.CO2018★ 1 cited

Subcritical random hypergraphs, high-order components, and hypertrees

Oliver Cooley, Wenjie Fang, Nicola Del Giudice +1

In the binomial random graph , when changes from (subcritical case) to and then to (supercritical case) for $\va…

math.CO2018★ 4 cited

A partial order on Motzkin paths

Wenjie Fang

The Tamari lattice, defined on Catalan objects such as binary trees and Dyck paths, is a well-studied poset in combinatorics. It is thus natural to try to extend it to other famili…

math.CO2017★ 5 cited

Fighting fish and two-stack sortable permutations

Wenjie Fang

In 2017, Duchi, Guerrini, Rinaldi and Schaeffer proposed a new family of combinatorial objects called "fighting fish", which are counted by the same formula as more classical objec…

math.CO2017★ 9 cited

A trinity of duality: non-separable planar maps, -(1,0) trees and synchronized intervals

Wenjie Fang

The dual of a map is a fundamental construction on combinatorial maps, but many other combinatorial objects also possess their notion of duality. For instance, the Tamari lattice i…

math.CO2016★ 15 cited

Planar triangulations, bridgeless planar maps and Tamari intervals

Wenjie Fang

We present a direct bijection between planar 3-connected triangulations and bridgeless planar maps, which were first enumerated by Tutte (1962) and Walsh and Lehman (1975) respecti…