English
Related papers

Related papers: Plane trees, Shabat-Zapponi polynomials and Julia …

200 papers

We obtain an explicit formula for the number of Lam\'e equations (modulo scalar equivalence) with index $n$ and projective monodromy group of order $2N$, for given $n \in \Z$ and $N \in \N$. This is done by performing the combinatorics of…

Classical Analysis and ODEs · Mathematics 2007-05-23 Sander Dahmen

A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…

Combinatorics · Mathematics 2007-05-23 M. H. Albert , M. D. Atkinson , Robert Brignall

We define a bivariate polynomial for unlabeled rooted trees and show that the polynomial of an unlabeled rooted tree $T$ is the generating function of a class of subtrees of $T$. We prove that the polynomial is a complete isomorphism…

Combinatorics · Mathematics 2020-02-13 Pengyu Liu

Given a scheme X over a field k, a generalized jet scheme parametrizes maps from Spec(A) to X, where A is a finite-dimensional, local algebra over k. We give an overview of known results concerning the dimensions of these schemes when A has…

Algebraic Geometry · Mathematics 2014-05-01 Mircea Mustata

An embedding of the complete bipartite graph $K_{3,3}$ in $\mathbb{P}^2$ gives rise to both a line arrangement and a bar-and-joint framework. For a generic placement of the six vertices, the graded Betti numbers of the logarithmic module of…

Commutative Algebra · Mathematics 2023-06-12 Michael DiPasquale , Jessica Sidman , Will Traves

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…

Combinatorics · Mathematics 2022-11-28 Éric Fusy , Emmanuel Guitter

We prove that every simple polygon contains a degree 3 tree encompassing a prescribed set of vertices. We give tight bounds on the minimal number of degree 3 vertices. We apply this result to reprove a result from Bose et al. that every set…

Computational Geometry · Computer Science 2012-11-12 Tillmann Miltzow

We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…

Combinatorics · Mathematics 2026-01-26 Elia Bisi , Piotr Dyszewski , Nina Gantert , Samuel G. G. Johnston , Joscha Prochno , Dominik Schmid

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

Geometric Topology · Mathematics 2026-03-10 E. Alkin , A. Miroshnikov , A. Skopenkov

We develop a tree method for multidimensional q-Hahn polynomials. We define them as eigenfunctions of a multidimensional q-difference operator and we use the factorization of this operator as a key tool. Then we define multidimensional…

Classical Analysis and ODEs · Mathematics 2013-04-12 Fabio Scarabotti

Given a map $\mathcal M$ on a connected and closed orientable surface, the delta-matroid of $\mathcal M$ is a combinatorial object associated to $\mathcal M$ which captures some topological information of the embedding. We explore how…

Combinatorics · Mathematics 2015-08-31 Goran Malić

We study a basis of the polynomial ring that we call forest polynomials. This family of polynomials is indexed by a combinatorial structure called indexed forests and permits several definitions, one of which involves flagged P-partitions.…

Combinatorics · Mathematics 2023-06-21 Philippe Nadeau , Vasu Tewari

We consider path ideals associated to special classes of posets such as tree posets and cycles. We express their property of being sequentially Cohen-Macaulay in terms of the underlying poset. Moreover, monomial ideals, which arise from the…

Commutative Algebra · Mathematics 2013-04-18 Martina Kubitzke , Anda Olteanu

We show how for every integer n one can explicitly construct n distinct plane quartics and one hyperelliptic curve over the complex numbers all of whose Jacobians are isomorphic to one another as abelian varieties without polarization. When…

Algebraic Geometry · Mathematics 2007-05-23 Everett W. Howe

We are interested in the asymptotics of random trees built by linear preferential attachment, also known in the literature as Barab\'asi-Albert trees or plane-oriented recursive trees. We first prove a conjecture of Bubeck, Mossel \& R\'acz…

Probability · Mathematics 2018-02-19 Nicolas Curien , Thomas Duquesne , Igor Kortchemski , Ioan Manolescu

Bernardi has given a general formula for the number of regions of a deformation of the braid arrangement as a signed sum over boxed trees. We prove that each set of boxed trees which share an underlying (rooted labeled plane) tree…

Combinatorics · Mathematics 2021-10-12 Ankit Bisain , Eric J. Hanson

We prove the equivalence between a relative bottleneck property and being quasi-isometric to a tree-graded space. As a consequence, we deduce that the quasi-trees of spaces defined axiomatically by Bestvina-Bromberg-Fujiwara are…

Metric Geometry · Mathematics 2017-01-26 David Hume

We consider the harmonic measure on a disconnected polynomial Julia set in terms of Brownian motion. We show that the harmonic measure of any connected component of such a Julia set is zero. Associated to the polynomial is a combinatorial…

Dynamical Systems · Mathematics 2007-05-23 Nathaniel D. Emerson

A Bely\u{\i} pair is a holomorphic map from a Riemann surface to $S^2$ with additional properties. A dessin d'enfants is a bipartite graph with additional structure. It is well know that there is a bijection between Bely\u{i} pairs and…

Algebraic Geometry · Mathematics 2009-09-30 Jonathan Fine

The precise analysis of the variance of the profile of a suffix tree has been a longstanding open problem. We analyze three regimes of the asymptotic growth of the variance of the profile of a suffix tree built from a randomly generated…

Data Structures and Algorithms · Computer Science 2016-05-16 Jeffrey Gaither , Mark Daniel Ward