Related papers: On some $\Sigma^{B}_{0}$-formulae generalizing cou…

We classify indecomposable pure injective modules over domestic string algebras, verifying Ringel's conjecture on the structure of such modules.

Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a…

In introductory books about natural numbers, a common kind of assertion - often left as exercise to the reader - is that certain forms of induction on $\mathbb{N}$ (regular/ordinary, complete/strong) are equivalent one to each other and to…

We show that the theory $I\Sigma_1$ of $\Sigma_1$-induction proves the following statement: For all $n\geq 2$, the uniform $\Sigma_1$-reflection principle over the theory $I\Sigma_n$ is equivalent to the totality of the function…

We give a family of congruences for the binomial coefficients ${kp-1\choose p-1}$ in terms of multiple harmonic sums, a generalization of the harmonic numbers. Each congruence in this family (which depends on an additional parameter $n$)…

For most purposes, one can replace the use of Rolle's theorem and the mean value theorem, which are not constructively valid, by the law of bounded change. The proof of two basic results in numerical analysis, the error term for Lagrange…

We give a general reduction of lengths-of-proofs lower bounds for constant depth Frege systems in DeMorgan language augmented by a connective counting modulo a prime $p$ (the so called $AC^0[p]$ Frege systems) to computational complexity…

In this paper, we propose to learn sources independence in order to choose the appropriate type of combination rules when aggregating their beliefs. Some combination rules are used with the assumption of their sources independence whereas…

Unlike classical and free independence, the boolean and monotone notions of independence lack of the property of independent constants. In the scalar case, this leads to restrictions for the central limit theorems, as observed by F.…

In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…

For each prime number $p$ and each integer $g \geqslant 5$, we construct infinitely many abelian varieties of dimension $g$ over $\overline{\mathbb{F}}_p$ satisfying the standard conjecture of Hodge type. The main tool is a recent theorem…

We show that the Hodge and pole order filtrations are globally different for sufficiently general singular projective hypersurfaces in case the degree is 3 or 4 assuming the dimension of the projective space is at least 5 or 3 respectively.…

The minimization principle $\textsf{MIN}(\triangleleft)$ studied in bounded arithmetic says that a strict linear ordering $\triangleleft$ on any finite interval $[0,\dots,n)$ has the minimal element. We shall prove that bounded arithmetic…

We conclude from Goedel's Theorem VII of his seminal 1931 paper that every recursive function f(x_{1}, x_{2}) is representable in the first-order Peano Arithmetic PA by a formula [F(x_{1}, x_{2}, x_{3})] which is algorithmically verifiable,…

The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…

We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…

It is known that, in univalent mathematics, type universes, the type of $n$-types in a universe, reflective subuniverses, and the underlying type of any algebra of the lifting monad are all (algebraically) injective. Here, we further show…

Let X be a countably infinite set, and let f, g, and h be any three injective self-maps of X, each having at least one infinite cycle. (For instance, this holds if f, g, and h are not bijections.) We show that there are permutations a and b…

Let $P_1,\dots,P_k \colon {\bf Z} \to {\bf Z}$ be polynomials of degree at most $d$ for some $d \geq 1$, with the degree $d$ coefficients all distinct, and admissible in the sense that for every prime $p$, there exists integers $n,m$ such…

The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…