Related papers: Corona Decompositions for Parabolic Uniformly Rect…

Given a finite connected simple graph $\Gamma$, and a subgroup $G$ of its automorphism group, a general method for finding all finite abelian regular coverings of $\Gamma$ that admit a lift of each element of $G$ is developed. As an…

In this paper continuing our work started in our earlier papers we prove the corona theorem for the algebra of bounded holomorphic functions defined on an unbranched covering of a Caratheodory hyperbolic Riemann surface of finite type.

We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random $k$-uniform hypergraph $H_{n,p;k}$, for a wide range of $p$. We also show that it is solvable w.h.p. for random…

$M$ is a cpt. Riemannian manifold without boundary, $f\in\mathrm{Diff}^{1+\beta}(M)$. In [Sarig13], for all $\chi>0$, for every small enough $\epsilon>0$, Sarig had first constructed a coding $\widehat{\pi}:\widehat{\Sigma}\rightarrow M$…

In this short note, we establish a quantitative description of the genericity of transversality of $C^1$-submanifolds in $\mathbb{R}^n$: Let $\Sigma \subset \mathbb{R}^n$ be a $d$-dimensional $C^1$-embedded submanifold where $n \geq d+1$.…

Let $G$ be $\SO(n,1)$ or $\SU(n,1)$ and let $\Gamma\subset G$ denote an arithmetic lattice. The hyperbolic manifold $\Gamma\backslash \calH$ comes with a natural family of covers, coming from the congruence subgroups of $\Gamma$. In many…

In this paper we consider the uniformly resolvable decompositions of the complete graph $K_v$, or the complete graph minus a 1-factor as appropriate, into subgraphs such that each resolution class contains only blocks isomorphic to the same…

We introduce the normalising graph of a group and study the connectivity of the normalising and permuting graphs of a group when the group is finite and soluble. In particular, we classify finite soluble groups with disconnected normalising…

In this work it is shown that the SD-KE decomposition is multiplicative under determinantal-type functions for graphs with perfect matchings, providing a new tool for the study of unimodular and singular matchable graphs.

In this note, we prove that every even regular multigraph on $n$ vertices with multiplicity at most $r$ and minimum degree at least $rn/2 + o(n)$ has a Hamilton decomposition. This generalises a result of Vaughan who proved an asymptotic…

Let $G$ be a real reductive Lie group, $L$ a compact subgroup, and $\pi$ an irreducible admissible representation of $G$. In this article we prove a necessary and sufficient condition for the finiteness of the multiplicities of $L$-types…

In this manuscript, we study geometric regularity estimates for degenerate parabolic equations of $p$-Laplacian type ($2 \leq p< \infty$) under a strong absorption condition: $ \Delta_p u - \frac{\partial u}{\partial t} = \lambda_0 u_{+}^q…

Tukia and Vaisala showed that every quasi-conformal map of $\R^n$ extends to a quasi-conformal self-map of $\R^{n+1}$. The restriction of the extended map to the upper half-space $\R^n \times \R^+$ is, in fact, bi-Lipschitz with respect to…

A graph is strongly even-cycle decomposable if the edge set of every subdivision with an even number of edges can be partitioned into cycles of even length. We prove that several fundamental composition operations that preserve the property…

We prove that the Fermi surface of a connected doubly periodic self-adjoint discrete graph operator is irreducible at all but finitely many energies provided that the graph (1) can be drawn in the plane without crossing edges (2) has…

We introduce in a general setting a dynamic programming method for solving reconfiguration problems. Our method is based on contracted solution graphs, which are obtained from solution graphs by performing an appropriate series of edge…

A Hamilton cycle in a graph $\Gamma$ is a cycle passing through every vertex of $\Gamma$. A Hamiltonian decomposition of $\Gamma$ is a partition of its edge set into disjoint Hamilton cycles. One of the oldest results in graph theory is…

We present a simple, new method for the 1-loop renormalization of integrable $\sigma$-models. By treating equations of motion and Bianchi identities on an equal footing, we derive 'universal' formulae for the 1-loop on-shell divergences,…

We establish symmetrization results for the solutions of the linear fractional diffusion equation $\partial_t u +(-\Delta)^{\sigma/2}u=f$ and itselliptic counterpart $h v +(-\Delta)^{\sigma/2}v=f$, $h>0$, using the concept of comparison of…

We show that for $n\ge2$, if a partially hyperbolic diffeomorphism $f:\mathbb T^{n+1}\to \mathbb T^{n+1}$ with $\dim E^s=\dim E^c=1$ has an invariant center-unstable foliation with a compact incompressible leaf, then this foliation has a…