Related papers: Free potential functions

Let $C$ be an affine plane curve. We consider additive functions $f: K\rightarrow K$ for which $f(x)f(y)=0$, whenever $(x,y)\in C$. We show that if $K=\mathbb{R}$ and $C$ is the hyperbola with defining equation $xy=1$, then there exist…

In this note we look at the freeness for complex affine hypersurfaces. If $X \subset \mathbb{C}^n$ is such a hypersurface, and $D$ denotes the associated projective hypersurface, obtained by taking the closure of $X$ in $\mathbb{P}^n$, then…

Let $(\mu_{\alpha})$ be a net of Radon sub-probability measures on the real line, and $(t_{\alpha})$ be a net in $]0,+\infty[$ converging to 0. Assuming that the generalized log-moment generating function $L(\lambda)$ exists for all…

This paper gives a simple presentation of the free star-autonomous category over a category, based on Eilenberg-Kelly-MacLane graphs and Trimble rewiring, yielding a full coherence theorem: the commutativity of diagrams of canonical maps is…

A triangle-free graph G is called k-existentially complete if for every induced k-vertex subgraph H of G, every extension of H to a (k+1)-vertex triangle-free graph can be realized by adding another vertex of G to H. Cherlin asked whether…

We say that a plane set $A$ is {\it graph-null,} if there is a function $g\colon [0,1] \to \mathbb{R}$ such that $\lambda_2 (A+{\rm graph}\, g)=0$. A plane set $A$ has the {\it translational Kakeya property} if, for every translated copy…

Let C be a smooth complex projective curve of genus at least 2 and let M be the moduli space of rank 2, stable vector bundles on C, with fixed determinant of degree 1. For any k>1, we find two irreducible components of the space of rational…

We define the principal divisor of a free noncommuatative function. We use these divisors to compare the determinantal singularity sets of free noncommutative functions. We show that the divisor of a noncommutative rational function is the…

Let $\mathcal{H}$ be a set of given connected graphs. A graph $G$ is said to be $\mathcal{H}$-free if $G$ contains no $H$ as an induced subgraph for any $H\in \mathcal{H}$. The graph $G$ is super-edge-connected if each minimum edge-cut…

A {\em fork} is a graph obtained from $K_{1,3}$ (usually called {\em claw}) by subdividing an edge once, an {\em antifork} is the complement graph of a fork, and a {\em co-cricket} is a union of $K_1$ and $K_4-e$. A graph is perfectly…

In this paper we introduce the concept of \emph{multivector functionals.} We study some possible kinds of derivative operators that can act in interesting ways on these objects such as, e.g., the $A$-directional derivative and the…

A graphic arrangement is a subarrangement of the braid arrangement whose set of hyperplanes is determined by an undirected graph. A classical result due to Stanley, Edelman and Reiner states that a graphic arrangement is free if and only if…

Given a two-variable function $f$ without critical points and a compact region $R$ bounded by two level curves of $f$, this note proves that the integral over $R$ of the second-order directional derivative of $f$ in the tangential…

We show that if $\mathcal{F}$ is an algebraically integrable foliation on a $\mathbb{Q}$-factorial normal projective variety $X$, $ A, B \geq 0$ are $\mathbb{Q}$-divisors on $X$ with $A$ ample such that $(\mathcal{F}, B)$ is foliated dlt…

Chv\'{a}tal conjectured in 1973 the existence of some constant $t$ such that all $t$-tough graphs with at least three vertices are hamiltonian. While the conjecture has been proven for some special classes of graphs, it remains open in…

Call a colouring of a graph \emph{distinguishing} if the only automorphism of this graph which preserves said colouring is the identity. Let $H$ be an arbitrary graph. We say that a graph $G$ is \emph{$H$-free} if $G$ does not contain an…

The Hamiltonicity and related subjects of split graphs, and in particular $K_{1,r}$-free split graphs with $r\ge 3$ received much attention. Dai et al. [Discrete Math. 345 (2022) 112826] conjectured that every $(r-1)$-connected…

Let k be an algebraically closed field of characteristic zero, D a locally nilpotent derivation on the polynomial ring k[X_1, X_2,X_3,X_4] and A the kernel of D. A question of M. Miyanishi asks whether projective modules over A are…

A graph K is square-free if it contains no four-cycle as a subgraph. A graph K is multiplicative if GxH -> K implies G -> K or H -> K, for all graphs G,H. Here GxH is the tensor (or categorical) graph product and G -> K denotes the…

A graph $G$ is free $(a,b)$-choosable if for any vertex $v$ with $b$ colors assigned and for any list of colors of size $a$ associated with each vertex $u\ne v$, the coloring can be completed by choosing for $u$ a subset of $b$ colors such…