Related papers: Strong Pseudo Primes to Base 2
In this note, we construct dual PBW bases of the positive and negative subalgebras of the two-parameter quantum groups $U_{r,s}(\mathfrak{g})$ in classical types, as used in our earlier work arXiv:2407.01450. Following the ideas of Leclerc…
We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…
Central to the theory of special cube complexes is Haglund and Wise's construction of the canonical completion and retraction, which enables one to build finite covers of special cube complexes in a highly controlled manner. In this paper…
We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construc-tion uses a single linear differential form defined from the…
Let p>2 be prime. We complete the proof of the weight part of Serre's conjecture for rank two unitary groups for mod p representations in the totally ramified case, by proving that any weight which occurs is a predicted weight. Our methods…
In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the…
In probabilistic cloning with two auxiliary systems, we consider and compare three different protocols for the success probabilities of cloning. We show that, in certain circumstances, it may increase the success probability to add an…
Mathematicians has been trying to prove the weak Goldbach's conjecture by adding prime numbers, as stated in the conjecture. However, we believe that the solution does not need to be analytically solved. Instead of trying to add prime…
We prove several supercongruences involving the harmonic number of order two $H_n^{(2)}:=\sum_{k=1}^n1/k^2$. For example, if $p>5$ is prime and $\alpha$ is $p$-integral, then we can completely determine $$…
Mutually unbiased bases that can be cyclically generated by a single unitary operator are of special interest, since they can be readily implemented in practice. We show that, for a system of qubits, finding such a generator can be cast as…
In this paper we deal with optimality conditions that can be verified by a nonlinear optimization algorithm, where only a single Lagrange multiplier is avaliable. In particular, we deal with a conjecture formulated in [R. Andreani, J.M.…
We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for…
Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…
Given a prime power $p^d$ with $p$ a prime and $d$ a positive integer, we classify the finite groups $G$ with $p^{2d}$ dividing $|G|$ in which all subgroups of order $p^d$ are complemented and the finite groups $G$ having a normal…
A set $\mathcal{A}$ is said to be an additive $h$-basis if each element in $\{0,1,\ldots,hn\}$ can be written as an $h$-sum of elements of $\mathcal{A}$ in {\it at least} one way. We seek multiple representations as $h$-sums, and, in this…
The sum-product algorithm for decoding of binary codes is analyzed for bipartite graphs in which the check nodes all have degree $2$. The algorithm simplifies dramatically and may be expressed using linear algebra. Exact results about the…
In a recent article, Apagodu and Zeilberger (http://arxiv.org/abs/1606.03351)discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the…
When the obstacle problem of clamped Kirchhoff plates is discretized by a partition of unity method, the resulting discrete variational inequalities can be solved by a primal-dual active set algorithm. In this paper we develop and analyze…
We consider the simulation of distributions that are a mixture of discrete and continuous components. We extend a Metropolis-Hastings-based perfect sampling algorithm of Corcoran and Tweedie to allow for a broader class of transition…