Related papers: On the relation between perfect powers and tetrati…

Empirical, theoretical and historical aspects of Post's "problem of tag" from 1921 are explored. Evidence of strong computational irreducibility is found. Despite their deterministic origin, the lengths of successive sequences generated…

In recent work with Raum the authors considered congruences for the ordinary partition function $p(n)$ of the form $p(\ell Q^r n+\beta)\equiv 0\pmod\ell$ where $\ell, Q\geq 5$ are prime and $r\in \{1,2\}$, and proved a number of results…

An exact series representation of the even frequency moments of the dynamic structure factor is derived. Truncations are proposed that allow to evaluate the explicitly unknown second, fourth and fifth frequency moments for the finite…

We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex…

We consider again a classical theorem relating capacities and algebraic integers and the question of the simultaneous approximation of $ n-1$ different complex numbers by conjugate algebraic integers of degree $n$.

Let $\overline{p}_{j,k}(n)$ denotes the number of $(j,k)$-regular overpartitions of a positive integer $n$ such that none of the parts is congruent to $j$ modulo $k$. Naika et. al. (2021) proved infinite families of congruences modulo…

Kucera and Gacs independently showed that every infinite sequence is Turing reducible to a Martin-Lof random sequence. This result is extended by showing that every infinite sequence S is Turing reducible to a Martin-Lof random sequence R…

The Tu--Deng Conjecture is concerned with the sum of digits $w(n)$ of $n$ in base~$2$ (the Hamming weight of the binary expansion of $n$) and states the following: assume that $k$ is a positive integer and $1\leq t<2^k-1$. Then \[\Bigl…

A sequence of non-negative integers is exactly realizable as the fixed point counts sequence of a dynamical system if and only if it gives rise to a sequence of non-negative orbit counts. This provides a simple realizability criterion based…

This is a survey of a connection between the distribution of certain power residues modulo $p$, $p$ a prime, and relative class numbers. The focus lies on quadratic residues and sixth power residues. Dirichlet's class number formula yields…

In the paper, the authors establish Maclaurin's series expansions and series identities for positive integer powers of the inverse sine function, for positive integer powers of the inverse hyperbolic sine function, for the composite of…

Let us denote by $Z_{b}(n)$ the number of trailing zeroes in the base b expansion of $n!$. In this paper we study the connection between the expression of $\vartheta(b):=\lim_{n\to \infty}Z_{b}(n)/n$ in base $b$, and that of $Z_{b}(b^{k})$.…

The author \cite{4} proved that, for every set $S$ of positive integers containing 1 (finite or infinite) there exists the density $h=h(E(S))$ of the set $E(S)$ of numbers whose prime factorizations contain exponents only from $S,$ and gave…

We show that if there exists an integer subject to some congruence conditions that cannot be written as the sum of the norm of an ideal in $\mathbb{Z}[\exp(2\pi i/2^k)]$ and at most $k$ powers of $2$, $k\geq 3$, then there are infinitely…

We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits…

Let $ped(n)$ denote the number of partitions of $n$ wherein even parts are distinct (and odd parts are unrestricted). We show infinite families of congruences for $ped(n)$ modulo $8$. We also examine the behavior of $ped_{-2}(n)$ modulo $8$…

We consider the interaction between an electrically polarizable atom in its fundamental state and a wedge constituted by two semi-infinite perfectly conducting plates. Using a formalism based on a master equation, we compute the dispersion…

Tensors are a natural way to express correlations among many physical variables, but storing tensors in a computer naively requires memory which scales exponentially in the rank of the tensor. This is not optimal, as the required memory is…

Inference efficiency is the predominant consideration in designing deep learning accelerators. Previous work mainly focuses on skipping zero values to deal with remarkable ineffectual computation, while zero bits in non-zero values, as…

The difference between two consecutive prime numbers is called the distance between the primes. We study the statistical properties of the distances and their increments (the difference between two consecutive distances) for a sequence…