Related papers: Topological classification of generic real rationa…

We first describe the local and global moduli spaces of germs of foliations defined by analytic functions in two variables with p transverse smooth branches, and with integral multiplicities (in the univalued holomorphic case) or complex…

We introduce the notion of a categorical join, which can be thought of as a categorification of the classical join of two projective varieties. This notion is in the spirit of homological projective duality, which categorifies classical…

For a cubic rational function with coefficients in a non-archimedean field $K$ whose residue characteristic is $0$ or greater than $3$, there are $2$ possibilities for the shape of its Berkovich ramification locus, considered as an…

We establish the equivalence of three notions of $\mathbb{F}_q$-rational points on weighted projective spaces $\mathbb{P}_{\mathbf{w}}^n$ and derive explicit combinatorial formulas for their enumeration, leveraging Burnside's lemma and gcd…

We define a very general class of rational functions f:CP^1 --> CP^1 such that for every function f of this class, there exists a countable family of smooth curves \gamma_i and a critically finite hyperbolic function R such that the…

We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…

We already saw in [A1] that the space of dynamically marked rational maps can be identified to a subspace of the space of covers between trees of spheres on which there is a notion of convergence that makes it sequentially compact. In the…

We extend the scope of analytic combinatorics to classes containing objects that have irrational sizes. The generating function for such a class is a power series that admits irrational exponents (which we call a Ribenboim series). A…

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common subtrees are factored and shared, keeping only one copy of…

We study the minimal number of ramified primes in Galois extensions of rational function fields over finite fields with prescribed finite Galois group. In particular, we obtain a general conjecture in analogy with the well studied case of…

Tiered trees were introduced as a combinatorial object for counting absolutely indecomposable representation of certain quivers and torus orbit of certain homogeneous variety. In this paper, we define a bijection between the set of…

The aim of this paper is to prove that a large class of quaternionic slice regular functions result to be (ramified) covering maps. By means of the topological implications of this fact and by providing further topological structures, we…

We begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…

Using the functor of Baumslag rationalization of groups we construct a functor on the category of all (non necessarily simply connected) spaces that extends the classical rationalization of simply connected spaces. We study this functor and…

Random forests are decision tree ensembles that can be used to solve a variety of machine learning problems. However, as the number of trees and their individual size can be large, their decision making process is often incomprehensible. In…

We introduce an object called a tree growing sequence (TGS) in an effort to generalize bijective correspondences between $G$-parking functions, spanning trees, and the set of monomials in the Tutte polynomial of a graph $G$. A tree growing…

We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…

The Catalan numbers constitute one of the most important sequences in combinatorics. Catalan objects have been generalized in various directions, including the classical Fuss-Catalan objects and the rational Catalan generalization of…

Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…