Related papers: Random planar trees and the Jacobian conjecture
We consider polynomial maps of affine space over an algebraically closed field of characteristic zero. We prove that every irreducible component of the zero locus of the Jacobian determinant corresponds to either a contracted divisor or a…
Invertible compositions of one-dimensional maps are studied which are assumed to include maps with non-positive Schwarzian derivative and others whose sum of distortions is bounded. If the assumptions of the Koebe principle hold, we show…
We study Jacobi matrices on trees with one end at inifinity. We show that the defect indices cannot be greater than 1 and give criteria for essential selfadjointness. We construct certain polynomials associated with matrices, which mimic…
The Jacobi polynomial has been advocated by many authors as a useful tool to evolve non-singlet structure functions to higher $Q^2$. In this work, it is found that the convergence of the polynomial sum is not absolute, as there is always a…
A $k$-plane tree is a plane tree whose vertices are assigned labels between $1$ and $k$ in such a way that the sum of the labels along any edge is no greater than $k+1$. These trees are known to be related to $(k+1)$-ary trees, and they are…
A polynomial map $F=(P,Q)\in \Z [x,y]^2$ with Jacobian $JF:=P_xQ_y-P_yQ_x\equiv 1$ has a polynomial inverse of integer coefficients if the complex plane curve P=0 has infinitely many integer points.
A celebrated result of Otter says the number of distinct unlabelled spanning trees in $K_n$ is $\alpha^n$ up to subexponential factors for an absolute constant $\alpha>0$. In this note, we prove that for every $0<\varepsilon<\alpha$, there…
The real Jacobian conjecture was posed by Randall in 1983. This conjecture asserts that if $F=\left(f_1,\ldots ,f_n\right):\mathbb{R}^n\rightarrow\mathbb{R}^n$ is a polynomial map such that $\det DF\left(\mathbf{x}\right)\neq0$ for all…
Many problems give rise to polynomial systems. These systems often have several parameters and we are interested to study how the solutions vary when we change the values for the parameters. Using predictor-corrector methods we track the…
Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli random variables. What can be said about the concentration of $f$ on any single value? This generalises the classical Littlewood--Offord problem,…
For a random matrix of entries sampled independently from a fairly general distribution in Z we study the probability that the cokernel is isomorphic to a given finite abelian group, or when it is cyclic. This includes the probability that…
We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…
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 hope to be able (in the future) to carefully analyze this structure and to tie the Jacobian Conjecture in dimension two to certain Zeta functions, thereby invoking a powerful arithmetic machinery to handle the two dimensional Jacobian…
In this paper, we discuss several additional properties a power linear Keller map may have. The Structural Conjecture by Druzkowski in [Dru] asserts that two such properties are equivalent, but we show that one of this properties is…
Since the 90's, several authors have studied a probability distribution on the set of Boolean functions on $n$ variables induced by some probability distributions on formulas built upon the connectors $And$ and $Or$ and the literals…
We prove that the Farrell-Jones isomorphism conjecture for non-connective algebraic K-theory for a discrete group G and a coefficient ring R holds true if G belongs to the class of groups acting on trees, under certain conditions on G (see…
The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we…
A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…
Using the description of hypermaps with matchings, Goulden and Jackson have given an expression of the generating series of rooted bipartite maps in terms of the zonal polynomials. We generalize this approach to the case of constellations…