Related papers: Chern classes of graph hypersurfaces and deletion-…

Let $G$ be a group of permutations acting on an $n$-vertex set $V$, and $X$ and $Y$ be two simple graphs on $V$. We say that $X$ and $Y$ are $G$-isomorphic if $Y$ belongs to the orbit of $X$ under the action of $G$. One can naturally…

Graph neural networks (GNNs) are a popular class of machine learning models whose major advantage is their ability to incorporate a sparse and discrete dependency structure between data points. Unfortunately, GNNs can only be used when such…

We introduce Chern degree functions for complexes of coherent sheaves on a polarized surface, which encode information given by stability conditions on the boundary of the $(\alpha, \beta)$-plane. We prove that these functions extend to…

We study limiting lines on degenerations of generic hypersurfaces in $P^n$.

In this paper, we show how to discretize the abelian Chern-Simons gauge theory on generic planar lattices/graphs (with or without translational symmetries) embedded in arbitrary 2D closed orientable manifolds. We find that, as long as a…

The classical Chern correspondence states that a choice of Hermitian metric on a holomorphic vector bundle determines uniquely a unitary 'Chern connection'. This basic principle in Hermitian geometry, later generalized to the theory of…

Spectral Graph Convolutional Networks (GCNs) are a generalization of convolutional networks to learning on graph-structured data. Applications of spectral GCNs have been successful, but limited to a few problems where the graph is fixed,…

For a graph class $\mathcal{F}$, let $ex_{\mathcal{F}}(n)$ denote the maximum number of edges in a graph in $\mathcal{F}$ on $n$ vertices. We show that for every proper minor-closed graph class $\mathcal{F}$ the function…

Topological invariants such as Chern classes are by now a standard way to classify topological phases. Introducing and varying parameters in such systems leads to phase diagrams, where the Chern classes may jump when crossing a critical…

We use the Stein-Chen method to obtain compound Poisson approximations for the distribution of the number of subgraphs in a generalised stochastic block model which are isomorphic to some fixed graph. This model generalises the classical…

The goal of this paper is to study the Chern classes of coherent sheaves (and more generally perfect complexes) that admit crystal structures in the setting of crystalline cohomology and more generally relative prismatic cohomology. In the…

A fundamental goal of algebraic geometry is to do for singular varieties whatever we can do for smooth ones. Intersection homology, for example, directly produces groups associated to any variety which have almost all the properties of the…

We construct two types of multi-layer quantum graphs (Schr\"odinger operators on metric graphs) for which the dispersion function of wave vector and energy is proved to be a polynomial in the dispersion function of the single layer. This…

Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…

We construct a Chern character map from the K-theory of the reduced C^* algebra of the p-adic GL(n) with values in the periodic cyclic homology of the Schwartz algebra of this group. We prove that this map is an isomorphism after tensoring…

We show that the Chern-Schwartz-MacPherson class of a hypersurface X in a nonsingular variety M `interpolates' between two other notions of characteristic classes for singular varieties, provided that the singular locus of X is smooth and…

For a graph class ${\cal H}$, the graph parameters elimination distance to ${\cal H}$ (denoted by ${\bf ed}_{\cal H}$) [Bulian and Dawar, Algorithmica, 2016], and ${\cal H}$-treewidth (denoted by ${\bf tw}_{\cal H}$) [Eiben et al. JCSS,…

The line graph of a graph $G$ is the graph $L(G)$ whose vertex set is the edge set of $G$ and there is an edge between $e,f\in E(G)$ if $e$ and $f$ share an endpoint in $G$. A graph is called line graph if it is a line graph of some graph.…

The subring of the Grothendieck ring of varieties generated by the graph hypersurfaces of quantum field theory maps to the monoid ring of stable birational equivalence classes of varieties. We show that the image of this map is the copy of…

Nowhere dense classes of graphs are very general classes of uniformly sparse graphs with several seemingly unrelated characterisations. From an algorithmic perspective, a characterisation of these classes in terms of uniform quasi-wideness,…