Universal Equivalence and Majority of Probabilistic Programs over Finite Fields

We study decidability problems for equivalence of probabilistic programs for a core probabilistic programming language over finite fields of fixed characteristic. The programming language supports uniform sampling, addition, multiplication, and conditionals and thus is sufficiently expressive to encode Boolean and arithmetic circuits. We consider two variants of equivalence: The first one considers an interpretation over the finite field F q , while the second one, which we call universal equivalence, verifies equivalence over all extensions F q k of F q . The universal variant typically arises in provable cryptography when one wishes to prove equivalence for any length of bitstrings, i.e., elements of F 2 k for any k . While the first problem is obviously decidable, we establish its exact complexity, which lies in the counting hierarchy. To show decidability and a doubly exponential upper bound of the universal variant, we rely on results from algorithmic number theory and the possibility to compare local zeta functions associated to given polynomials. We then devise a general way to draw links between the universal probabilistic problems and widely studied problems on linear recurrence sequences. Finally, we study several variants of the equivalence problem, including a problem we call majority, motivated by differential privacy. We also define and provide some insights about program indistinguishability, proving that it is decidable for programs always returning 0 or 1.

A Quadruple Integral Involving Chebyshev Polynomials Tn(x): Derivation and Evaluation

The aim of the current document is to evaluate a quadruple integral involving the Chebyshev polynomial of the first kind Tn(x) and derive in terms of the Hurwitz-Lerch zeta function. Special cases are evaluated in terms of fundamental constants. The zero distribution of almost all Hurwitz-Lerch zeta functions is asymmetrical. All the results in this work are new.

Zeta functions of the 3-dimensional almost-Bieberbach groups

The subgroup zeta function and the normal zeta function of a finitely generated virtually nilpotent group can be expressed as finite sums of Dirichlet series admitting Euler product factorization. We compute these series except for a finite number of local factors when the group is virtually nilpotent of Hirsch length 3. We deduce that they can be meromorphically continued to the whole complex plane and that they satisfy local functional equations. The complete computation (with no exception of local factors) is presented for those groups that are also torsion-free, that is, for the 3-dimensional almost-Bieberbach groups.

Density of type-dependent sets in Krull monoids with analytic structure

We describe structural and quantitative properties of type-dependent sets in monoids with suitable analytic structure, including simple analytic monoids, introduced by Kaczorowski (Semigroup Forum 94:532–555, 2017. 10.1007/s00233-016-9778-9), and formations, as defined by Geroldinger and Halter-Koch (Non-unique factorizations, Chapman and Hall, Boca Raton, 2006. 10.1201/9781420003208). We propose the notions of rank and degree to measure the size of a type-dependent set in structural terms. We also consider various notions of regularity of type-dependent sets, related to the analytic properties of their zeta functions, and obtain results on the counting functions of these sets.

Along the Lines of Nonadditive Entropies: q-Prime Numbers and q-Zeta Functions

The rich history of prime numbers includes great names such as Euclid, who first analytically studied the prime numbers and proved that there is an infinite number of them, Euler, who introduced the function ζ(s)≡∑n=1∞n−s=∏pprime11−p−s, Gauss, who estimated the rate at which prime numbers increase, and Riemann, who extended ζ(s) to the complex plane z and conjectured that all nontrivial zeros are in the R(z)=1/2 axis. The nonadditive entropy Sq=k∑ipilnq(1/pi)(q∈R;S1=SBG≡−k∑ipilnpi, where BG stands for Boltzmann-Gibbs) on which nonextensive statistical mechanics is based, involves the function lnqz≡z1−q−11−q(ln1z=lnz). It is already known that this function paves the way for the emergence of a q-generalized algebra, using q-numbers defined as ⟨x⟩q≡elnqx, which recover the number x for q=1. The q-prime numbers are then defined as the q-natural numbers ⟨n⟩q≡elnqn(n=1,2,3,⋯), where n is a prime number p=2,3,5,7,⋯ We show that, for any value of q, infinitely many q-prime numbers exist; for q≤1 they diverge for increasing prime number, whereas they converge for q>1; the standard prime numbers are recovered for q=1. For q≤1, we generalize the ζ(s) function as follows: ζq(s)≡⟨ζ(s)⟩q (s∈R). We show that this function appears to diverge at s=1+0, ∀q. Also, we alternatively define, for q≤1, ζqΣ(s)≡∑n=1∞1⟨n⟩qs=1+1⟨2⟩qs+⋯ and ζqΠ(s)≡∏pprime11−⟨p⟩q−s=11−⟨2⟩q−s11−⟨3⟩q−s11−⟨5⟩q−s⋯, which, for q<1, generically satisfy ζqΣ(s)<ζqΠ(s), in variance with the q=1 case, where of course ζ1Σ(s)=ζ1Π(s).

A Quadruple Integral Involving Product of the Struve Hv(βt) and Parabolic Cylinder Du(αx) Functions

The objective of the present paper is to obtain a quadruple infinite integral. This integral involves the product of the Struve and parabolic cylinder functions and expresses it in terms of the Hurwitz–Lerch Zeta function. Almost all Hurwitz-Lerch Zeta functions have an asymmetrical zero distributionSpecial cases in terms fundamental constants and other special functions are produced. All the results in the work are new.