Related papers: The planar Chain Rule and the Differential Equatio…
A planar tree power series over a field $K$ is a formal expression $$\sum c_T \cdot T$$ where the sum is extended over all isomorphism classes of finite planar reduced rooted trees $T$ and where the coefficients $c_T$ are in $K$.…
Planar functions are mappings from a finite field $\mathbb{F}_q$ to itself with an extremal differential property. Such functions give rise to finite projective planes and other combinatorial objects. There is a subtle difference between…
Let $X$ be a perfect, compact subset of the complex plane, and let $D^{(1)}(X)$ denote the (complex) algebra of continuously complex-differentiable functions on $X$. Then $D^{(1)}(X)$ is a normed algebra of functions but, in some cases,…
The notion of binomial coefficients $T \choose S$ of finite planar, reduced rooted trees $T, S$ is defined and a recursive formula for its computation is shown. The nonassociative binomial formula $$(1 + x)^T = \displaystyle \sum_S {T…
Planar commutative n-complex numbers of the form u=x_0+h_1x_1+h_2x_2+...+h_{n-1}x_{n-1} are introduced in an even number n of dimensions, the variables x_0,...,x_{n-1} being real numbers. The planar n-complex numbers can be described by the…
We study the problem of characterizing polynomial vector fields that commute with a given polynomial vector field on a plane. It is a classical result that one can write down solution formulas for an ODE that corresponds to a planar vector…
Planar functions are special functions from a finite field to itself that give rise to finite projective planes and other combinatorial objects. We consider polynomials over a finite field $K$ that induce planar functions on infinitely many…
The multidimensional chain rule formula for analytic functions and its generalisation to higher derivatives perfectly work in the algebraic setting in characteristic zero. In positive characteristic one runs into problems due to…
Our purpose in this paper is to study when a planar differential system polynomial in one variable linearizes in the sense that it has an inverse integrating factor which can be constructed by means of the solutions of linear differential…
Classical planar functions are functions from a finite field to itself and give rise to finite projective planes. They exist however only for fields of odd characteristic. We study their natural counterparts in characteristic two, which we…
A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no…
Let $X$ be a normal complex projective variety, $T\subseteq X$ a subvariety, $a\colon X\rightarrow A$ a morphism to an abelian variety such that $\rm{Pic}^0(A)$ injects into $\rm{Pic}^0(T)$ and let $L$ be a line bundle on $X$. Denote by…
The canonical sylvan resolution is a resolution of an arbitrary monomial ideal over a polynomial ring that is minimal and has an explicit combinatorial formula for the differential. The differential is a weighted sum over lattice paths of…
We generalize an example, due to Sylvester, and prove that any monomial of degree $d$ in $\mathbb R[x_0, x_1]$, which is not a power of a variable, cannot be written as a linear combination of fewer than $d$ powers of linear forms.
A rooted phylogenetic network is a directed acyclic graph with a single root, whose sinks correspond to a set of species. As such networks are useful for representing the evolution of species that have undergone reticulate evolution, there…
Many modern numerical methods in computational science and engineering rely on derivatives of mathematical models for the phenomena under investigation. The computation of these derivatives often represents the bottleneck in terms of…
Dujmovi\'c et al. [\emph{J.~ACM}~'20] recently proved that every planar graph is isomorphic to a subgraph of the strong product of a bounded treewidth graph and a path. Analogous results were obtained for graphs of bounded Euler genus or…
The monopole-dimer model is a signed variant of the monomer-dimer model which has determinantal structure. We extend the monopole-dimer model for planar graphs (Math. Phys. Anal. Geom., 2015) to Cartesian products thereof and show that the…
A method is proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example the generalized quantum plane is studied. It is found that there is a strong correlation, but not a…
The simple product formulae for derivatives of scalar functions raised to different powers are generalized for functions which take values in the set of symmetric positive definite matrices. These formulae are fundamental in derivation of…