Related papers: Slit-slide-sew bijections for oriented planar maps

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…

We develop the Lie theory of Lie-admissible algebras whose product is enriched with higher operations modeled on directed graphs with a view to apply it to the deformation theories controlled by this kind of Lie algebras. We produce…

The first part of this paper ( arXiv:1607.02114 ) introduced splitting trees, those chronological trees admitting the self-similarity property where individuals give birth, at constant rate, to iid copies of themselves. It also established…

It is an attractive hypothesis that the spatial structure of visual cortical architecture can be explained by the coordinated optimization of multiple visual cortical maps representing orientation preference (OP), ocular dominance (OD),…

The aim of the paper is to clarify the nature of combinatorial structures associated with maps on closed compact surfaces. We prove that maps give rise to Lagrangian matroids representable in a setting provided by cohomology of the surface…

We present a versatile formulation of the convolution operation that we term a "mapped convolution." The standard convolution operation implicitly samples the pixel grid and computes a weighted sum. Our mapped convolution decouples these…

We study the relations between pin structures on a non-orientable even-dimensional manifold, with or without boundary, and pin structures on its orientable double cover, requiring the latter to be invariant under sheet-exchange. We show…

We construct a localization for operads with respect to one-ary operations based on the Dwyer-Kan hammock localization. For an operad O and a sub-monoid of one-ary operations W we associate an operad LO and a canonical map O to LO which…

We give a complete classification of symplectic birational involutions of manifolds of $OG10$ type. We approach this classification with three techniques -- via involutions of the Leech lattice, via involutions of cubic fourfolds and…

For area-preserving H\'enon-like maps and their compositions, we consider smooth perturbations that keep the reversibility of the initial maps but destroy their conservativity. For constructing such perturbations, we use two methods, the…

We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting…

The class of fighting fish is a recently introduced model of branching surfaces generalizing parallelogram polyominoes. We can alternatively see them as gluings of cells, walks on the square lattice confined to the quadrant or shuffle of…

We consider finite-sheeted, regular, possibly branched covering spaces of compact surfaces with boundary and the associated liftable and symmetric mapping class groups. In particular, we classify when either of these subgroups coincides…

We develop two new tools for use in Alexandrov geometry: a theory of ramified orientable double covers and a particularly useful version of the Slice Theorem for actions of compact Lie groups. These tools are applied to the classification…

We construct Morse-Smale-Witten complex for an effective orientable orbifold. For a global quotient orbifold, we also construct a Morse-Bott complex. We show that certain type of critical points of a Morse function has to be discarded to…

This note studies numerical methods for solving compositional optimization problems, where the inner function is smooth, and the outer function is Lipschitz continuous, non-smooth, and non-convex but exhibits one of two special structures…

We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientation-constrained…

Decision trees are among the most popular machine learning models and are used routinely in applications ranging from revenue management and medicine to bioinformatics. In this paper, we consider the problem of learning optimal binary…

In this article we describe a program -- called planar_draw -- to draw maps on oriented surfaces in the plane. The drawings are coded as tikz files that can easily be manipulated and used in latex documents. Next to plane maps -- a case for…

We study a natural Lie algebra structure on the free vector space generated by all rooted planar trees as the associated Lie algebra of the nonsymmetric operad (non-$\Sigma$ operad, preoperad) of rooted planar trees. We determine whether…