Related papers: Relative decidability and definability in henselia…

The functional approach to compositional distributional semantics considers transitive verbs to be linear maps that transform the distributional vectors representing nouns into a vector representing a sentence. We conduct an initial…

Kjolstad et. al. proposed a tensor algebra compiler. It takes expressions that define a tensor element-wise, such as $f_{ij}(a,b,c,d) = \exp\left[-\sum_{k=0}^4 \left((a_{ik}+b_{jk})^2\, c_{ii} + d_{i+k}^3 \right) \right]$, and generates the…

With view to applications in stochastic analysis and geometry, we introduce a new correspondence for positive definite kernels (p.d.) $K$ and their associated reproducing kernel Hilbert spaces. With this we establish two kinds of…

In constructive algebra one cannot in general decide the irreducibility of a polynomial over a field K. This poses some problems to showing the existence of the algebraic closure of K. We give a possible constructive interpretation of the…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

The main purpose is to establish two theorems about closed 0-definable subsets $A$ of an affine space $K^{n}$ over a Hensel minimal field $K$. The first, being a non-Archimedean counterpart of one from o-minimal geometry, states that every…

We prove that unstable dp-finite fields admit definable V-topologies. As a consequence, the henselianity conjecture for dp-finite fields implies the Shelah conjecture for dp-finite fields. This gives a conceptually simpler proof of the…

A Killing tensor field on a Riemannian space corresponds to an integral of the geodesic flow polynomial in momenta. A Killing tensor field is called decomposable if it is a polynomial in Killing vector fields. In this paper, we first prove…

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

A note connecting arguments scattered in the extant literature proving that, in any o-minimal expansion of the real field, a definable family of sets has the property that the set of parameters corresponding to finite-volume fibers is…

We define a relative property A for a countable group with respect to a finite family of subgroups. Many characterizations for relative property A are given. In particular a relative bounded cohomological characterization shows that if a…

In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…

This article continues and completes our previous work [14] J. Phys. Commun. 2 (2018) 025007. First of all, we present two methods of quantization associated with a linear connection given on a differentiable manifold, one of them being the…

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…

We provide axiomatization and relative quantifier elimination for valued fields equipped with an automorphism, in residue characteristic zero. Similar results are known under strong assumptions on the interaction between the automorphism…

In this paper, a new kind of resultant, called the determinantal resultant, is introduced. This operator computes the projection of a determinantal variety under suitable hypothesis. As a direct generalization of the resultant of a very…

Let $\mathcal M=\langle K;O\rangle$ be a real closed valued field and let $k$ be its residue field. We prove that every interpretable field in $\mathcal M$ is definably isomorphic to either $K$, $K(\sqrt{-1})$, $k$, or $k(\sqrt{-1})$. The…

The article describes a purely topological counterpart of the $\epsilon$-factorization of constants in the functional equations (which is a key ingredient in the interplay between L-functions and classical automorphic forms). We consider…

We study reductions well suited to compare structures and classes of structures with respect to properties based on enumeration reducibility. We introduce the notion of a positive enumerable functor and study the relationship with…