activity
20172020
most citedBijective enumerations of -free 0-1 matrices

4 citations · 5 across the 4 of their papers we have counts for

collaborators

6 papers

math.CO2020

Generalized Ordered Set Partitions

Beáta Bényi, Miguel Méndez, José L. Ramirez

In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first elements are in distinct blocks, respectivel…

math.CO2018★ 1 cited

Restricted -Stirling Numbers and their Combinatorial Applications

Beáta Bényi, Miguel Méndez, José L. Ramírez +1

We study set partitions with distinguished elements and block sizes found in an arbitrary index set . The enumeration of these -partitions leads to the introduction o…

math.CO2018

Some Applications of -restricted Set Partitions

Beáta Bényi, José L. Ramírez

In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction tha…

math.CO2018

Poly-Bernoulli Numbers and Eulerian Numbers

Beata Benyi, Peter Hajnal

In this note we prove combinatorially some new formulas connecting poly-Bernoulli numbers with negative indices to Eulerian numbers.

math.CO2017

Restricted lonesum matrices

Beata Benyi

Lonesum matrices are matrices that are uniquely reconstructible from their row and column sum vectors. These matrices are enumerated by the poly-Bernoulli numbers that are related…

math.CO2017★ 4 cited

Bijective enumerations of -free 0-1 matrices

Beáta Bényi, Gábor V. Nagy

We construct a new bijection between the set of - matrices with no three 's forming a configuration and the set of -Callan sequences, a simple struc…