相关论文: On the Third Gap for Proper Holomorphic Maps betwe…

A graphs of rank n (homotopy equivalent to a wedge of n circles) without ``separating edges'' has a canonical n-dimensional compact C^1 manifold thickening. This implies that the canonical homomorphism f:Out(F_n)-> GL(n,Z) is trivial in…

For a planar graph $H$, let $\operatorname{\mathbf{N}}_{\mathcal P}(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. In this paper, we prove that $\operatorname{\mathbf{N}}_{\mathcal P}(n,P_7)\sim{4\over…

Laman graphs are fundamental to rigidity theory. A graph G with n vertices and m edges is a generic minimally rigid graph (Laman graph), if m=2n-3 and every induced subset of k vertices spans at most 2k-3 edges. We consider the verification…

In this paper we prove the existence of a solution to the Dirichlet problem for harmonic maps into a geodesic ball on which the squared distance function from the origin is strictly convex. This improves a celebrated theorem obtained by S.…

In this paper, we prove an analogue of Corr\'adi and Hajnal's classical theorem. There exists $n_0$ such that for every $n \in 3\mathbb{Z}$ when $n \ge n_0$ the following holds. If $G$ is an oriented graph on $n$ vertices and every vertex…

Let $\mathcal A$ and $\mathcal B$ be two (complex) algebras. A linear map $\phi:{\mathcal A}\to{\mathcal B}$ is called $n$-homomorphism if $\phi(a_{1}... a_{n})=\phi(a_{1})...\phi(a_{n})$ for each $a_{1},...,a_{n}\in{\mathcal A}.$ In this…

We prove a rigidity theorem for the geometry of the unit ball in random subspaces of the scl norm in B_1^H of a free group. In a free group F of rank k, a random word w of length n (conditioned to lie in [F,F]) has scl(w)=log(2k-1)n/6log(n)…

Given $k$-uniform hypergraphs $G$ and $H$ on $n$ vertices with densities $p$ and $q$, their relative discrepancy is defined as $\hbox{disc}(G,H)=\max\big||E(G')\cap E(H')|-pq\binom{n}{k}\big|$, where the maximum ranges over all pairs…

Given an $n$-vertex graph $G$, let $\hom (G)$ denote the size of a largest homogeneous set in $G$ and let $f(G)$ denote the maximal number of distinct degrees appearing in an induced subgraph of $G$. The relationship between these…

In this article, we study local holomorphic isometric embeddings from ${\BB}^n$ into ${\BB}^{N_1}\times... \times{\BB}^{N_m}$ with respect to the normalized Bergman metrics up to conformal factors. Assume that each conformal factor is…

It was conjectured, twenty years ago, the following result that would generalize the so-called rank rigidity theorem for homogeneous Euclidean submanifolds: let M^n, n>=2, be a full and irreducible homogeneous submanifold of the sphere…

The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $\alpha,2\alpha,\ldots, N\alpha$ take at most three distinct values. Motivated by a question of…

It was proven by Hitchin that any solution of his evolution equations for a half-flat SU(3)-structure on a compact six-manifold M defines an extension of M to a seven-manifold with holonomy in G_2. We give a new proof, which does not…

We consider the problem of morphing between contact representations of a plane graph. In an $\mathcal F$-contact representation of a plane graph $G$, vertices are realized by internally disjoint elements from a family $\mathcal F$ of…

In arXiv:1905.07734 we presented a construction that is an analogue of Pontryagin's for proper maps in stable dimensions. This gives a bijection between the cobordism set of framed embedded compact submanifolds in $W\times\mathbb{R}^n$ for…

Given a rigid realisation of a graph $G$ in ${\mathbb R}^2$, it is an open problem to determine the maximum number of pairwise non-congruent realisations which have the same edge lengths as the given realisation. This problem can be…

We study the maximum dimension $d=d(n,p)$ for which an Erd\H{o}s-R\'enyi $G(n,p)$ random graph is $d$-rigid. Our main results reveal two different regimes of rigidity in $G(n,p)$ separated at $p_c=C_*\log n/n,~C_*=2/(1-\log 2)$ -- the point…

This paper revives a four-decade-old problem concerning regularity theory for (continuous) constraint maps with free boundaries. Dividing the map into two parts, the distance part and the projected image to the constraint, one can prove…

We study the properties of finite graphs in which the ball of radius $r$ around each vertex induces a graph isomorphic to some fixed graph $F$. This is a natural extension of the study of regular graphs, and of the study of graphs of…

A triple of vertices in a graph is a \emph{frustrated triangle} if it induces an odd number of edges. We study the set $F_n\subset[0,\binom{n}{3}]$ of possible number of frustrated triangles $f(G)$ in a graph $G$ on $n$ vertices. We prove…