Mingjia Yang

activity

20172019

collaborators

5 papers

math.CO2019

Systematic Counting of Restricted Partitions

Mingjia Yang, Doron Zeilberger

Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe t…

math.CO2018

Increasing Consecutive Patterns in Words

Mingjia Yang, Doron Zeilberger

We show how to enumerate words in $1^{m_{1}} \dots n^{m_{n}}$ that avoid the increasing consecutive pattern $12 \dots r$ for any $r \geq 2$ . Our approach yields an $O (n^{s + 1})$ algorit…

math.CO2017

Enumeration of words that contain the pattern 123 exactly once

Mingjia Yang

Enumeration problems related to words avoiding patterns as well as permutations that contain the pattern $123$ exactly once have been studied in great detail. However, the problem…

math.HO2017

Automated Proofs of Many Conjectured Recurrences in the OEIS made by R.J. Mathar

Shalosh B. Ekhad, Mingjia Yang, Doron Zeilberger

The On-Line Encyclopedia Of Integer Sequences , that wonderful resource that most combinatorialists, and many other mathematicians and scientists, use at least once a day, is a tre…

math.CO2017

Counting Permutations that Avoid Many Patterns

Yonah Biers-Ariel, Haripriya Chakraborty, John Chiarelli +8

This paper presents a collection of experimental results regarding permutation pattern avoidance, focusing on cases where there are "many" patterns to be avoided.