Related papers: A refined estimate for the topological degree

Let $G$ be a graph each edge $e$ of which is given a length $\ell(e)$. This naturally induces a distance $d_\ell(x,y)$ between any two vertices $x,y$, and we let $\ell-TOP$ denote the completion of the corresponding metric space. It turns…

We prove that the `Upper Matching Conjecture' of Friedland, Krop, and Markstr\"om and the analogous conjecture of Kahn for independent sets in regular graphs hold for all large enough graphs as a function of the degree. That is, for every…

Let $U_{d,n}^*$ be the universal degree $d$ hypersurface in $\mathbb{P}^n$. In this paper we compute the stable (with respect to $d$) cohomology of $U_{d,n}^*$ and give a geometric description of the stable classes. This builds on work of…

For each even, positive integer $n$, we define a rational self-map on the space of plane curves of degree $n$, using classical contravariants. In the case of plane quartics, we show that the degree of this map is 15. This answers a question…

A stacked $d$-sphere $S$ is the boundary complex of a stacked $(d+1)$-ball, which is obtained by taking cone over a free $d$-face repeatedly from a $(d+1)$-simplex. A stacked sphere $S$ is called linear if every cone is taken over a face…

We propose a computation of curvature of arbitrary two-dimensional surfaces of three-dimensional objects, which is a contribution to discrete gravity with potential applications in network geometry. We begin by linking each point of the…

Extremal problems involving the enumeration of graph substructures have a long history in graph theory. For example, the number of independent sets in a $d$-regular graph on $n$ vertices is at most $(2^{d+1}-1)^{n/2d}$ by the Kahn-Zhao…

In this paper we study the fundamental problem of finding small dense subgraphs in a given graph. For a real number $s>2$, we prove that every graph on $n$ vertices with average degree at least $d$ contains a subgraph of average degree at…

In this paper, we study rare events in spherical and Gaussian random geometric graphs in high dimensions. In these models, the vertices correspond to points sampled uniformly at random on the $d$ dimensional unit sphere or correspond to $d$…

D.Bayer and D.Mumford introduced the degree complexity of a projective scheme for the given term order as the maximal degree of the reduced Gr\"{o}bner basis. It is well-known that the degree complexity with respect to the graded reverse…

This final degree project is devoted to study the topological classification of complex plane curves. These are subsets of $\mathbb{C}^2$ that can be described by an equation $f(x,y)=0$. Loosely speaking, curves are said to be equivalent in…

Motivated from the surrounding property of a point set in $\mathbb{R}^d$ introduced by Holmsen, Pach and Tverberg, we consider the transversal number and chromatic number of a simplicial sphere. As an attempt to give a lower bound for the…

In this paper we obtain an explicit formula for the number of degree d curves in two dimensional complex projective space, passing through (d(d+3)/2 -k) generic points and having a codimension k singularity, where k is at most 7. In the…

We prove that a subset of the hypercube $(0,1)^d$ with volume sufficiently close to $\frac12$ has (relative) perimeter greater than or equal to $1$. This settles a conjecture by Brezis and Bruckstein. We also prove that, in contrast with…

We investigate the maximal degree in a Poisson-Delaunay graph in $\mathbf{R}^d$, $d\geq 2$, over all nodes in the window $\mathbf{W}_\rho:= \rho^{1/d}[0,1]^d$ as $\rho$ goes to infinity. The exact order of this maximum is provided in any…

In this paper, we give closed-form formulae for Severi degrees in cogenus 3 and 4 using Ran's method. These formulae coincide with those of I. Vainsencher and for cogenus 3 case, that of J. Harris and R. Pandharipande. Another result of…

We show that the degree of the linearly full constantly curved holomorphic 2-spheres in the complex Grassmannians G(2,n+2;C) is greater than or equal to n for general n and less than or equal to 2n for n=2,3.

One proves a far-reaching upper bound for the degree of a generically finite rational map between projective varieties over a base field of arbitrary characteristic. The bound is expressed as a product of certain degrees that appear…

In this paper, we present a new explicit formula for the curvatures of a regular curve with an arbitrary parameter in the Euclidean space $\mathbb{R}^n$, $n\geq 2$, expressed only in terms of its derivatives. We introduce also the notion of…

We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1-\epsilon)n vertices, in terms of the expansion properties of G. As a result we show that for fixed d\geq 2…