Related papers: Free potential functions
Given a graph $G=(V,E)$ whose vertices have been properly coloured, we say that a path in $G$ is "colourful" if no two vertices in the path have the same colour. It is a corollary of the Gallai-Roy-Vitaver Theorem that every properly…
An edge-colored graph $G$ is conflict-free connected if any two of its vertices are connected by a path, which contains a color used on exactly one of its edges. The conflict-free connection number of a connected graph $G$, denoted by…
Free noncommutative fields constitute a natural and interesting example of constrained theories with higher derivatives. The quantization methods involving constraints in the higher derivative formalism can be nicely applied to these…
For an extension $K/\mathbb{F}_q(T)$ of the rational function field over a finite field, we introduce the notion of virtually $K$-rational Drinfeld modules as a function field analogue of $\mathbb{Q}$-curves. Our goal in this article is to…
We study the space of derivations for some finite-dimensional evolution algebras, depending on the twin partition of an associated directed graph. For evolution algebras with a twin-free associated graph we prove that the space of…
In this paper we develop a theory of free holomorphic functions on noncommutative Reinhardt domains generated by positive regular free holomorphic functions in n noncommuting variables. We show that the free biholomorphic classification of…
In this paper, we provide a model-independent extension of the paradigm of dynamic hedging of derivative claims. We relate model-independent replication strategies to local martingales having a closed form which we can characterise via…
We prove that the \emph{standard zero forcing number} $Z(G)$ and the \emph{positive semidefinite zero forcing number} $Z_+(G)$ are equal for all claw-free graphs $G$. This result resolves a conjecture proposed by the computer program…
Probabilistic independence can dramatically simplify the task of eliciting, representing, and computing with probabilities in large domains. A key technique in achieving these benefits is the idea of graphical modeling. We survey existing…
Cuntz and K\"uhne introduced the class of connected subgraph arrangements $A_G$, depending on a graph $G$, and classified all graphs $G$ such that the corresponding arrangement $A_G$ is free. We extend their result to the multiarrangement…
Free independence is an important tool for studying the structure of operator algebras. It is natural to ask from the model-theoretic standpoint whether free independence is captured well in first-order model theory via the notion of a…
It is well known that when a pair of random variables is statistically independent, it has no-correlation (zero covariance, $E[XY] - E[X]E[Y] = 0$), and that the converse is not true. However, if both of these random variables take only two…
This article shows a very elementary and straightforward proof of the Implicit Function Theorem for differentiable maps $F(x,y)$ defined on a finite-dimensional Euclidean space. There are no hypothesis on the continuity of the partial…
Let $V$ be a finite graph and let $\phi:V\rightarrow V$ be an irreducible train track map whose mapping torus has word-hyperbolic fundamental group $G$. Then $G$ acts freely and cocompactly on a CAT(0) cube complex.
A proper conflict-free colouring of a graph is a colouring of the vertices such that any two adjacent vertices receive different colours, and for every non-isolated vertex $v$, some colour appears exactly once on the neighbourhood of $v$.…
Cartan-Thullen theorem is a basic one in the theory of analytic functions of several complex variables. It states that for any open set $U$ of ${\mathbb C}^k$, the following conditions are equivalent: (a) $U$ is a domain of existence, (b)…
The $3$-colorability problem is a well-known NP-complete problem and it remains NP-complete for $bull$-free graphs, where a $bull$ is the graph consisting of a $K_3$ with two pendant edges attached to two of its vertices. In this paper, for…
Let $R$ be a real smooth affine domain of dimension $3$ such that $R$ has either no real maximal ideals or the intersection of all real maximal ideals in $R$ has height at least $1$. Then we prove that all stably free $R$-modules of rank…
Fix $d\geq 2$. Given a finite undirected graph ${\mathcal{H}}$ without self-loops and multiple edges, consider the corresponding `vertex' shift, $Hom(\mathbb{Z}^d, \mathcal{H})$ denoted by $X_{\mathcal{H}}$. In this paper we focus on…
A classical vertex Ramsey result due to Ne\v{s}et\v{r}il and R\"odl states that given a finite family of graphs $\mathcal{F}$, a graph $A$ and a positive integer $r$, if every graph $B\in\mathcal{F}$ has a $2$-vertex-connected subgraph…