Related papers: Relative decidability and definability in henselia…
In this paper we introduce a new approach to determinant functors which allows us to extend Deligne's determinant functors for exact categories to Waldhausen categories, (strongly) triangulated categories, and derivators. We construct…
We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…
In this article we extend the notion of determinantal representation of hypersurfaces to the determinantal representation of sections of the determinant line bundle of a vector bundle. We give several examples, and prove some necessary…
It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…
Let $K$ be a field of positive characteristic with no algebraically closed subfield. Let $F$ be a function field over $K$ and $t \in F$ transcendental over $K$. Refining a result of Eisentr{\"a}ger and Shlapentokh, we show that there is no…
The axiom of countable choice for reals is one of the most basic fragments of the axiom of choice needed in many parts of mathematics. Descriptive choice principles are a further stratification of this fragment by the descriptive complexity…
Determinantal point processes (DPPs) are well known models for diverse subset selection problems, including recommendation tasks, document summarization and image search. In this paper, we discuss a greedy deterministic adaptation of k-DPP.…
We study a natural variant of the implicational fragment of propositional logic. Its formulas are pairs of conjunctions of positive literals, related together by an implicational-like connective; the semantics of this sort of implication is…
We continue our earlier investigation of dp-finite fields. We show that the "heavy sets" of [6] are exactly the sets of full dp-rank. As a consequence, full dp-rank is a definable property in definable families of sets. If $I$ is the group…
Single-valuedness of the eigenfunctions of the quantised Hitchin Hamiltonians is proposed as a natural quantisation condition. Separation of Variables can be used to relate the classification of eigenstates to the classification of…
I argue that questions of algorithmic decidability, computability and complexity should play a larger role in deciding the "ultimate" theoretical description of the Landscape of string vacua. More specifically, I examine the notion of the…
We investigate the problem of deciding whether a system of linear equations, together with divisibility conditions on the variables, has a solution over holomorphy subrings of global fields. We obtain decidability results when we allow…
In this paper, for a henselian valued field $(K,v)$ of arbitrary rank and an extension $w$ of $v$ to $K(X),$ we use abstract key polynomials for $w$ to obtain distinguished pairs and saturated distinguished chains.
A theorem is derived which determines higher order first integrals of autonomous holonomic dynamical systems in a general space, provided the collineations and the Killing tensors -- up to the order of the first integral -- of the kinetic…
We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…
Kernels are often developed and used as implicit mapping functions that show impressive predictive power due to their high-dimensional feature space representations. In this study, we gradually construct a series of simple feature maps that…
We present an application of elimination theory to the study of singularities over arbitrary fields, particularly to the open problem of resolution. A partial extension of a function, defining resolution of singularities over fields of…
We formulate explicitly the necessary and sufficient conditions for the local invertibility of a field transformation involving derivative terms. Our approach is to apply the method of characteristics of differential equations, by treating…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…
A field $K$ in a ring language $\mathcal{L}$ is finitely undecidable if $\mbox{Cons}(\Sigma)$ is undecidable for every nonempty finite $\Sigma \subseteq \mbox{Th}(K; \mathcal{L})$. We extend a construction of Ziegler and (among other…