Related papers: A remark on $\varepsilon$-maps in dimension 1

We investigate the emergence of spanning structures in sparse pseudo-random $k$-uniform hypergraphs, using the following comparatively weak notion of pseudo-randomness. A $k$-uniform hypergraph $H$ on $n$ vertices is called…

A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the…

We consider the problem of testing small set expansion for general graphs. A graph $G$ is a $(k,\phi)$-expander if every subset of volume at most $k$ has conductance at least $\phi$. Small set expansion has recently received significant…

The principal graph $X$ of a subfactor with finite Jones index is one of the important algebraic invariants of the subfactor. If $\Delta$ is the adjacency matrix of $X$ we consider the equation $\Delta=U+U^{-1}$. When $X$ has square norm…

The decycling number $\phi(G)$ of a graph $G$ is the smallest number of vertices which can be removed from $G$ so that the resulting graph has no cycles. Bau, Wormald and Zhou conjectured that with probability tending to one the decycling…

We estimate harmonic scalings in the parameter space of a one-parameter family of critical circle maps. These estimates lead to the conclusion that the Hausdorff dimension of the complement of the frequency-locking set is less than $1$ but…

Let $n$ be a positive integer and $H$ a Hilbert space. The description of the general form of bijective maps on the set of $n$-dimensional subspaces of $H$ preserving the maximal principal angle has been obtained recently. This is a…

A subset $S$ of vertices in a planar graph $G$ is a free set if, for every set $P$ of $|S|$ points in the plane, there exists a straight-line crossing-free drawing of $G$ in which vertices of $S$ are mapped to distinct points in $P$. In…

Let $w\in\mathbf F_k$ be a non-trivial word and denote by $w(G)\subseteq G$ the image of the associated word map $w\colon G^k\to G$. Let $G$ be one of the finite groups ${\rm S}_n,{\rm GL}_n(q),{\rm Sp}_{2m}(q),{\rm GO}_{2m}^\pm(q),{\rm…

Let $G$ and $H$ be two simple graphs. A bijection $\phi:V(G)\rightarrow V(H)$ is called an isomorphism between $G$ and $H$ if $(\phi v_i)(\phi v_j)\in E(H)$ $\Leftrightarrow$ $v_i v_j\in E(G)$, $\forall v_i,v_j \in V(G)$. In the case that…

A 1-factor of a hypergraph $G=(X,W)$ is a set of hyperedges such that every vertex of $G$ is incident to exactly one hyperedge from the set. A 1-factorization is a partition of all hyperedges of $G$ into disjoint 1-factors. The adjacency…

We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s…

We consider metric graph Gaussian free field (GFF) defined on polygons of $\delta\mathbb{Z}^2$ with alternating boundary data. The crossing probabilities for level-set percolation of metric graph GFF have scaling limits. When the boundary…

One version of the classical Lefschetz hyperplane theorem states that for $U \subset \mathbb P^n$ a smooth quasi-projective variety of dimension at least $2$, and $H \cap U$ a general hyperplane section, the resulting map on \'etale…

Since planar triangle-free graphs are 3-colourable, such a graph with n vertices has an independent set of size at least n/3. We prove that unless the graph contains a certain obstruction, its independence number is at least n/(3-epsilon)…

Given any $\epsilon >0$ and any planar region $\Omega$ bounded by a simple n-gon $P$ we construct a ($1 + \epsilon)$-quasiconformal map between $\Omega$ and the unit disk in time $C(\epsilon)n$. One can take $ C(\epsilon) = C + C \log…

Given a partition $V_1 \sqcup V_2 \sqcup \dots \sqcup V_m$ of the vertex set of a graph, we are interested in finding multiple disjoint independent sets that contain the correct fraction of vertices of each $V_j$. We give conditions for the…

In this work we prove general bounds for the diameter of random graphs generated by a preferential attachment model whose parameter is a function $f:\mathbb{N}\to[0,1]$ that drives the asymptotic proportion between the numbers of vertices…

An internal or friendly partition of a vertex set $V(G)$ of a graph $G$ is a partition to two nonempty sets $A\cup B$ such that every vertex has at least as many neighbours in its own class as in the other one. Motivated by Diwan's…

In this work we compare the semialgebraic subsets that are images of regulous maps with those that are images of regular maps. Recall that a map f : R n $\rightarrow$ R m is regulous if it is a rational map that admits a continuous…