Related papers: On the intersection multiplicity of plane branches

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

We calculate the intersection ring of three-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifold's underlying graph is a tree. We are able to use this…

Following Brooks's calculation of the $\hat{A}$-genus of complete intersections, a new and more computable formula about the $\hat{A}$-genus and $\alpha$-invariant will be described as polynomials of multi-degree and dimension. We also give…

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

We prove several incidence theorems in vector spaces over finite fields using bounds for various classes of exponential sums and apply these to Erdos-Falconer type distance problems.

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

We present a method to calculate to very high precision the coefficients of the divergences occuring in two-loop diagrams for a massive scalar field on the lattice. The approach is based on coordinate space techniques and extensive use of…

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

A graph is said to be a segment graph if its vertices can be mapped to line segments in the plane such that two vertices have an edge between them if and only if their corresponding line segments intersect. Kratochv\'{i}l and Kub\v{e}na…

We collect some results in combinatorial geometry that follow from an inequality of Langer in algebraic geometry. Langer's inequality gives a lower bound on the number of incidences between a point set and its spanned lines, and was…

We consider several classes of intersection graphs of line segments in the plane and prove new equality and separation results between those classes. In particular, we show that: (1) intersection graphs of grounded segments and intersection…

We derive two consequences of the multivariate fundamental theorem of algebra (MFTA). The first one is the Bezout theorem for $n$ polynomials. Notably the intersection multiplicities, as in MFTA, are characterized just by means of partial…

In this paper we produce the first known formula for cohomologies of the derived tensor products of structure sheaves of subschemes in the case where the intersection of the subschemes is not a local complete intersection. The case covered…

We study the volume of the intersection of two unit balls from one of the classical matrix ensembles GOE, GUE and GSE, as the dimension tends to infinity. This can be regarded as a matrix analogue of a result of Schechtman and…

We prove a combination theorem for trees of (strongly) relatively hyperbolic spaces and finite graphs of (strongly) relatively hyperbolic groups. This gives a geometric extension of Bestvina and Feighn's Combination Theorem for hyperbolic…

Kontsevich's work on Airy matrix integrals has led to explicit results for the intersection numbers of the moduli space of curves. In this article we show that a duality between k-point functions on $N\times N$ matrices and N-point…

Menger's theorem says that, for $k\ge0$, if $S, T$ are sets of vertices in a graph $G$, then either there are $k + 1$ vertex-disjoint paths between $S$ and $T$, or there is a set X of at most $k$ vertices such that every $S$-$T$ path passes…

We generalize the braid algebra to the case of loops with intersections. We introduce the Reidemeister moves for 4 and 6-valent vertices to have a theory of rigid vertex equivalence. By considering representations of the extended braid…

We provide a graph formula which describes an arbitrary monomial in {\omega} classes (also referred to as stable {\psi} classes) in terms of a simple family of dual graphs (pinwheel graphs) with edges decorated by rational functions in…

In this paper, we present the Baumkuchen Theorem related to the combination of divided Baumkuchen pieces. It can be proved using the basic properties of elementary geometry. We also apply some lemmas to prove the Pizza Theorem.