Related papers: Chern classes of graph hypersurfaces and deletion-…
The purpose of this work is to provide details about the construction of the Chern character for categorical sheaves mentioned in our previous work "Chern character, loop spaces and derived algebraic geometry". For this, we introduce and…
We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and…
A recent result of Alon, Ben-Eliezer and Fischer establishes an induced removal lemma for ordered graphs. That is, if $F$ is an ordered graph and $\varepsilon>0$, then there exists $\delta_{F}(\varepsilon)>0$ such that every $n$-vertex…
Michael Gromov has recently initiated what he calls ``symbolic algebraic geometry", in which objects are proalgebraic varieties: a proalgebraic variety is by definition the projective limit of a projective system of algebraic varieties. In…
We introduce a correspondence principle (analogous to the Furstenberg correspondence principle) that allows one to extract an infinite random graph or hypergraph from a sequence of increasingly large deterministic graphs or hypergraphs. As…
Graph coarsening is a technique for solving large-scale graph problems by working on a smaller version of the original graph, and possibly interpolating the results back to the original graph. It has a long history in scientific computing…
We study fractional quantum Hall states with quasihole excitations, on Riemann surfaces of arbitrary genus. For configurations with $m$ quasiholes we construct a vector bundle above the $m$-th symmetric power of the curve so that the fiber…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
We construct a functor, from the category of schemes to the category of graded rings, that is an initial object for having a theory of Chern classes with an additive first Chern class. For any scheme $X$, the graded ring that our functor…
Given a finite set of $2$-edge-coloured graphs $\mathcal F$ and a hereditary property of graphs $\mathcal{P}$, we say that $\mathcal F$ expresses $\mathcal{P}$ if a graph $G$ has the property $\mathcal{P}$ if and only if it admits a…
In this paper, we develope an equivariant theory of Chern characters for coherent sheaves on compact complex manifolds with finite group actions, taking values in Bott-Chern cohomology classes. Furthermore, we establish the corresponding…
We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…
We prove an analogue of James-Donkin row removal theorems for arbitrary diagrammatic Cherednik algebras. This is one of the first results concerning the (graded) decomposition numbers of these algebras over fields of arbitrary…
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…
We construct a new class of topological surface defects in Chern-Simons theory with non-compact, non-Abelian gauge groups. These defects are characterized by isotropic subalgebras defined by solutions of the modified classical Yang-Baxter…
We study a class of generalized Chern-Simons equations on discrete lattice graphs. By an iterative scheme combined with an exhaustion argument, we establish the existence of topological solutions, which is also the maximal topological…
For a graph class $\mathcal{C}$, the $\mathcal{C}$-Edge-Deletion problem asks for a given graph $G$ to delete the minimum number of edges from $G$ in order to obtain a graph in $\mathcal{C}$. We study the $\mathcal{C}$-Edge-Deletion problem…
The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…
In this note we define Chern-Simons classes of a superconnection $D+L$ on a complex supervector bundle $E$ such that $D$ is flat and preserves the grading, and $L$ is an odd endomorphism of $E$ on a supermanifold. As an application we…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…