Related papers: On postcritically finite polynomials, part 2: Hubb…
We study a class of weakly coupled systems of Hamilton{Jacobi equations at the critical level. We associate to it a family of scalar discounted equation. Using control{theoretic tech- niques we construct an algorithm which allows obtaining…
We use multivariate total positivity theory to exhibit new families of peacocks. As the authors of \cite{HPRY}, our guiding example is the result of Carr-Ewald-Xiao \cite{CEX}. We shall introduce the notion of strong conditional…
Probabilistic circuits compute multilinear polynomials that represent multivariate probability distributions. They are tractable models that support efficient marginal inference. However, various polynomial semantics have been considered in…
The automaton constrained tree knapsack problem is a variant of the knapsack problem in which the items are associated with the vertices of the tree, and we can select a subset of items that is accepted by a top-down tree automaton. If the…
Motivated by the properties of the descent polynomials, which enumerate permutations of $S_n$ with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials…
The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…
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.…
Motivated by the work of Boston, Jones and Goksel, we propose a Markov model for the factorisation of post-critically finite (PCF) cubic polynomials f. Using the information encoded in the critical orbits, we define a Markov model for PCF…
We prove that core entropy is H\"older continuous as a function of external angles for a large class of quadratic polynomials that are non-recurrent with respect to angle-doubling, in particular all of them that exhibit a finite Hubbard…
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…
This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of these groups. Properties studied by this technique will include…
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…
We establish that every formal critical portrait (as defined by Goldberg and Milnor), can be realized by a postcritically finite polynomial.
Finite groups with given systems of permuteral and strongly permuteral subgroups are studied. New characterizations of w-supersoluble and supersoluble groups are received.
An overview of the basic results on Macdonald(-Koornwinder) polynomials and double affine Hecke algebras is given. We develop the theory in such a way that it naturally encompasses all known cases. Among the basic properties of the…
A persistent dynamical system in $\mathbb{R}^d_{> 0}$ is one whose solutions have positive lower bounds for large $t$, while a permanent dynamical system in $\mathbb{R}^d_{> 0}$ is one whose solutions have uniform upper and lower bounds for…
Decision tree learning is a widely used approach in machine learning, favoured in applications that require concise and interpretable models. Heuristic methods are traditionally used to quickly produce models with reasonably high accuracy.…
The method of subquotients is developed and used to determine all finite dimensional rank 2 Nichols algebras of diagonal type over an arbitrary field of characteristic zero. Key Words: Hopf algebra, Nichols algebra
This is a survey on the state-of-the-art of the classification of finite-dimensional complex Hopf algebras. This general question is addressed through the consideration of different classes of such Hopf algebras. Pointed Hopf algebras…
A conceptual model for microscopic-macroscopic slow-fast stochastic systems is considered. A dynamical reduction procedure is presented in order to extract effective dynamics for this kind of systems. Under appropriate assumptions, the…