Related papers: Stronger arithmetic equivalence
We propose a new method for solution of the integrability problem for evolutionary differential-difference equations of arbitrary order. It enables us to produce necessary integrability conditions, to determine whether a given equation is…
We construct, for imaginary quadratic number fields with class number 1, an arithmetic site of Connes-Consani type. The main difficulty here is that the constructions of Connes and Consani and part of their results strongly rely on the…
We prove a new inequality which improves on the classical Hardy inequality in the sense that a nonlinear integral quantity with super-quadratic growth, which is computed with respect to an inverse square weight, is controlled by the energy.…
The hyperbolicity statements for subvarieties and complements of hypersurfaces in abelian varieties admit arithmetic analogues, due to Faltings (and Vojta for the semi-abelian case). In Atti Accad. Naz. Lincei Rend. Lincei Mat. Appl. 29…
The objective quantification of similarity between two mathematical structures constitutes a recurrent issue in science and technology. In the present work, we developed a principled approach that took the Kronecker's delta function of two…
We construct the geometric Satake equivalence for quasi-split reductive groups over nonarchimedean local fields, using \'etale Artin-Tate motives with $\mathbb{Z}[\frac{1}{p}]$-coefficients. We consider local fields of both equal and mixed…
Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…
Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…
In a recent paper \cite{HuXi3}, we introduced a classes of derived equivalences called almost $\nu$-stable derived equivalences. The most important property is that an almost $\nu$-stable derived equivalence always induces a stable…
This paper studies when an arithmetical equivalence relation $E$ can be realized as the connectedness relation of a graph $G$ which is simpler to define than $E$. Several examples of such equivalence relations are established. In…
The aim of this work is to study comparability of nonlocal Dirichlet forms. We provide sufficient conditions on the kernel for local and global comparability. As an application we prove a-priori estimates in H\"{o}lder spaces for solutions…
We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…
Recently, the author defined multiple Dedekind zeta values [5] associated to a number K field and a cone C. These objects are number theoretic analogues of multiple zeta values. In this paper we prove that every multiple Dedekind zeta value…
We study the Northcott and Bogomolov property for special values of Dedekind $\zeta$-functions at real values $\sigma \in \mathbb{R}$. We prove, in particular, that the Bogomolov property is not satisfied when $\sigma \geq \frac{1}{2}$. If…
It is known that two number fields with the same Dedekind zeta function are not necessarily isomorphic. The zeta function of a number field can be interpreted as the partition function of an associated quantum statistical mechanical system,…
Let $X$ be a smooth projective variety of dimension $n$ over the algebraic closure of a finite field $\mathbb{F}_p$. Assuming the standard conjecture $D$, we prove a weaker form of the Dynamical Degree Comparison conjecture; equivalence of…
The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…
We study the algorithmic complexity of embeddings between bi-embeddable equivalence structures. We define the notions of computable bi-embeddable categoricity, (relative) $\Delta^0_\alpha$ bi-embeddable categoricity, and degrees of…
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
An analog of Nadel's effective bound for the continuous Scott rank of metric structures, developed by Ben Yaacov, Doucha, Nies, and Tsankov, will be established: Let $\mathscr{L}$ be a language of continuous logic with code…