Related papers: When does the table theorem imply a solution to th…
In this paper we give a short survey of a connection between the theory of wavelets in L^2(R) and certain representations of the Cuntz algebra on L^2(T).
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
We prove a transversality "lifting property" for compactified configuration spaces as an application of the multijet transversality theorem: given a submanifold of configurations of points on an embedding of a compact manifold $M$ in…
A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…
We offer a reader-friendly introduction to the attracting edge problem (also known as the "triangle conjecture") and its most general current solution of Limic and Tarr\`es (2007). Little original research is reported; rather this article…
Turan's theorem implies that every graph of order n with more edges than the r-partite Turan graph contains a complete graph of order r+1. We show that the same premise implies the existence of much larger graphs. We also prove…
A topological graph is \emph{$k$-quasi-planar} if it does not contain $k$ pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most once (either at a vertex or at their intersection). In…
Pick's astonishing theorem explains how to obtain the area of any integer polygon by counting lattice points. It is a notoriously difficult challenge to translate the geometric statement and intuitive reasoning into a formal statement and…
The main aim of this paper to show how commutative algebra is connected to topology. We give underlying topological idea of some results on completable unimodular rows.
As a variant of the famous Tur\'an problem, we study $\mathrm{rex}(n,F)$, the maximum number of edges that an $n$-vertex regular graph can have without containing a copy of $F$. We determine $\mathrm{rex}(n,K_{r+1})$ for all pairs of…
We prove that the pluri-fine topology on any open set $\Omega$ in $\mathbb{C}^{n}$ is locally connected. This answers a question by Fuglede in [4]. See also Bedford [6].
After Dirac introduced the monopole, topological objects have played increasingly important roles in physics. In this review we discuss the role of the knot, the most sophisticated topological object in physics, and related topological…
This document is an exposition of an assortment of open problems arising from the exact enumeration of (perfect) matchings of finite graphs. Roughly half have been solved at the time of this writing; see the document "Twenty Open Problems…
A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
Graphs are fundamental objects that find widespread applications across computer science and beyond. Graph Theory has yielded deep insights about structural properties of various families of graphs, which are leveraged in the design and…
This is an update on, and expansion of, our paper Open problems on $\beta\omega$ in the book Open Problems in Topology.
We observe that a lemma used in the study of even sets of nodes on surfaces applies almost verbatim to prove a celebrated formula of Gauss on the 2-torsion of the class group of a quadratic field.
Tverberg's theorem says that a set with sufficiently many points in $\mathbb{R}^d$ can always be partitioned into $m$ parts so that the $(m-1)$-simplex is the (nerve) intersection pattern of the convex hulls of the parts. The main results…
A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm,…