Related papers: A note on some conjectures about combinatorial mod…
We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…
The polynomial Fre\u{\i}man--Ruzsa conjecture is a fundamental open question in additive combinatorics. However, over the integers (or more generally $\mathbb{R}^d$ or $\mathbb{Z}^d$) the optimal formulation has not been fully pinned down.…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
We discuss, following Mikhalkin, Brugall\'e, and many others, the counting of curves on toric surfaces with prescribed genus, Newton polygon, and intersection pattern with the toric boundary divisor, both at assigned and unassigned points.…
The reconstruction of a species tree from genomic data faces a double hurdle. First, the (gene) tree describing the evolution of each gene may differ from the species tree, for instance, due to incomplete lineage sorting. Second, the…
The relationship between sequences and secondary structures or shapes in RNA exhibits robust statistical properties summarized by three notions: (1) the notion of a typical shape (that among all sequences of fixed length certain shapes are…
We introduce a monoid structure on a certain set of labelled binary trees, by a process similar to the construction of the plactic monoid. This leads to a new interpretation of the algebra of planar binary trees of Loday-Ronco.
Using the structure of the jet schemes of rational double point singularities, we construct "minimal embedded toric resolutions" of these singularities. We also establish, for these singularities, a correspondence between a natural class of…
This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the…
We construct two Frechet algebras admitting countably many mutually inequivalent Frechet algebra topologies. The second example is a modification of the maiden (and first) example of a non-Banach Frechet algebra with two inequivalent…
We present a general setting for structure-sequence comparison in a large class of RNA structures that unifies and generalizes a number of recent works on specific families on structures. Our approach is based on tree decomposition of…
We iterate Manolescu's unoriented skein exact triangle in knot Floer homology with coefficients in the field of rational functions over $\mathbb{Z}/2\mathbb{Z}$. The result is a spectral sequence which converges to a stabilized version of…
Double Bruhat cells in a semisimple group are intersections of cells in two Bruhat decompositions corresponding to two opposite Borel subgroups. They form a geometric framework for the study of total positivity in semisimple groups; they…
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…
The VPN Tree Routing Conjecture is a conjecture about the Virtual Private Network Design problem. It states that the symmetric version of the problem always has an optimum solution which has a tree-like structure. In recent work, Hurkens,…
We define combinatorial representations of finite skew braces and use this idea to produce a database of skew braces of small size. This database is then used to explore different concepts of the theory of skew braces such as ideals, series…
We provide precise asymptotic estimates for the number of general phylogenetic networks by using analytic combinatorial methods. Recently, this approach is studied by Fuchs, Gittenberger, and the author himself (Australasian Journal of…
The `Congruence Conjecture' was developed by the second author in a previous paper. It provides a conjectural explicit reciprocity law for a certain element associated to an abelian extension of a totally real number field whose existence…
A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…