Related papers: Free potential functions
Noncommutative functions are graded functions between sets of square matrices of all sizes over two vector spaces that respect direct sums and similarities. They possess very strong regularity properties (reminiscent of the regularity…
To formulate our results let $f$ be a continuous map from $\mathbb R^n$ to $2^{\mathbb R^n}$ and $k$ a natural number such that $|f(x)|\leq k$ for all $x$. We prove that $f$ is fixed-point free if and only if its continuous extension…
A graph is $H$-free if it does not contain $H$ as a subgraph. The diamond graph is the graph obtained from $K_4$ by deleting one edge. We prove that if $G$ is a connected graph with order $n\geq 10$, then there exists a subset $S\subseteq…
For a graph $G$ and a set of graphs $\mathcal{H}$, we say that $G$ is {\em $\mathcal{H}$-free} if no induced subgraph of $G$ is isomorphic to a member of $\mathcal{H}$. Given an integer $P>0$, a graph $G$, and a set of graphs $\mathcal{F}$,…
Let $R$ be an integral domain of characteristic zero. We prove that a function $D\colon R\to R$ is a derivation of order $n$ if and only if $D$ belongs to the closure of the set of differential operators of degree $n$ in the product…
In this paper infinite families of examples of irreducible free and nearly free curves in the complex projective plane which are not rational curves and whose local singularites can have an arbitrary number of branches are given. All these…
In a digraph $D$, an arc $e=(x,y) $ in $D$ is considered transitive if there is a path from $x$ to $y$ in $D- e$. A digraph is transitive-free if it does not contain any transitive arc. In the Transitive-free Vertex Deletion (TVD) problem,…
Given a family of graphs $\mathcal{H}$, a graph $G$ is $\mathcal{H}$-free if any subset of $V(G)$ does not induce a subgraph of $G$ that is isomorphic to any graph in $\mathcal{H}$. We present sufficient and necessary conditions for a graph…
We study the free path problem, i.e., if we are given two free arrangements of hyperplanes, then we can connect them by free arrangements or not. We prove that if an arrangement $\mathcal{A}$ and $\mathcal{A} \setminus \{H,L\}$ are free,…
Let $X$ be a germ of real analytic vector field at $({\mathbb R}^{2},0)$ with an algebracally isolated singularity. We say that $X$ is a topological generalized curve if there are no topological saddle-nodes in its reduction of…
A hole is a chordless cycle with at least four vertices. A hole is odd if it has an odd number of vertices. A dart is a graph which vertices $a, b, c, d, e$ and edges $ab, bc, bd, be, cd, de$. Dart-free graphs have been actively studied in…
If $C$ is a curve over $\mathbb{Q}$ with genus at least $2$ and $C(\mathbb{Q})$ is empty, then the class of fields $K$ of characteristic 0 such that $C(K) = \varnothing$ has a model companion, which we call $C\mathrm{XF}$. The theory…
In this paper, the technique of foliations in characteristic $p$ is used to investigate the difference between rational connectedness and separable rational connectedness in positive characteristic. The notion of being freely rationally…
The necessary and sufficient conditions for a function to be totally or partially separable are derived. It is shown that a function is totally separable if and only if each component of the gradient vector of depends only on the…
Let $t>0$ be a real number and $G$ be a graph. We say $G$ is $t$-tough if for every cutset $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. The Toughness Conjecture of Chv\'atal, stating that there exists…
A free differential for an arbitrary associative algebra is defined as a differential with a uniqueness property. The existence problem for such a differential is posed. The notion of optimal calculi for given commutation rules is…
"Theorems for Free!" (Wadler, FPCA 1989) is a slogan for a technique that allows to derive statements about functions just from their types. So far, the statements considered have always had a purely extensional flavor: statements relating…
In this paper we prove that if S is a smooth, irreducible, projective, rational, complex surface and D an effective, connected, reduced divisor on S, then the pair (S,D) is contractible if the log-Kodaira dimension of the pair is $-\infty$.…
We study the free product of rooted graphs and its various decompositions using quantum probabilistic methods. We show that the free product of rooted graphs is canonically associated with free independence, which completes the proof of the…
This article, which is substantially motivated by the previous joint work with J. McKay [8], establishes the analytic analogues of the relations we found free probability has with Witt vectors. Therefore, we first present a novel analytic…