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

A singular point of a smooth map F: M -> N of manifolds is a point in M at which the rank of the differential dF is less than the minimum of dimensions of M and N. The classical invariant of the set S of singular points of F of a given type…

Continuous mappings between compact Hausdorff spaces can be studied using homomorphisms between algebraic structures (lattices, Boolean algebras) associated with the spaces. This gives us more tools with which to tackle problems about these…

The Reeb space of a generic map is the space of all connected components of preimages of the map. Reeb spaces are fundamental and useful tools in the theory of Morse functions and higher dimensional variants and their applications to…

Mader [J. Graph Theory 65 (2010) 61-69] conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$, every $k$-connected, finite graph $G$ with $\delta(G)\geq \lfloor\frac{3}{2}k\rfloor+m-1$ contains a subtree…

We show that the border subrank of a sufficiently general tensor in $(\mathbb{C}^n)^{\otimes d}$ is $\mathcal{O}(n^{1/(d-1)})$ for $n \to \infty$. Since this matches the growth rate $\Theta(n^{1/(d-1)})$ for the generic (non-border) subrank…

For a smooth, non-degenerate locally integrable structure of hypersurface type on a manifold $M$, we provide necessary and sufficient conditions for it to be equivalent, near a point, to a real-analytic locally integrable structure (the…

We study unboundedness properties of functions belonging to generalised Morrey spaces ${\mathcal M}_{\varphi,p}({\mathbb R}^d)$ and generalised Besov-Morrey spaces ${\mathcal N}^{s}_{\varphi,p,q}({\mathbb R}^d)$ by means of growth…

The purpose of this article is to prove a generalisation of the Besicovitch-Federer projection theorem about a characterisation of rectifiable and unrectifiable sets in terms of their projections. For an $m$-unrectifiable set…

We construct relative Gromov--Witten theory with expanded degenerations in the normal crossings setting and establish a degeneration formula for the resulting invariants. Given a simple normal crossings pair $(X,D)$, we show that there…

Let $R_{n}$ denote the graph with vertex set consisting of the squares of an $n \times n$ grid, with two squares of the grid adjacent when they lie in the same row or column. This is the square rook's graph, and can also be thought of as…

We prove a so-called linking theorem and some of its corollaries, namely a mountain pass theorem and a three critical points theorem for Keller $ C^1$-functional on $ C^1 $- Frechet manifolds. Our approach relies on a deformation result…

Feder-Vardi conjecture, which proposed that every finite-domain Constraint Satisfaction Problem (CSP) is either in P or it is NP-complete, has been solved independently by Bulatov and Zhuk almost ten years ago. Bodirsky-Pinsker conjecture…

Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…

A graph $G$ is $k$-critical if it has chromatic number $k$, but every proper subgraph of $G$ is $(k-1)$--colorable. Let $f_k(n)$ denote the minimum number of edges in an $n$-vertex $k$-critical graph. We give a lower bound, $f_k(n) \geq…

A classic theorem of Dirac from 1952 states that every graph with minimum degree at least n/2 contains a Hamiltonian cycle. In 1963, P\'osa conjectured that every graph with minimum degree at least 2n/3 contains the square of a Hamiltonian…

The classical stability theorem of Erd\H{o}s and Simonovits states that, for any fixed graph with chromatic number $k+1 \ge 3$, the following holds: every $n$-vertex graph that is $H$-free and has within $o(n^2)$ of the maximal possible…

A graph $G$ is $k$-{\em critical} if it has chromatic number $k$, but every proper subgraph of $G$ is $(k-1)$--colorable. Let $f_k(n)$ denote the minimum number of edges in an $n$-vertex $k$-critical graph. Recently the authors gave a lower…

Recently in 2021, Gutman introduced the Sombor index of a graph, a novel degree-based topological index. It has been shown that the Sombor index efficiently models the thermodynamic properties of chemical compounds. Assume $\mathbb{B}_n^k$…

B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…

A graph is called $k$-critical if its chromatic number is $k$ but any proper subgraph has chromatic number less than $k$. An old and important problem in graph theory asks to determine the maximum number of edges in an $n$-vertex…