Related papers: Tverberg plus constraints
We prove variants of Wiener's Tauberian theorem in the framework of quantum harmonic analysis, i.e. for convolutions between an absolutely integrable function and a trace class operator, or of two trace class operators. Our results include…
We provide an algorithm that verifies the optimal colored Tverberg problem for $10$ points in the plane: Every $10$ points in the plane in color classes of size at most $3$ can be partitioned in $4$ rainbow pieces such that their convex…
This work is concerned with an axiom introduced by Todorc\v{e}vi\'{c} in \cite{stevo} that constitutes a Ramsey-like statement regarding the topology of the reals. Our aim is to explain the axiom in detail, give some interesting…
This paper circulated previously in a draft version. Now, upon general request, it is about time to distribute the more detailed (and much longer) version. The main technical issues revolve around the fine structure of the compactification…
We prove a full generalization of the Castelnuovo's free pencil trick. We show its analogies with the Adjoint Theorem; see L. Rizzi, F. Zucconi, Differential forms and quadrics of the canonical image, arXiv:1409.1826 and also Theorem 1.5.1…
In the paper "Uniformity of Mordell-Lang" by Vesselin Dimitrov, Philipp Habegger and Ziyang Gao (arXiv:2001.10276), they use Silverman-Tate's Height Inequality and they give a proof of the same which makes use of Cartier divisors and hence…
Thurston obtained a combinatorial characterization for generic branched self-coverings that preserve the orientation of the oriented 2-sphere by associating a planar graph to them [arXiv:1502.04760]. In this work, the Thurston result is…
We give a new proof of Zariski's multiplicity conjecture in the case of isolated hypersurface singularities; this was first proved by de Bobadilla-Pe\l ka \cite{BobadillaPelka}. Our proof uses the TQFT structure of fixed-point Floer…
In the 1970s, the collar theorem was proven, establishing the existence of uniform tubular neighborhoods of simple closed geodesics on compact surfaces, whose widths depend only on the lengths of the geodesics and the lower bound of the…
Similar to Euclidean geometry, graph theory is a science that studies figures that consist of points and lines. The core of Euclidean geometry is the parallel postulate, which provides the basis of the geometric invariant that the sum of…
This is the second in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a graph embedded on a surface of genus $g$. Then $G$ can be $L$-colored, where $L$ is a…
Fix a palette $\mathcal K$ of $\Delta+1$ colours, a graph with maximum degree $\Delta$, and a subset $M$ of the edge set with minimum distance between edges at least $9$. If the edges of $M$ are arbitrarily precoloured from $\mathcal K$,…
A map $\varphi:K\to R^2$ of a graph $K$ is approximable by embeddings, if for each $\varepsilon>0$ there is an $\varepsilon$-close to $\varphi$ embedding $f:K\to R^2$. Analogous notions were studied in computer science under the names of…
We develop a geometric framework that unifies several different combinatorial fixed-point theorems related to Tucker's lemma and Sperner's lemma, showing them to be different geometric manifestations of the same topological phenomena. In…
Let $P$ be a $d$-dimensional $n$-point set. A partition $T$ of $P$ is called a Tverberg partition if the convex hulls of all sets in $T$ intersect in at least one point. We say $T$ is $t$-tolerant if it remains a Tverberg partition after…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
We establish two versions of Vizing's theorem for Borel multi-graphs whose vertex degrees and edge multiplicities are uniformly bounded by respectively $\Delta$ and $\pi$. The ``approximate'' version states that, for any Borel probability…
An equitable coloring of a graph $G$ is a proper vertex coloring of $G$ such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors…
A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…
Theory of motivic superpolynomials is developed, including its extension to algebraic links colored by rows, relations to $L$-functions of plane curve singularities, the justification of the motivic versions of Weak Riemann Hypothesis, and…