Related papers: Largest zero-dimensional intersection of $r$ degre…

We prove formulas (found by Witten in 1992 using physical methods) for intersection pairings in the cohomology of the moduli space M(n,d) of stable holomorphic vector bundles of rank n and degree d (assumed coprime) on a Riemann surface of…

In this paper we investigate the intersection problem for $1$-surfaces immersed in a complete Riemannian three-manifold $P$ with Ricci curvature bounded from below by $-2$. We first prove a Frankel's type theorem for $1$-surfaces with…

Let $d$ and $n$ be positive integers, and $E/F$ be a separable field extension of degree $m=\binom{n+d}{n}$. We show that if $|F| > 2$, then there exists a point $P\in \mathbb{P}^n(E)$ which does not lie on any degree $d$ hypersurface…

In this article, we establish a truncated non-integrated defect relation for meromorphic mappings from an $m$-dimensional complete K\"{a}hler manifold into $\mathbb P^n(\mathbb C)$ intersecting $q$ hypersurfaces $Q_1,...,Q_q$ in…

It is known that in the Minkowski sum of $r$ polytopes in dimension $d$, with $r<d$, the number of vertices of the sum can potentially be as high as the product of the number of vertices in each summand. However, the number of vertices for…

The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown $NP$-hard by expressing the satisfiability of boolean formulas in 3-conjunctive normal form as such an intersection. The corresponding…

We give upper bounds for the dimension of the set of hypersurfaces of $\mathbb{P}^N$ whose intersection with a fixed integral projective variety is not integral. Our upper bounds are optimal. As an application, we construct, when possible,…

We compute the essential dimension of the functors Forms_{n,d} and Hypersurf_{n, d} of equivalence classes of homogeneous polynomials in n variables and hypersurfaces in P^{n-1}, respectively, over any base field k of characteristic 0. Here…

A central theme in extremal combinatorics is the study of the maximum number of edges in an $r$-uniform hypergraph ($r$-graph) with matching number at most $s$ (the Erd\H{o}s Matching Conjecture) or with pairwise intersection at least $t$…

This article describes a unirationality construction for general low degree complete intersections in projective space which is based on a variety of highly tangent lines. Applied to hypersurfaces, this implies that a general hypersurface…

In their recent inspiring paper Mironov and Morozov claim a surprisingly simple expansion formula for the Kontsevich-Witten tau-function in terms of the Schur Q-functions. Here we provide a similar conjecture for the Br\'ezin-Gross-Witten…

We study the following natural question on random sets of points in $\mathbb{F}_2^m$: Given a random set of $k$ points $Z=\{z_1, z_2, \dots, z_k\} \subseteq \mathbb{F}_2^m$, what is the dimension of the space of degree at most $r$…

We derive a formula for the Milnor class of scheme-theoretic global complete intersections (with arbitrary singularities) in a smooth variety in terms of the Segre class of its singular scheme. In codimension one the formula recovers a…

Let $X$ be a hypersurface in $\mathbb{P}^N$ with $N\geq 3$ defined over a finite field. The main result of this note is the classification, up to projective equivalence, of hypersurfaces $X$ as above without a linear component when the…

In this paper, we prove the conjectures of Gharakhloo and Welker (2023) that the positive matching decomposition number (pmd) of a $3$-uniform hypergraph is bounded from above by a polynomial of degree $2$ in terms of the number of…

Let $X$ be a smooth irreducible projective variety of dimension at least 2 over an algebraically closed field of characteristic 0 in the projective space ${\mathbb{P}}^n$. Bertini's Theorem states that a general hyperplane $H$ intersects…

We study the intersection of tropical psi-classes on tropical heavy/light Hassett spaces, generalising a result of Kerber--Markwig for tropical moduli spaces of rational stable curves with distinct marked points. Our computation reveals…

The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…

Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…

By a curve in R^d we mean a continuous map gamma:I -> R^d, where I is a closed interval. We call a curve gamma in R^d at most k crossing if it intersects every hyperplane at most k times (counted with multiplicity). The at most d crossing…