Related papers: A note on some conjectures about combinatorial mod…
Peca suggested in a recent paper on the arxiv to consider binary butterfly trees and their Horton-Strahler numbers. The trees are obtained by glueing two binary trees together in a special way; the results are again binary trees but with a…
In this note, by counting some colored plane trees we obtain several binomial identities. These identities can be viewed as specific evaluations of certain generalizations of the Narayana polynomials. As consequences, it provides…
We prove a few simple cases of a random graph statement that would imply the "second" Kahn--Kalai Conjecture. Even these cases turn out to be reasonably challenging, and it is hoped that the ideas introduced here may lead to further…
Motivated by applications to low-rank matrix completion, we give a combinatorial characterization of the independent sets in the algebraic matroid associated to the collection of $m\times n$ rank-2 matrices and $n\times n$ skew-symmetric…
It is a classical result of Stein and Waterman that the asymptotic number of RNA secondary structures is $1.104366 \cdot n^{-3/2} \cdot 2.618034^n$. Motivated by the kinetics of RNA secondary structure formation, we are interested in…
Enomoto showed for finite dimensional algebras that the classification of exact structures on the category of finitely generated projective modules can be reduced to the classification of 2-regular simple modules. In this article, we give a…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
We give two trees allowing to represent all positive rational numbers. These trees can be seen as ternary and quinary analogues of the Calkin-Wilf tree. For each of these two trees, we give recurrence formulas allowing to compute the…
In this paper we prove a conjecture on the dimension of linear systems, with base points of multiplicity 2 and 3, on an Hirzebruck surface.
Construction of phylogenetic trees and networks for extant species from their characters represents one of the key problems in phylogenomics. While solution to this problem is not always uniquely defined and there exist multiple methods for…
We present a proof of the Harbourne-Hirschowitz conjecture for linear systems with base points of multiplicity seven or less. This proof uses a well-known degeneration of the projective plane, as well as a combinatorial technique that…
Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han's formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang's extension. We give…
In [2], while studying a relevant class of polyominoes that tile the plane by translation, i.e., double square polyominoes, the authors found that their boundary words, encoded by the Freeman chain coding on a four letters alphabet, have…
Rooted phylogenetic networks are often constructed by combining trees, clusters, triplets or characters into a single network that in some well-defined sense simultaneously represents them all. We review these four models and investigate…
Trees of finite cone type have appeared in various contexts. In particular, they come up as simplified models of regular tessellations of the hyperbolic plane. The spectral theory of the associated Laplacians can thus be seen as induced by…
We study the combinatorics of pseudoline arrangements in the real projective plane. Our focus lies on two classes of arrangements: simplicial arrangements and arrangements whose characteristic polynomials have only real roots. We derive…
We provide a systematic enumerative and combinatorial study of geometric cellular diagonals on the permutahedra. In the first part of the paper, we study the combinatorics of certain hyperplane arrangements obtained as the union of $\ell$…
We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…
We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…
We introduce a monoid structure on the set of binary search trees, by a process very similar to the construction of the plactic monoid, the Robinson-Schensted insertion being replaced by the binary search tree insertion. This leads to a new…