We investigate the bond percolation model on transient weighted graphs ${G}$ induced by the excursion sets of the Gaussian free field on the corresponding metric graph. We assume that balls in ${G}$ have polynomial volume ...

We provide quantitative results on the asymptotic behavior of Dykstra’s algorithm with Bregman projections, a combination of the well-known Dykstra’s algorithm and the method of cyclic Bregman projections, designed to find ...

The classic Ky Fan theorem is a combinatorial equivalent of Borsuk-Ulam theorem. It is a generalization and extension of Tucker’s lemma and, just like its predecessor, it pinpoints important properties of antipodal colorings ...

In a recent proof mining application, the proof-theoretical analysis of Dykstra's cyclic projections algorithm resulted in quantitative information expressed via primitive recursive functionals in the sense of Gödel. This ...

We generalize the alternating Halpern-Mann iteration to countably infinite families of nonexpansive maps and prove its strong convergence towards a common fixed point in the general nonlinear setting of Hadamard spaces. ...

Suppose G is a simple algebraic group defined over an algebraically closed field of good characteristic p. In 2018 Korhonen showed that if H is a connected reductive subgroup of G which contains a distinguished unipotent ...

Let $k$ be a field. We investigate the relationship between subgroups of a pseudo-reductive $k$-group $G$ and its maximal reductive quotient $G'$, with applications to the subgroup structure of $G$. Let $k'/k$ be the minimal ...

We consider the Navier–Stokes–Fourier system with general inhomogeneous Dirichlet–Neumann boundary conditions. We propose a new approach to the local well-posedness problem based on conditional regularity estimates. By ...

We establish the convergence of a speed-up version of the Halpern iteration with adaptive anchoring parameters in the general geodesic setting of Hadamard spaces, generalizing a recent result by He, Xu, Dong and Mei from ...

Let $G$ be a finite simple non-complete connected graph on $[n] = \{1, \ldots, n\}$ and $\kappa(G) \geq 1$ its vertex connectivity. Let $f(G)$ denote the number of free vertices of $G$ and $\mathrm{diam}(G)$ the diameter ...