Searcharxiv⌕ Search

arXiv subjects

Zsolt Patakfalvi

Publications and source records attributed to Zsolt Patakfalvi.

40 records · Page 3Linked to original sources

Base change behavior of the relative canonical sheaf related to higher dimensional moduli

We show that the compatibility of the relative canonical sheaf with base change fails generally in families of normal varieties. Furthermore, it always fails if the general fiber of a family of pure dimension n is Cohen-Macaulay and the special fiber contains a strictly S_{n-1} point. In particular, in moduli spaces with functorial relative canonical sheaves Cohen-Macaulay schemes can not degenerate to S_{n-1} schemes. Another, less immediate consequence is that the canonical sheaf of an S_{n-1}, G_2 scheme of pure dimension n is not S_3.

math.AG↗

Viehweg's hyperbolicity conjecture is true over compact bases

We prove Viehweg's hyperbolicity conjecture over compact bases and over bases with non-uniruled compactification. The most general case of the conjecture states that the the base space of a maximal variation family of smooth projective manifolds with semi-ample canonical sheaf is of log-general type.

math.AG↗

The incidence class and the hierarchy of orbits

R. Rimányi defined the incidence class of two singularities X and Y as $[X]|_Y$, the restriction of the Thom polynomial of X to Y. He conjectured that (under mild conditions) the incidence is not zero if and only if Y is in the closure of X. Generalizing this notion we define the incidence class of two orbits X and Y of a representation. We give a sufficient condition (positivity) for Y to have the property that the incidence class $[X]|_Y$ is not zero if and only if Y is in the closure of X for any other orbit X. We show that for many interesting cases, e.g. the quiver representations of Dynkin type positivity holds for all orbits. In other words in these cases the incidence classes completely determine the hierarchy of the orbits. We also study the case of singularities where positivity doesn't hold for all orbits.

math.AG↗

Line-graphs of cubic graphs are normal

A graph is called normal if its vertex set can be covered by cliques and also by stable sets, such that every such clique and stable set have non-empty intersection. This notion is due to Korner, who introduced the class of normal graphs as an extension of the class of perfect graphs. Normality has also relevance in information theory. Here we prove, that the line graphs of cubic graphs are normal.

math.CO↗