English
Related papers

Related papers: On the crossing estimates for simple conformal loo…

200 papers

We investigate a class of odd (ramification) coverings $C \to \mathbb{P}^1$ where $C$ is hyperelliptic, its Weierstrass points maps to one fixed point of $\mathbb{P}^1$ and the covering map makes the hyperelliptic involution of $C$ commute…

Algebraic Geometry · Mathematics 2020-11-25 Riccardo Moschetti , Gian Pietro Pirola

We show that by cutting off the vertices and then the edges of neighborly cubical polytopes, one obtains simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log^{3/2}n)$. This…

Metric Geometry · Mathematics 2015-10-05 Lauri Loiskekoski , Günter M. Ziegler

We prove the "Sullivan Conjecture" on the classification of 4-dimensional complete intersections up to diffeomorphism. Here an $n$-dimensional complete intersection is a smooth complex variety formed by the transverse intersection of $k$…

Geometric Topology · Mathematics 2025-02-11 Diarmuid Crowley , Csaba Nagy

A competition model on $\N^{2}$ between three clusters and governed by directed last passage percolation is considered. We prove that coexistence, i.e. the three clusters are simultaneously unbounded, occurs with probability $6-8\log2$.…

Probability · Mathematics 2010-07-06 David Coupier , Philippe Heinrich

A simplicial complex is $r$-conic if every subcomplex of at most $r$ vertices is contained in the star of a vertex. A $4$-conic complex is simply connected. We prove that an $8$-conic complex is $2$-connected. In general a $(2n+1)$-conic…

Algebraic Topology · Mathematics 2021-03-09 Jonathan A. Barmak

A doubling covering $\U$ of a complex $n$-dimensional manifold $Y$ consists of analytic functions $\psi_j:B_1\to Y$, each function being analytically extendable, as a mapping to $Y$, to a four times larger concentric ball $B_4$. Main result…

Classical Analysis and ODEs · Mathematics 2016-06-29 Omer Friedland , Yosef Yomdin

We determine the algebraic structure of the multiplicative loops for locally compact $2$-dimensional topological connected quasifields. In particular, our attention turns to multiplicative loops which have either a normal subloop of…

Rings and Algebras · Mathematics 2015-07-07 Giovanni Falcone , Ágota Figula , Karl Strambach

In this paper, we consider Bernoulli percolation on a locally finite, transitive and infinite graph (e.g. the hypercubic lattice $\mathbb{Z}^d$). We prove the following estimate, where $\theta_n(p)$ is the probability that there is a path…

Probability · Mathematics 2023-04-25 Hugo Vanneuville

We prove that critical percolation has no infinite clusters almost surely on any unimodular quasi-transitive graph satisfying a return probability upper bound of the form $p_n(v,v) \leq \exp\left[-\Omega(n^\gamma)\right]$ for some…

Probability · Mathematics 2019-09-12 Jonathan Hermon , Tom Hutchcroft

Let $G$ be a multigraph with $n$ vertices and $e>4n$ edges, drawn in the plane such that any two parallel edges form a simple closed curve with at least one vertex in its interior and at least one vertex in its exterior. Pach and T\'oth (A…

Combinatorics · Mathematics 2021-10-20 Michael Kaufmann , Janos Pach , Geza Toth , Torsten Ueckerdt

Given $\omega\ge 1$, let $Z^2_{(\omega)}$ be the graph with vertex set $Z^2$ in which two vertices are joined if they agree in one coordinate and differ by at most $\omega$ in the other. (Thus $Z^2_{(1)}$ is precisely $Z^2$.) Let…

Probability · Mathematics 2009-05-08 Bela Bollobas , Svante Janson , Oliver Riordan

We study the crossing number of links that are formed by edges of a triangulation T of the 3-sphere with n tetrahedra. We show that the crossing number is bounded from above by an exponential function of n^2. In general, this bound can not…

Geometric Topology · Mathematics 2007-05-23 Simon A. King

In a recent article on overpartitions, Merca considered the auxiliary function $a(n)$ which counts the number of partitions of $n$ where odd parts are repeated at most twice (and there are no restrictions on the even parts). In the course…

Number Theory · Mathematics 2025-08-11 James A. Sellers

We report a combined theoretical and experimental investigation of the superconducting state in the quasi-two-dimensional organic superconductor $\kappa$-(ET)$_2$Cu[N(CN)$_2$]Br. Applying spin-fluctuation theory to a low-energy…

Continuing the investigation for the number of crossing limit cycles of nonsmooth Li\'enard systems in [Nonlinearity 21(2008), 2121-2142] for the case of a unique equilibrium, in this paper we consider the case of any number of equilibria.…

Dynamical Systems · Mathematics 2020-10-28 Tao Li , Hebai Chen , Xingwu Chen

We consider the measure on multiple chordal Schramm-Loewner evolution ($SLE_\kappa$) curves. We establish a derivative estimate and use it to give a direct proof that the partition function is $C^2$ if $\kappa<4$.

Probability · Mathematics 2018-11-14 Mohammad Jahangoshahi , Gregory F. Lawler

We use the principle of maximal transcendentality and the universal nature of subleading infrared poles to extract the analytic value of the four-loop collinear anomalous dimension in planar ${\cal N}=4$ super-Yang-Mills theory from recent…

High Energy Physics - Theory · Physics 2018-02-14 Lance J. Dixon

In this note we investigate the existence of frames of exponentials for $L^2(\Omega)$ in the setting of LCA groups. Our main result shows that sub-multitiling properties of $\Omega \subset \widehat{G}$ with respect to a uniform lattice…

Classical Analysis and ODEs · Mathematics 2017-10-10 Davide Barbieri , Carlos Cabrelli , Eugenio Hernández , Peter Luthy , Ursula Molter , Carolina Mosquera

We provide an alternative, simpler proof of the existence of thick triangulations for noncompact $\mathcal{C}^1$ manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary…

Geometric Topology · Mathematics 2010-05-12 Emil Saucan , Meir Katchalski

In 1985, Razborov discovered a proof that the monotone circuit complexity of the clique problem is super-polynomial. Alon and Boppana improved the result into exponential lower bound exp(\Omega(n / \log n)^{1/3})) of a monotone circuit C to…

Computational Complexity · Computer Science 2013-09-10 Junichiro Fukuyama