English
Related papers

Related papers: Computing Covers of Plane Forests

200 papers

A caterpillar tree is a connected, acyclic, graph in which all vertices are either a member of a central path, or joined to that central path by a single edge. In other words, caterpillar trees are the class of trees which become path…

Combinatorics · Mathematics 2018-10-30 Jacob Crabtree

Let $F$ be a non-singular foliation on the plane with all leaves being closed subsets, $H^{+}(F)$ be the group of homeomorphisms of the plane which maps leaves onto leaves endowed with compact open topology, and $H^{+}_{0}(F)$ be the…

Geometric Topology · Mathematics 2016-10-12 Yuliia Soroka

Convex geometry is a closure space $(G,\phi)$ with the anti-exchange property. A classical result of Edelman and Jamison (1985) claims that every finite convex geometry is a join of several linear sub-geometries, and the smallest number of…

Combinatorics · Mathematics 2018-08-09 Kira Adaricheva , Gent Gjonbalaj

We consider additive functionals $X_n(\phi)$ with small toll functions on split trees and a generalization of split trees, which we call fractional split trees, where the split vector does not need to sum up to 1. These additive functionals…

Probability · Mathematics 2026-03-24 Cecilia Holmgren , Jasper Ischebeck , Svante Janson

Let $X$ be a connected non-compact $2$-dimensional manifold possibly with boundary and $\Delta$ be a foliation on $X$ such that each leaf $\omega\in\Delta$ is homeomorphic to $\mathbb{R}$ and has a trivially foliated neighborhood. Such…

Geometric Topology · Mathematics 2016-10-04 Sergiy Maksymenko , Eugene Polulyakh

This is the announcement, and the long summary, of a series of articles on the algorithmic study of Thurston maps. We describe branched coverings of the sphere in terms of group-theoretical objects called bisets, and develop a theory of…

Computational Complexity · Computer Science 2017-06-20 Laurent Bartholdi , Dzmitry Dudko

A singular Riemannian foliation $F$ on a complete Riemannian manifold $M$ is called a polar foliation if, for each regular point $p$, there is an immersed submanifold $\Sigma$, called section, that passes through $p$ and that meets all the…

Differential Geometry · Mathematics 2012-03-21 Marcos M. Alexandrino

An independent edge set of graph $G$ is a matching, and is maximal if it is not a proper subset of any other matching of $G$. The number of all the maximal matchings of $G$ is denoted by $\Psi(G)$. In this paper, an algorithm to count…

Combinatorics · Mathematics 2025-06-11 Lingjuan Shi , Wei Li , Kai Deng

We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…

Combinatorics · Mathematics 2014-01-29 Qingchun Ren

This paper studies a covering map phi from the upper half plane to the complex plane with a triangular lattice excised. This map is interesting as it factorises Klein's J invariant. Its derivative has properties which are a slight…

Classical Analysis and ODEs · Mathematics 2012-03-26 Marjorie Batchelor , Polly Brownlee , William Woods

Let $\phi$ be a quadratic, monic polynomial with coefficients in $\mathcal O_{F,D}[t]$, where $\mathcal O_{F,D}$ is a localization of a number ring $\mathcal O_F$. In this paper, we first prove that if $\phi$ is non-square and…

Number Theory · Mathematics 2020-01-23 Andrea Ferraguti , Giacomo Micheli

Suppose $\phi$ is a $\mathbb{Z}/4$-cover of a curve over an algebraically closed field $k$ of characteristic $2$, and $\Phi_1$ is a \emph{nice} lift of $\phi$'s $\mathbb{Z}/2$-sub-cover to a complete discrete valuation ring $R$ in…

Algebraic Geometry · Mathematics 2023-09-19 Huy Dang

We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that…

Statistical Mechanics · Physics 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

Let $C(\mathbf I)$ be the set of all continuous self-maps from ${\mathbf I}=[0,1]$ with the topology of uniformly convergence. A map $f\in C({\mathbf I})$ is called a transitive map if for every pair of non-empty open sets $U,V$ in…

Dynamical Systems · Mathematics 2020-06-18 Zhaorong He , Jian Li , Zhongqiang Yang

Let $A_{\varphi}$ denote the matrix of rotation with angle $\varphi$ of the Euclidean plane, FLOOR the function, which rounds a real point to the nearest lattice point down on the left and ROUND the function for rounding off a vector to the…

Number Theory · Mathematics 2021-09-07 Carolin Hannusch , Attila Pethő

We show that the problem of constructing tree-structured descriptions of data layouts that are optimal with respect to space or other criteria from given sequences of displacements, can be solved in polynomial time. The problem is relevant…

Data Structures and Algorithms · Computer Science 2015-07-01 Robert Ganian , Martin Kalany , Stefan Szeider , Jesper Larsson Träff

Let $F$ be a transversely oriented foliation of codimension 1 on a closed manifold $M$, and let $\phi=\{\phi^t\}$ be a foliated flow on $(M,F)$. Assume the closed orbits of $\phi$ are simple and its preserved leaves are transversely simple.…

Geometric Topology · Mathematics 2024-02-14 Jesús A. Álvarez López , Yuri A. Kordyukov , Eric Leichtnam

For two positive maps $\phi_i:B(\mathcal{K}_i)\to B(\mathcal{H}_i)$, $i=1,2$, we construct a new linear map $\phi:B(\mathcal{H})\to B(\mathcal{K})$, where $\mathcal{K}=\mathcal{K}_1\oplus\mathcal{K}_2\oplus\mathbb{C}$,…

Operator Algebras · Mathematics 2018-02-19 Marcin Marciniak , Adam Rutkowski

Let v_1 and v_2 be two distinct vertices of a tree T_0. Let \phi_N^{(i)} (i=1,2) be the characteristic functions of the Sturm-Liouville problem on T_0 rooted at v_i with Neumann conditions at the root and let \phi_D^{(i)} (i=1,2) be the…

Mathematical Physics · Physics 2024-08-06 Mats-Erik Pistol , Vyacheslav Pivovarchik

Aerial image segmentation is the basis for applications such as automatically creating maps or tracking deforestation. In true orthophotos, which are often used in these applications, many objects and regions can be approximated well by…

Computer Vision and Pattern Recognition · Computer Science 2024-04-09 Daniel Gritzner , Jörn Ostermann