Related papers: Zeckendorf arithmetic for Lucas numbers

A division sudoku is a latin square whose all six conjugates are sudoku squares. We enumerate division sudokus up to a suitable equivalence, introduce powerful invariants of division sudokus, and also study latin squares that are division…

Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{\tau(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $\alpha$, we define and study some properties of two new divisor…

Multiplicative inverse is a crucial operation in public key cryptography, and been widely used in cryptography. Public key cryptography has given rise to such a need, in which we need to generate a related public and private pair of…

Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…

The partition function of a factor graph can sometimes be accurately estimated by Monte Carlo methods. In this paper, such methods are extended to factor graphs with negative and complex factors.

We use sums of Liouville type to count the number of ways a positive integer can be represented by the forms $(a+c)^{1/3}x + (b+d)y$, $(a+c)x + \bigl(k(b+d) \bigr)^{1/3} y$, and $\bigl(k(a+c) \bigr)^{1/3} x + l(b+d) y$ for nonnegative…

Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. Once this has been shown, it's natural to ask how many summands are needed. Using a continued fraction approach,…

This paper describes an approach to computer aided calculations in the cohomology of arithmetic groups. It complements existing literature on the topic by emphasizing homotopies and perturbation techniques, rather than cellular subdivision,…

We use elementary arguments to prove results on the order of magnitude of certain sums concerning the gcd's and lcm's of $k$ positive integers, where $k\ge 2$ is fixed. We refine and generalize an asymptotic formula of Bordell\`{e}s (2007),…

Let $r\ge k\ge 2$ be fixed positive integers. Let $\varrho_{r,k}$ denote the characteristic function of the set of $r$-tuples of positive integers with $k$-wise relatively prime components, that is any $k$ of them are relatively prime. We…

We present explicit expressions for multi-fold logarithmic integrals that are equivalent to sums over polygamma functions at integer argument. Such relations find application in perturbative quantum field theory, quantum chemistry, analytic…

We present several sequences of Euler sums involving odd harmonic numbers. The calculational technique is based on proper two-valued integer functions, which allow to compute these sequences explicitly in terms of zeta values only.

We introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…

A new approach is presented to evaluate multi-loop integrals, which appear in the calculation of cross-sections in high-energy physics. It relies on a fully numerical method and is applicable to a wide class of integrals with various mass…

Let $F \in \mathbf{Z}[\boldsymbol{x}]$ be a diagonal, non-singular quadratic form in $4$ variables. Let $\lambda(n)$ be the normalised Fourier coefficients of a holomorphic Hecke form of full level. We give an upper bound for the problem of…

Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus formulation of the Krawtchouk transform that is suitable for…

In this work the authors use their contour integral method to derive a double integral connected to the modified Bessel function of the second kind and express it in terms of the Lerch function. There are some useful results relating double…

At the negative integers, there is a simple relation between the Lerch $\Phi$ function and the polylogarithm. Starting from that relation and a formula for the polylogarithm at the negative integers known from the literature, we can deduce…

Linear codes with a few weights have wide applications in information security, data storage systems, consuming electronics and communication systems. Construction of the linear codes with a few weights and determination of their parameters…

We develop a global cohomology theory for number fields by offering topological cohomology groups, an arithmetical duality, a Riemann-Roch type theorem, and two types of vanishing theorem. As applications, we study moduli spaces of…