相关论文: A Combinatorial Classification of Postsingularly F…
We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…
From Smyth's classification, modular compactifications of pointed smooth rational curves are indexed by combinatorial data, so-called extremal assignments. We explore their combinatorial structures and show that any extremal assignment is a…
We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.
We extend the concept of a Hubbard tree, well established and useful in the theory of polynomial dynamics, to the dynamics of transcendental entire functions. We show that Hubbard trees in the strict traditional sense, as invariant compact…
A transcendental entire function is called criniferous if every point in its escaping set can eventually be connected to infinity by a curve of escaping points. Many transcendental entire functions with bounded singular set have this…
We give a complete classification of the set of parameters $\kappa$ for which the singular value of $E_{\kappa}:z\mapsto \exp(z)+\kappa$ escapes to infinity under iteration. In particular, we show that every path-connected component of this…
We develop an abstract model for the dynamics of an exponential map $z\mapsto \exp(z)+\kappa$ on its set of escaping points and, as an analog of Boettcher's theorem for polynomials, show that every exponential map is conjugate, on a…
By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike…
The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining…
We extend Thurston's combinatorial criterion for postcritically finite rational maps to a class of rational maps with bounded type Siegel disks. The combinatorial characterization of this class of Siegel rational maps plays a special role…
This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…
The dynamical classification of rational maps is a central concern of holomorphic dynamics. Much progress has been made, especially on the classification of polynomials and some approachable one-parameter families of rational maps; the goal…
We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…
We consider complex polynomials $f(z) = z^\ell+c_1$ for $\ell \in 2\N$ and $c_1 \in \R$, and find some combinatorial types and values of $\ell$ such that there is no invariant probability measure equivalent to conformal measure on the Julia…
Given a polynomial map $f:\Bbb C^{n+1}\to\Bbb C$, one can attach to it a geometrical variation of mixed Hodge structures (MHS) which gives rise to a limit MHS. The equivariant Hodge numbers of this MHS are analytical invariants of the…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…
We study the postcritically-finite (PCF) maps in the moduli space of complex polynomials $\mathrm{MP}_d$. For a certain class of rational curves $C$ in $\mathrm{MP}_d$, we characterize the condition that $C$ contains infinitely many PCF…
This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…
This paper introduces iterated monodromy groups for transcendental functions and discusses them in the simplest setting, for post-singularly finite exponential functions. These groups are self-similar groups in a natural way, based on an…