Related papers: Multiplicity and degree relative to a set

Let M and N be two closed (not necessarily orientable) surfaces, and f a continuous map from M to N. By definition, the minimal multiplicity MMR[f] of the map f denotes the minimal integer k having the following property: f can be deformed…

We address a metric version of Zariski's multiplicity conjecture at infinity that says that two complex algebraic affine sets which are bi-Lipschitz homeomorphic at infinity must have the same degree. More specifically, we prove that the…

Let G be a family of n-vertex graphs of uniform degree 2 with the property that the union of any two member graphs has degree four. We determine the leading term in the asymptotics of the largest cardinality of such a family. Several…

We prove that limits of multiplicities associated to graded families of ideals exist under very general conditions. Most of our results hold for analytically unramified equicharacteristic local rings, with perfect residue fields. We give a…

Let $(R,\mathfrak{m})$ be a Noetherian local ring of dimension $d > 0$. Let $I_\bullet = \{I_n\}_{n \in \mathbb{N}}$ be a graded family of $\mathfrak{m}$-primary ideals in $R$. We examine how far off from a polynomial can the length…

To study how balanced or unbalanced a maximal intersecting family $\mathcal{F}\subseteq \binom{[n]}{r}$ is we consider the ratio $\mathcal{R}(\mathcal{F})=\frac{\Delta(\mathcal{F})}{\delta(\mathcal{F})}$ of its maximum and minimum degree.…

A finite non-increasing sequence of positive integers $d = (d_1\geq \cdots\geq d_n)$ is called a degree sequence if there is a graph $G = (V,E)$ with $V = \{v_1,\ldots,v_n\}$ and $deg(v_i)=d_i$ for $i=1,\ldots,n$. In that case we say that…

We consider the problem of finding a subgraph of a given graph which minimizes the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already when all functions are the same, we show that it…

A subset of vertices $F$ in a graph $G$ is called a \emph{dissociation set} if the induced subgraph $G[F]$ of $G$ has maximum degree at most 1. A \emph{maximal dissociation set} of $G$ is a dissociation set which is not a proper subset of…

We generalize the recent work of S. Fomin and G. Mikhalkin on polynomial formulas for Severi degrees. The degree of the Severi variety of plane curves of degree d and delta nodes is given by a polynomial in d, provided delta is fixed and d…

Let $f:\mathbb{K}^n\rightarrow\mathbb{K}^m$ be a generically finite polynomial map of degree $d$ between affine spaces. In arXiv:1411.5011 we proved that if $\mathbb{K}$ is the field of complex or real numbers, then the set $S_f$ of points…

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

Given a class of graphs G closed under taking minors, we study the maximum degree \Delta_n of random graphs from G with n vertices. We prove several lower and upper bounds that hold with high probability. Among other results, we find…

It is known that the weight (that is, the number of nonzero coefficients) of a univariate polynomial over a field of characteristic zero is larger than the multiplicity of any of its nonzero roots. We extend this result to an appropriate…

Let $H$ be a graph with maximum degree $d$, and let $d'\ge 0$. We show that for some $c>0$ depending on $H,d'$, and all integers $n\ge 0$, there are at most $c^n$ unlabelled simple $d$-connected $n$-vertex graphs with maximum degree at most…

Let $p$ be a prime, let $1 \le t < d < p$ be integers, and let $S$ be a non-empty subset of $\mathbb{F}_p$. We establish that if a polynomial $P:\mathbb{F}_p^n \to \mathbb{F}_p$ with degree $d$ is such that the image $P(S^n)$ does not…

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

We give several new applications of our theorem on the existence of multiplicity of graded families of ideals as a limit, including a very general Minkowski type inequality for graded families of ideals, a very general formula for existence…

Let $A=B+C$ be an associative algebra graded by a group $G$, which is a sum of two homogeneous subalgebras $B$ and $C$. We prove that if $B$ is an ideal of $A$, and both $B$ and $C$ satisfy graded polynomial identities, then the same…

The multiplicity of an algebraic curve $C$ in the complex plane at a point $p$ on that curve is defined as the number of points that occur at the intersection of $C$ with a general complex line that passes close to the point $p$. It is…