Related papers: Cauchy-Davenport Theorem for linear maps: Simplifi…
This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…
In this paper we study the global existence of small data solutions to the Cauchy problem for the semilinear wave equation with scale-invariant damping. We obtain estimates for the solution and its energy with the same decay rate of the…
We study the Cauchy problem for a nonlinear damped wave equation. Under suitable assumptions for the nonlinearity and the initial data, we obtain the global solution which satisfies weighted $L^1$ and $L^\infty$ estimates. Furthermore, we…
We continue our study of matrix models of dually weighted graphs. Among the attractive features of these models is the possibility to interpolate between ensembles of regular and random two-dimensional lattices, relevant for the study of…
Wave maps (i.e. nonlinear sigma models) with torsion are considered in 2+1 dimensions. Global existence of smooth solutions to the Cauchy problem is proven for certain reductions under a translation group action: invariant wave maps into…
This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in…
Let $\mathbb{A} = (A, +)$ be a (possibly non-commutative) semigroup. For $Z \subseteq A$ we define $Z^\times := Z \cap \mathbb A^\times$, where $\mathbb A^\times$ is the set of the units of $\mathbb{A}$, and $$\gamma(Z) := \sup_{z_0 \in…
We establish global well-posedness and scattering for wave maps from $d$-dimensional hyperbolic space into Riemannian manifolds of bounded geometry for initial data that is small in the critical Sobolev space for $d \geq 4$. The main…
In earlier work the authors have extended Nehari's well-known Schwarzian derivative criterion for univalence of analytic functions to a univalence criterion for canonical lifts of harmonic mappings to minimal surfaces. The present paper…
Lower bounds on the proof-theoretic strength of the graph minor theorem were found over 30 years ago by Friedman, Robertson and Seymour 1987, but upper bounds have always been elusive. We present recently found upper bounds on the graph…
At the core of the Robertson-Seymour theory of graph minors lies a powerful structure theorem which captures, for any fixed graph H, the common structural features of all the graphs not containing H as a minor. Robertson and Seymour prove…
This paper explores recent progress related to constraint maps. Building on the exposition in [14], our goal is to provide a clear and accessible account of some of the more intricate arguments behind the main results in this work. Along…
We prove the existence of continuous boundary extensions (Cannon-Thurston maps) for the inclusion of a vertex space into a tree of (strongly) relatively hyperbolic spaces satisfying the qi-embedded condition. This implies the same result…
The Cauchy problem for a quasilinear system of hyperbolic-parabolic equations is addressed with the method of linearization and fixed point. Coupling between the hyperbolic and parabolic variables is allowed in the linearization and we do…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result…
It is a celebrated result in early combinatorics that, in bipartite graphs, the size of maximum matching is equal to the size of a minimum vertex cover. K\H{o}nig's proof of this fact gave an algorithm for finding a minimum vertex cover…
An $\epsilon$-net theorem for a hypergraph upper bounds the minimum size of a vertex set that pierces all $\epsilon$-heavy hyperedges. A $(p,2)$-theorem bounds from above the minimum size of a vertex set that pierces all hyperedges, in…
We derive several upper bounds on the spectral gap of the Laplacian with standard or Dirichlet vertex conditions on compact metric graphs. In particular, we obtain estimates based on the length of a shortest cycle (girth), diameter, total…
The rigidity of a matrix measures how many of its entries need to be changed in order to reduce its rank to some value. Good lower bounds on the rigidity of an explicit matrix would imply good lower bounds for arithmetic circuits as well as…