Related papers: Adjoint divisors and free divisors
We find explicit free resolutions for the $\scr D$-modules ${\scr D} f^s$ and ${\scr D}[s] f^s/{\scr D}[s] f^{s+1}$, where $f$ is a reduced equation of a locally quasi-homogeneous free divisor. These results are based on the fact that every…
We extend the notion of a tame covering of a pair (X,D) where X is a regular scheme and D is a normal crossing divisor (cf. SGA1), to pairs (X,Y) where X is an arbitrary scheme and Y is a closed subset in X. We show that the abelianized…
Motivated by a conjecture of Xiao, we study supporting divisors of fibred surfaces. On the one hand, after developing a formalism to treat one-dimensional families of varieties of any dimension, we give a structure theorem for fibred…
Let $R$ be a ring with unity. The cozero-divisor graph of a ring $R$ is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of $R$ and two distinct vertices $x$ and $y$ are adjacent if and only if $x…
We introduce a dual logarithmic residue map for hypersurface singularities and use it to answer a question of Kyoji Saito. Our result extends a theorem of L\^e and Saito by an algebraic characterization of hypersurfaces that are normal…
In this paper we study the stochastic homogenisation of free-discontinuity functionals. Assuming stationarity for the random volume and surface integrands, we prove the existence of a homogenised random free-discontinuity functional, which…
In this paper we introduce the notion of cofrontal mappings, as the dual objects to frontal mappings, and study their basic local and global properties. Cofrontals are very special mappings and far from generic nor stable except for the…
We consider graphs on monomials in $n$ variables of a fixed degree $d$ where two monomials are adjacent if and only if their least common multiple has degree $d+1$. We prove that when $n = 3$ and $d$ is divisible by $3$ as well as when…
Let $X$ be a non-empty set of positive integers and $X^*=X\setminus \{1\}$. The divisibility graph $D(X)$ has $X^*$ as the vertex set and there is an edge connecting $a$ and $b$ with $a, b\in X^*$ whenever $a$ divides $b$ or $b$ divides…
A classical result due to Deshouillers, Dress and Tenenbaum asserts that on average the distribution of the divisors of the integers follows the arcsine law. In this paper, we investigate the distribution of smooth divisors of the integers,…
A connected dominating set (CDS) in a graph is a dominating set of vertices that induces a connected subgraph. Having many disjoint CDSs in a graph can be considered as a measure of its connectivity, and has various graph-theoretic and…
We describe the behaviour of a free reduced plane projective curve with respect to the deletion, respectively addition, of a smooth conic. These results apply in particular to conic-line arrangements. We present some obstructions to the…
We explore a natural extension of braid arrangements in the context of determinantal arrangements. We show that these determinantal arrangements are free divisors. Additionally, we prove that free determinantal arrangements defined by the…
A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…
Let $A$ and $B$ be disjoint, non-adjacent vertex-sets in an undirected, connected graph $G$, whose vertices are associated with positive weights. We address the problem of identifying a minimum-weight subset of vertices $S\subseteq V(G)$…
We introduce the jet schemes of a holomorphic foliation, and thereby prove an alternate characterisation of simple singularities of codimension-$1$ foliations, independent of any normal form. This leads to an equivalent condition for the…
Pair-collision between viscous drops in a confined shear is numerically simulated to show that the confinement drastically alters the trajectories of the drops. In contrast to free shear, drops here move towards the centerline giving rise…
We give an efficient algorithm that, given a graph $G$ and a partition $V_1,\ldots,V_m$ of its vertex set, finds either an independent transversal (an independent set $\{v_1,\ldots,v_m\}$ in $G$ such that $v_i\in V_i$ for each $i$), or a…
We give necessary and sufficient conditions under which the Jacobian of a graph is generated by a divisor that is the difference of two vertices. This answers a question posed by Becker and Glass and allows us to prove various other…
Starting from the De Witt supermetric and limiting ourselves to a family of geometries characterized by a finite number of geometric invariants we extract the unique integration measure. Such a measure turns out to be a geometric invariant,…