Related papers: Free potential functions

Applicative functors are a generalisation of monads. Both allow the expression of effectful computations into an otherwise pure language, like Haskell. Applicative functors are to be preferred to monads when the structure of a computation…

An irreducible element of a commutative ring is absolutely irreducible if no power of it has more than one (essentially different) factorization into irreducibles. In the case of the ring $\text{Int}(D)=\{f\in K[x]\mid f(D)\subseteq D\}$,…

Let X be a geometrically rational (or more generally, separably rationally connected) variety over a finite field K. We prove that if K is large enough then X contains many rational curves defined over K. As a consequence we prove that…

The vector potential is a fundamental concept widely applied across various fields. This paper presents an existence theorem of a vector potential for divergence-free functions in $W^{m,p}(\mathbb{R}^N,\mathbb{T})$ with general $m,p,N$.…

In this paper we identify different classes of free group extension using core graphs. We show that every free group extension $H\leq K\leq F$ has a base $B$ such that the associated pointed graph morphism…

Generalising the Heilman-Lieb Theorem from statistical physics, Chudnovsky and Seymour [J. Combin. Theory Ser. B, 97(3):350--357] showed that the univariate independence polynomial of any claw-free graph has all of its zeros on the negative…

Without the axiom of choice, the free exact completion of the category of sets (i.e. the category of setoids) may not be complete or cocomplete. We will show that nevertheless, it can be enhanced to a derivator: the formal structure of…

Free theorems are a popular tool in reasoning about parametrically polymorphic code. They are also of instructive use in teaching. Their derivation, though, can be tedious, as it involves unfolding a lot of definitions, then hoping to be…

We prove that the equational theory of the positive calculus of relations with transitive closure (PCoR*) is EXPSPACE-complete. Here, PCoR* terms consist of the following standard operators on binary relations: identity, empty,…

A graph $G$ is $H$-free if any subset of $V(G)$ does not induce a subgraph of $G$ that is isomorphic to $H$. Given a graph $H$, we present sufficient and necessary conditions for a graph $G$ such that $G/e$ is $H$-free for any edge $e$ in…

We study the relationship between free curves and periodic points for torus homeomorphisms in the homotopy class of the identity. By free curve we mean a homotopically nontrivial simple closed curve that is disjoint from its image. We prove…

In this work, we investigate the system formed by the equations $\text{div } \vec w=g_0$ and $\text{curl } \vec w=\vec g$ in bounded star-shaped domains of $\mathbb{R}^3$. A Helmholtz-type decomposition theorem is established based on a…

A proof is reconstructed for a useful theorem on the zeros of derivatives of analytic functions due to H. M. Macdonald, which appears to be now little known. The Theorem states that, if a function $f(z)$ is analytic inside a bounded region…

Let $(X,\Delta)$ be a proper dlt pair and $L$ a nef Cartier divisor such that $aL-(K_X+\Delta)$ is nef and log big on $(X,\Delta)$ for some $a\in {\mathbb Z}_{>0}$. Then $|mL|$ is base point free for every $m\gg 0$.

Let X be a smooth projective variety defined over an algebraically closed field, and let Y in X be a reduced and irreducible ample divisor in X. We give a numerical sufficient condition for a base point free pencil on $Y$ to be the…

A mathematically correct description is presented on the interrelations between the dynamics of divergence free vector fields on an oriented 3-dimensional manifold $M$ and the dynamics of Hamiltonian systems. It is shown that for a given…

As an extension of the Brooks theorem, Catlin in 1979 showed that if $H$ is neither an odd cycle nor a complete graph with maximum degree $\Delta(H)$, then $H$ has a vertex $\Delta(H)$-coloring such that one of the color classes is a…

Given two graphs $H_1$ and $H_2$, a graph is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ nor $H_2$. A graph $G$ is $k$-vertex-critical if every proper induced subgraph of $G$ has chromatic number less than $k$,…

Motivated by extending the functional stochastic calculus, to important functionals to which it does not apply, a notion of functional derivative along a curve is introduced. This new setting is developed by incorporating path-dependent…

In this research, we determine the structure of (claw, bull)-free graphs. We show that every connected (claw, bull)-free graph is either an expansion of a path, an expansion of a cycle, or the complement of a triangle-free graph; where an…