Related papers: Last Car Decomposition of Planar Maps

Automorphisms of structural matrix algebras in block upper triangular form has been studied recently in \cite{Akkurt E-M Barker 2}, and this work is a follow-up paper of that study. The aim of this paper is to explain the topic in a much…

In this paper, we give a decomposition of triply rooted trees into three doubly rooted trees. This leads to a combinatorial interpretation of an identity conjectured by Lacasse in the study of the PAC-Bayesian machine learning theory, and…

Consider Bernoulli(1/2) percolation on $\mathbb{Z}^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

In this article we study fine regularity properties for mappings of finite distortion. Our main theorems yield strongly localized regularity results in the borderline case in the class of maps of exponentially integrable distortion.…

We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of $n$ points in the plane. Configurations of interest include \emph{convex polygons},…

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

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…

We propose a functional view of matrix decomposition problems on graphs such as geometric matrix completion and graph regularized dimensionality reduction. Our unifying framework is based on the key idea that using a reduced basis to…

In a recent paper, Cristofaro-Gardiner--Li--Stanley [CGLS15] constructed examples of irrational triangles whose Ehrhart functions (i.e. lattice-point count) are polynomials when restricted to positive integer dilation factors. This is very…

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one…

This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…

We determine a strong form of the decomposition theorem for proper toric maps over finite fields.

We consider maps which preserve functions which are built out of the invariants of some simple vector fields. We give a reduction procedure, which can be used to derive commuting maps of the plane, which preserve the same symplectic form…

We introduce two classes of algebras coming from partial triangulations of marked surfaces. The first one, called frozen algebra of a partial triangulation, is generally of infinite rank and contains frozen Jacobian algebras of…

A tree decomposition of a graph facilitates computations by grouping vertices into bags that are interconnected in an acyclic structure, hence their importance in a plethora of problems such as query evaluation over databases and inference…

In this paper, we discuss several additional properties a power linear Keller map may have. The Structural Conjecture by Druzkowski in [Dru] asserts that two such properties are equivalent, but we show that one of this properties is…

In intelligent transportation systems, traffic data imputation, estimating the missing value from partially observed data is an inevitable and challenging task. Previous studies have not fully considered traffic data's multidimensionality…

We present a new method to count unrooted maps on the sphere up to orientation-preserving homeomorphisms. The principle, called tree-decomposition, is to deform a map into an arborescent structure whose nodes are occupied by constrained…

In [5] I solved the Thom's conjecture that a proper Thom map is triangulable. In this paper I drop the properness condition in the semialgebraic case and, moreover, in the definable case in an o-minimal structure.