Related papers: On $\ell^{p}$-like equivalence relations
The goal of this note is to announce certain results in orbit equivalence theory, especially concerning the approximation of p.m.p. standard equivalence relations by increasing sequence of sub-relations, with applications to the behavior of…
We firstly show that due to their resplendency ordered henselian valued fields admit relative field quantifier elimination in the Denef--Pas language expanded by linear orders in the field and residue field sort. Secondly, we deduce from a…
Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated what algebraic structures can be realised in worlds given by a positive (= recursively enumerable) equivalence relation which partitions the natural numbers into…
In this paper we prove a strong comparison principle for radially decreasing solutions $u,v\in C_{0}^{1,\alpha}(\Bar{B_R})$ of the singular equations $-\Delta_p u-\frac{1}{u^\delta}=f(x)$ and $-\Delta_p v-\frac{1}{v^\delta}=g(x)$ in $B_R$.…
In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the…
A relational structure $\mathbb{X}$ is called reversible iff each bijective homomorphism from $\mathbb{X}$ onto $\mathbb{X}$ is an isomorphism, and linear orders are prototypical examples of such structures. One way to detect new reversible…
The monotonicity of the Mittag-Leffler function $E_{\alpha}$ with respect to the parameter $\alpha$ is investigated, via some convex ordering properties for related random variables. In particular, it is shown that the mapping…
We introduce the notion of groupoid pre-equivalences and prove that they give rise to groupoid equivalences by taking certain quotients. Then, given an equivalence of Fell bundles $\mathscr{B}$ and $\mathscr{C}$ and another equivalence…
Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this…
We consider weak solutions to $$-\Delta_pu+a(x,u)|\nabla u|^q=f(x,u),$$ with $p>1$, $q\geq\max\,\{p-1,1\}$. We exploit the Moser iteration technique to prove a Harnack comparison inequality for $C^1$ weak solutions. As a consequence we…
Assume $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$. Let $E$ be a $\mathbf{\Sigma}^1_1$ equivalence relation coded in $\mathrm{HOD}$. $E$ has an ordinal definable equivalence class without any ordinal definable elements if and only…
The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…
When $p$ is a computable real so that $p \geq 1$, the isometry degree of a computable copy $\mathcal{B}$ of $\ell^p$ is defined to be the least powerful Turing degree that computes a linear isometry of $\ell^p$ onto $\mathcal{B}$. We show…
Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yields a query language for nested relational databases,…
The motivation for this paper comes from the following question on comparison of norms of conformal martingales $X$, $Y$ in $\R^d$, $d\geq 2$. Suppose that $Y$ is differentially subordinate to $X$. For $0<p<\infty$, what is the optimal…
Let $k$ be a perfect field of characteristic $p > 2$, and let $K$ be a finite totally ramified extension over $W(k)[\frac{1}{p}]$. Let $R_0$ be an unramified relative base ring over $W(k)\langle X_1^{\pm 1}, \ldots, X_d^{\pm 1}\rangle$, and…
Answering one of the main questions of [FHK14, Chapter 7], we show that there is a tight connection between the depth of a classifiable shallow theory $T$ and the Borel rank of the isomorphism relation $\cong^\kappa_T$ on its models of size…
We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to consider structures given by their positive atomic diagram…
Let $p$ be a prime number and $\Bbbk=\bar{\mathbb{F}}_p$, the algebraic closure of the finite field $\mathbb{F}_p$ of $p$ elements. Let ${\bf G}$ be a connected reductive group defined over $\mathbb{F}_p$ and ${\bf B}$ be a Borel subgroup…
In this paper we give an extension of the classical Caffarelli-Kohn-Nirenberg inequalities: we show that for $1<p,q<\infty$, $0<r<\infty$ with $p+q\geq r$, $\delta\in[0,1]\cap\left[\frac{r-q}{r},\frac{p}{r}\right]$ with $\frac{\delta…