Related papers: A bridge between Dubovitskii - Federer theorems an…

Tyomkin's correspondence theorem states the equality of counts of rational curves of fixed homology class in a toric surface satisfying point and cross-ratio conditions with their tropical counterparts. Such correspondence theorems allow us…

Consider a compact manifold M of dimension at least 2 and the space of C^r-smooth diffeomorphisms Diff^r(M). The classical Artin-Mazur theorem says that for a dense subset D of Diff^r(M) the number of isolated periodic points grows at most…

We prove that every $k$-list-critical graph ($k \ge 7$) on $n \ge k+2$ vertices has at least $\frac12 \left(k-1 + \frac{k-3}{(k-c)(k-1) + k-3}\right)n$ edges where $c = (k-3)\left(\frac12 - \frac{1}{(k-1)(k-2)}\right)$. This improves the…

We prove that the topological connectivity of a graph homomorphism complex Hom($G,K_m$) is at least $m-D(G)-2$, where $\displaystyle D(G)=\max_{H\subseteq G}\delta(H)$. This is a strong generalization of a theorem of Cuki\'{c} and Kozlov,…

We prove a noncommutative variant of Saskin's classical theorem -- on the connection between Choquet boundaries for function spaces and Korovkin sets -- for operator systems generating separable Type I C*-algebras. The main result implies…

We give a combinatorial proof of a recent geometric result of Farkas and Lian on linear series on curves with prescribed incidence conditions. The result states that the expected number of degree-$d$ morphisms from a general genus $g$,…

In this paper, we provide a common generalization to the well-known Erd\H{o}s-Ko-Rado Theorem, Frankl-Wilson Theorem, Alon-Babai-Suzuki Theorem, and Snevily Theorem on set systems with $\mathcal{L}$-intersections. As a consequence, we…

We show that a discrete harmonic function which is bounded on a large portion of a periodic planar graph is constant. A key ingredient is a new unique continuation result for the weighted graph Laplacian. The proof relies on the structure…

We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Z_k of order k. We then demonstrate how such a chain map induces a "Z_k-combinatorial Stokes theorem", which in turn…

Here are two of our main results: Theorem 1. Let X be a normal space with dim X=n and m\geq n+1. Then the space C*(X,R^m) of all bounded maps from X into R^m equipped with the uniform convergence topology contains a dense G_{\delta}-subset…

The coloured Tverberg theorem was conjectured by B\'ar\'any, Lov\'{a}sz and F\"uredi and asks whether for any d+1 sets (considered as colour classes) of k points each in R^d there is a partition of them into k colourful sets whose convex…

In this paper, we establish a new improved Sobolev inequality based on a weighted Morrey space. To be precise, there exists $C=C(n,m,s,\alpha)>0$ such that for any $u,v \in {\dot{H}}^s(\mathbb{R}^{n})$ and for any $\theta \in…

Root separation bounds play an important role as a complexity measure in understanding the behaviour of various algorithms in computational algebra, e.g., root isolation algorithms. A classic result in the univariate setting is the…

We define a new Gromov-Witten theory relative to simple normal crossing divisors as a limit of Gromov-Witten theory of multi-root stacks. Several structural properties are proved including relative quantum cohomology, Givental formalism,…

Dirac (1952) proved that every connected graph of order $n>2k+1$ with minimum degree more than $k$ contains a path of length at least $2k+1$. Erd\H{o}s and Gallai (1959) showed that every $n$-vertex graph $G$ with average degree more than…

For a linear subvariety $M$ of a stratum of meromorphic differentials, we investigate its closure in the multi-scale compactification constructed by Bainbridge-Chen-Gendron-Grushevsky-M\"oller. We prove various restrictions on the type of…

R\'emy's algorithm is a Markov chain that iteratively generates a sequence of random trees in such a way that the $n^{\mathrm{th}}$ tree is uniformly distributed over the set of rooted, planar, binary trees with $2n+1$ vertices. We obtain a…

We prove that for all $k \ge 3$ and any integers $\Delta, n$ with $n \ge 2^\Delta,$ there exists a $k$-graph on $n$ vertices with maximum degree at most $\Delta$ such that $r(H)\geq\tw_{k-1}(c_k \Delta) \cdot n$ for some constant $c_k > 0$,…

The theory of graph limits is only understood to any nontrivial degree in the cases of dense graphs and of bounded degree graphs. There is, however, a lot of interest in the intermediate cases. It appears that the most important…

We modify an argument of Hablicsek and Scherr to show that if a collection of points in $\mathbb{C}^d$ spans many $r$--rich lines, then many of these lines must lie in a common $(d-1)$--flat. This is closely related to a previous result of…