Related papers: On collection schemes and Gaifman's splitting theo…
For a CM abelian extension $F/K$ of an arbitrary totally real number field $K$, we construct the Stickelberger splitting maps (in the sense of \cite{Ba1}) for both the \'etale and the Quillen $K$--theory of $F$ and we use these maps to…
Recently Peter Keevash solved asymptotically the existence question for Steiner systems by showing that $S(t,k,n)$ exists whenever the necessary divisibility conditions on the parameters are satisfied and $n$ is sufficiently large in terms…
In this paper we show that for every $2\leq n\in \mathbb{N}$, the statement "there is an $n$-entangled set, but there are no $n+1$-entangled sets" is consistent. We also prove some theorems which improve our understanding of entangled sets…
A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…
Completely multiplicative functions whose sum is zero ($CMO$).The paper deals with $CMO$, meaning completely multiplicative ($CM$) functions $f$ such that $f(1)=1$ and $\sum\limits\_1^\infty f(n)=0$. $CM$ means $f(ab)=f(a)f(b)$ for all…
Given data drawn from an unknown distribution, $D$, to what extent is it possible to ``amplify'' this dataset and output an even larger set of samples that appear to have been drawn from $D$? We formalize this question as follows: an…
Even though modularity has been studied extensively in conventional logic programming, there are few approaches on how to incorporate modularity into Answer Set Programming, a prominent rule-based declarative programming paradigm. A major…
In this article we continue our investigation of the Derived Equivalences over noetherian quasi-projective schemes $X$, over affine schemes $\spec{A}$. For integers $k\geq 0$, let $C{\mathbb M}^k(X)$ denote the category of coherent…
We investigate the domain of satisfiable formulas in satisfiability modulo theories (SMT), in particular, automatic generation of a multitude of satisfying assignments to such formulas. Despite the long and successful history of SMT in…
We show that for a wide class of manifold pairs N, M satisfying dim(M) = dim(N) + 1, every \pi_1-injective map f : N --> M factorises up to homotopy as a finite cover of an embedding. This result, in the spirit of Waldhausen's torus…
The Skolem-Mahler-Lech theorem states that if $f(n)$ is a sequence given by a linear recurrence over a field of characteristic 0,then the set of $m$ such that $f(m)$ is equal to 0 is the union of a finite number of arithmetic progressions…
We prove inequalities involving greatest common divisors of functions at integral points with respect to numerically parallel divisors, generalizing a result of Wang and Yasufuku (after work of Bugeaud-Corvaja-Zannier, Corvaja-Zannier, and…
We explain how to obtain new classical integrable field theories by assembling two affine Gaudin models into a single one. We show that the resulting affine Gaudin model depends on a parameter $\gamma$ in such a way that the limit $\gamma…
Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…
We extend the notion of an enumeration scheme developed by Zeilberger and Vatter to the case of vincular patterns (also called "generalized patterns" or "dashed patterns"). In particular we provide an algorithm which takes in as input a set…
We present a method which forces the failure of $\Pi^1_3$ and $\Sigma^1_3$-separation, while $\mathsf{MA} (\mathcal{I}$) holds, for $\mathcal{I}$ the family of indestructible ccc forcings. This shows that, in contrast to the assumption…
We study the distribution of families of multiplicative functions among the coprime residue classes to moduli varying uniformly in a wide range, obtaining analogues of the Siegel--Walfisz Theorem for large classes of multiplicative…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…
We prove lifting theorems for completely positive maps going out of exact $C^\ast$-algebras, where we remain in control of which ideals are mapped into which. A consequence is, that if $\mathsf X$ is a second countable topological space,…