Related papers: Ackermann and Goodstein go functorial
We discuss two variations of Edwards' duality theorem. More precisely, we prove one version of the theorem for cones not necessarily containing all constant functions. In particular, we allow the functions in the cone to have a non-empty…
We study criteria for a ring - or more generally, for a small category - to be Gorenstein and for a module over it to be of finite projective dimension. The goal is to unify the universal coefficient theorems found in the literature and to…
A natural higher K-theoretic analogue of the triviality of vector bundles on affine toric varieties is the conjecture on nilpotence of the multiplicative action of the natural numbers on the K-theory of these varieties. This includes both…
For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…
Taking matrix as a synonym for a numerical function on the Cartesian product of two (in general, infinite) sets, a simple purely algebraic "reciprocity property" says that the set of rows spans a finite-dim space iff the set of columns does…
Artstein-Avidan and Milman [Annals of mathematics (2009), (169):661-674] characterized invertible reverse-ordering transforms on the space of lower semi-continuous extended real-valued convex functions as affine deformations of the ordinary…
A theory of recursive definitions has been mechanized in Isabelle's Zermelo-Fraenkel (ZF) set theory. The objective is to support the formalization of particular recursive definitions for use in verification, semantics proofs and other…
We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…
The aim of this paper is to give an effective version of the Strong Artin Approximation Theorem for binomial equations. First we give an effective version of the Greenberg Approximation Theorem for polynomial equations, then using the…
Ginzburg, Guay, Opdam and Rouquier established an equivalence of categories between a quotient category of the category $\mathcal{O}$ for the rational Cherednik algebra and the category of finite dimension modules of the Hecke algebra of a…
We propose definitions of regular and exact (virtual) double categories, proving a number of results which parallel many basic results in the theory of regular and exact categories. We show that any regular virtual double category admits a…
We analyze Ekeland's variational principle in the context of reverse mathematics. We find that that the full variational principle is equivalent to $\Pi^1_1$-${\sf CA}_0$, a strong theory of second-order arithmetic, while natural…
We study the ring of arithmetical functions with unitary convolution, giving an isomorphism to a generalized power series ring on infinitely many variables, similar to the isomorphism of Cashwell-Everett between the ring of arithmetical…
Given an abelian category, we introduce a categorical concept of (strongly) Gorenstein projective (resp., injective) objects, by defining a new special class of objects. Then we study the transfer of these properties when passing to an…
For any additive functor from modules (or, more generally, from an abelian category with enough projectives or injectives), we construct long sequences tying up together the derived functors, the satellites, and the stabilizations of the…
The original Goodstein process proceeds by writing natural numbers in nested exponential $k$-normal form, then successively raising the base to $k+1$ and subtracting one from the end result. Such sequences always reach zero, but this fact…
Extending G\"odel's \emph{Dialectica} interpretation, we provide a functional interpretation of classical theories of positive arithmetic inductive definitions, reducing them to theories of finite-type functionals defined using transfinite…
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…
Continuity is one of the most central notions in mathematics, physics, and computer science. An interesting associated topic is decompositions of continuity, where continuity is shown to be equivalent to the combination of two or more weak…
We interpret the "explicit formula" in the sense of analytic number theory for the zeta function of an ordinary abelian variety of dimension g over a finite field as a transversal index theorem on a (2g+1)-dimensional Riemannian foliated…