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

We prove a strong relation between Chern and log Chern invariants of algebraic surfaces. For a given arrangement of curves, we find nonsingular projective surfaces with Chern ratio arbitrarily close to the log Chern ratio of the log surface…

The existence of bivariant Chern classes was conjectured by W.Fulton and R.MacPherson and proved by J.P.Brasselet for cellular morphisms of analytic varieties. In this paper we show that restricted to morphisms whose target varieties are…

We give a new formula for the Chern-Schwartz-MacPherson class of a hypersurface in a nonsigular compact complex analytic variety. In particular this formula generalizes our previous result on the Euler characteristic of such a hypersurface.…

Feynman diagrams in $\phi^4$ theory have as their underlying structure 4-regular graphs. In particular, any 4-point $\phi^4$ graph can be uniquely derived from a 4-regular graph by deleting a vertex. The Feynman period is a simplified…

We study the action of the mapping class group of an oriented genus g surface with n punctures and a disc removed on a Poisson algebra which arises in the combinatorial description of Chern-Simons gauge theory when the gauge group is a…

Graph-modification problems, where we modify a graph by adding or deleting vertices or edges or contracting edges to obtain a graph in a {\it simpler} class, is a well-studied optimization problem in all algorithmic paradigms including…

We investigate Feynman graphs and their Feynman rules from the viewpoint of graph complexes. We focus on graph homology and on the appearance of cubical complexes when either reducing internal edges or when removing them by putting them on…

Averbouch, Godlin and Makowsky define the edge elimination polynomial of a graph by a recurrence relation with respect to the deletion, contraction and extraction of an edge. It generalizes some well-known graph polynomials such as the…

Let $F$ be a graph which contains an edge whose deletion reduces its chromatic number. For such a graph $F,$ a classical result of Simonovits from 1966 shows that every graph on $n\ge n_0(F)$ vertices with more than…

A hypergraph is said to be $1$-Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of $1$-Sperner hypergraphs and their structure to graphs. In particular, we…

In this article, we investigate an axiomatic approach introduced by Grivaux for the study of rational Bott-Chern cohomology, and use it in that context to define Chern classes of coherent sheaves. This method also allows us to derive a…

We describe two constructions giving rise to curved $A_{\infty}$-algebras. The first consists of deforming $A_{\infty}$-algebras, while the second involves transferring curved dg structures that are deformations of (ordinary) dg structures…

Using similarities between topological $K$-theory and periodic cyclic homology we show that, after tensoring with $\mathbb C$, for certain Fr\'echet algebras the Chern character provides an isomorphism between these functors. This is…

In this note we will review the most important results and questions related to Chern conjecture and isoparametric hypersurfaces, as well as their interactions and applications to various aspects in mathematics.

We define a new type of vertex coloring which generalizes vertex coloring in graphs, hypergraphs, and simplicial complexes. This coloring also generalizes oriented coloring, acyclic coloring, and star coloring. There is an associated…

The graph removal lemma is a fundamental result in extremal graph theory which says that for every fixed graph $H$ and $\varepsilon > 0$, if an $n$-vertex graph $G$ contains $\varepsilon n^2$ edge-disjoint copies of $H$ then $G$ contains…

A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chv\'atal conjectured that this theorem extends to metric spaces, with an appropriated definition of…

The speed of a class of graphs counts the number of graphs on the vertex set $\lbrace 1,\dots, n\rbrace$ inside the class as a function of $n$. In this paper, we investigate this function for many classes of graphs that naturally arise in…

The Chern-Fulton class is a generalization of Chern class to the realm of arbitrary embeddable schemes. While Chern-Fulton classes are sensitive to non-reduced scheme structure, they are not sensitive to possible singularities of the…

The goal of the paper is two-fold. At first, we attempt to give a survey of some recent applications of symmetric polynomials and divided differences to intersection theory. We discuss: polynomials universally supported on degeneracy loci;…