Related papers: From order one catalytic decompositions to context…
We demonstrate a method for proving precise concentration inequalities in uniformly random trees on $n$ vertices, where $n\geq1$ is a fixed positive integer. The method uses a bijection between mappings…
Inspired by Karr's algorithm, we consider the summations involving a sequence satisfying a recurrence of order two. The structure of such summations provides an algebraic framework for solving the difference equations of form…
The notion of binomial coefficients $T \choose S$ of finite planar, reduced rooted trees $T, S$ is defined and a recursive formula for its computation is shown. The nonassociative binomial formula $$(1 + x)^T = \displaystyle \sum_S {T…
We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain…
We investigate the computational problem of determining whether a bivariate polynomial with non-negative coefficients and no constant term can attain a prime value. While classical conjectures such as Bouniakowsky's provide necessary…
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…
The Eulerian transformation is the linear operator on polynomials in one variable with real coefficients which maps the powers of this variable to the corresponding Eulerian polynomials. The derangement transformation is defined similarly.…
We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…
We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees, with interesting consequences for enumeration, mesh compression and graph sampling. Our bijection yields an efficient uniform random…
This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of opportunity. Rather than finding a decision tree minimizing…
In the past, empirical evidence has been presented that Hilbert series of symplectic quotients of unitary representations obey a certain universal system of infinitely many constraints. Formal series with this property have been called…
A Catalan magma is a unique factorisation normed magma with only one irreducible element. The \val partitions the base set into subsets enumerated by Catalan numbers. The primary theorem characterises the conditions which a set a with…
Constructive methods for matrices of multihomogeneous (or multigraded) resultants for unmixed systems have been studied by Weyman, Zelevinsky, Sturmfels, Dickenstein and Emiris. We generalize these constructions to mixed systems, whose…
It is known a method for converting a system of Boolean polynomial equations to a single Boolean polynomial equation with less variables. In this paper, we show a formula for systems of Boolean polynomial equations which is based on the…
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial…
According to Jae Suk Park, physicists use "canonical coordinate systems" to compute correlations in perturbative quantum field theories. One may interpret these canonical coordinate systems as equivalences of generalized differential Lie…
In this paper, we give a bijection between rooted labeled ordered forests with a selected subset of their leaves and the regions of the type $C$ Catalan arrangement in $\R^n$. We thus obtain a bijective proof of the well-known enumeration…
For a natural class of $r \times n$ integer matrices, we construct a non-convex polytope which periodically tiles $\mathbb R^n$. From this tiling, we provide a family of geometrically meaningful maps from a generalized sandpile group to a…