Related papers: The transition constant for arithmetic hyperbolic …

We use isoperimetric inequalities combined with a new technique to prove upper bounds for the site percolation threshold of plane graphs with given minimum degree conditions. In the process we prove tight new isoperimetric bounds for…

Since the control of the Lipschitz constant has a great impact on the training stability, generalization, and robustness of neural networks, the estimation of this value is nowadays a real scientific challenge. In this paper we introduce a…

We prove an analog of Cartan's theorem, saying that the chain-preserving transformations of the boundary of the quaternionic hyperbolic spaces are projective transformations. We give a counting and equidistribution result for the orbits of…

We suggest that the transition to superconductivity in a single crystal of Ba_{0.6}K_{0.4}BiO_3 with a T_c = 32K, and having critical fields with anomalous temperature dependencies and vanishing discontinuities in specific heat and magnetic…

In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense enough graph with $m$ edges and $\Sigma$ is a surface of genus…

Given a finite graph of relatively hyperbolic groups with its fundamental group relatively hyperbolic and edge groups quasi-isometrically embedded and relatively quasiconvex in vertex groups, we prove that vertex groups are relatively…

We develop a full microscopic replica field theory of the dynamical transition in glasses. By studying the soft modes that appear at the dynamical temperature we obtain an effective theory for the critical fluctuations. This analysis leads…

Many geometric structures associated to surface groups can be encoded in terms of invariant cross ratios on their circle at infinity; examples include points of Teichm\"uller space, Hitchin representations and geodesic currents. We add to…

Motivated by a recent argument that the superconducting (SC) transition field of three-dimensional (3D) disordered superconductors with granular structure in a nonzero magnetic field should lie above $H_{c2}(0)$ in low $T$ limit, the glass…

The classical Crossing Lemma by Ajtai et al.~and Leighton from 1982 gave an important lower bound of $c \frac{m^3}{n^2}$ for the number of crossings in any drawing of a given graph of $n$ vertices and $m$ edges. The original value was $c=…

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…

The transition constant for the hadronic decay $\omega \rightarrow \rho\pi$ is investigated by means of QCD sum rules in external axial field. The obtained value for $g_{\omega\rho\pi}$ is about 16 GeV${}^{-1}$ that is in a good agreement…

In this paper we derive an explicit lower bound on the volume of a hyperbolic $n$-orbifold for dimensions greater than or equal to four. Our main tool is H. C. Wang's bound on the radius of a ball embedded in the fundamental domain of a…

The famous Dirac's Theorem gives an exact bound on the minimum degree of an $n$-vertex graph guaranteeing the existence of a hamiltonian cycle. We prove exact bounds of similar type for hamiltonian Berge cycles in $r$-uniform, $n$-vertex…

The glass transition can simply be viewed as the point at which the viscosity of a structurally disordered liquid reaches 10^{13} Poise [1]. This definition is operational but it sidesteps fundamental controversies about the glass: Is the…

Baader, J\"org, and Parlier recently established an upper bound for the crossing number of curve systems of size $m\asymp g^{1+\alpha}$ on a genus $g$ surface, obtaining a leading coefficient of $9/4=2.25$. Their construction relies on…

The crossing number of a graph G is the minimum number of pairwise intersections of edges in a drawing of G. Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper bound on the crossing…

This is an announcement of some of the results obtained as a part of the second author's Ph.D. thesis. In the first part, we prove that the fundamental group of an acylindrical complex of hyperbolic groups with finite edge groups is…

The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…

We study a family of complex representations of the group GL(n,O), where O is the ring of integers of a non-archimedean local field F. These representations occur in the restriction of the Grassmann representation of GL(n,F) to its maximal…