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

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

We study inequalities between general integral moduli of continuity of a function and the tail integral of its Fourier transform. We obtain, in particular, a refinement of a result due to D. B. H. Cline [2] (Theorem 1.1 below). We note that…

It is well-known that Lagrange's four-square theorem, stating that every natural number may be written as the sum of four squares, may be proved using methods from the classical theory of modular forms and theta functions. We revisit this…

We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant `true' by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform…

We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…

We prove a uniform effective density theorem as well as an effective counting result for a generic system comprising a polynomial with a mild homogeneous condition and several linear forms using Roger's second moment formula for the Siegel…

We use a toy model to illustrate how to build effective theories for singular potentials. We consider a central attractive 1/r^2 potential perturbed by a 1/r^4 correction. The power-counting rule, an important ingredient of effective…

In this work, we develop a formal system of inductive logic. It uses an infinitary language that allows for countable conjunctions and disjunctions. It is based on a set of nine syntactic rules of inductive inference, and contains classical…

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

We generalize a recent result of Clausen: For a number field with integers O, we compute the K-theory of locally compact O-modules. For the rational integers this recovers Clausen's result as a special case. Our method of proof is quite…

A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…

Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time…

We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead of clauses. We demonstrate polynomial-size refutations for…

Let $\mathcal{F}=\{F_1,F_2, \ldots,F_n\}$ be a family of $n$ sets on a ground set $S$, such as a family of balls in $\mathbb{R}^d$. For every finite measure $\mu$ on $S$, such that the sets of $\mathcal{F}$ are measurable, the classical…

After reviewing a large body of literature on the modeling of bivariate discrete distributions with finite support, \cite{Gee20} made a compelling case for the use of $I$-projections in the sense of \cite{Csi75} as a sound way to attempt to…

We study the logical content of several maximality principles related to the finite intersection principle ($F\IP$) in set theory. Classically, these are all equivalent to the axiom of choice, but in the context of reverse mathematics their…

We construct an injection from the set of permutations of length $n$ that contain exactly one copy of the decreasing pattern of length $k$ to the set of permutations of length $n+2$ that avoid that pattern. We then prove that the generating…

Applying Robert Boltje's theory of canonical induction, we give a restriction-preserving formula expressing any $p$-permutation module as a $\mathbb{Z}[1/p]$-linear combination of modules induced and inflated from projective modules…

We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluation algorithm. We prove completeness and soundness of the…

Many experiments are concerned with the comparison of counts between treatment groups. Examples include the number of successful signups in conversion rate experiments, or the number of errors produced by software versions in canary…