Related papers: Maximum distances in the four-digit Kaprekar proce…

In this paper, we explore the concept of Mutually Unbiased Bases (MUBs) in discrete quantum systems. It is known that for dimensions $d$ that are powers of prime numbers, there exists a set of up to $d+1$ bases that form an MUB set.…

Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…

We consider an infinite-dimensional non-linear operator related to a hard core (HC) model with a countable set $\mathbb{N}$ of spin values. It is known that finding the fixed points of an infinite-dimensional operator is generally…

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 $X\subseteq \mathbb{P}^3$ be a smooth projective surface of degree $d\ge 4$ defined over a number field $K$, and let $N_{X^{\prime}}(B)$ be the number of rational points of $X$ of height at most $B$ that do not lie on lines contained in…

In this paper, we develop a novel accelerated fixed-point-based framework using delayed inexact oracles to approximate a fixed point of a nonexpansive operator (or equivalently, a root of a co-coercive operator), a central problem in…

We study the Dirichlet series $F_b(s)=\sum_{n=1}^\infty d_b(n)n^{-s}$, where $d_b(n)$ is the sum of the base-$b$ digits of the integer $n$, and $G_b(s)=\sum_{n=1}^\infty S_b(n)n^{-s}$, where $S_b(n)=\sum_{m=1}^{n-1}d_b(m)$ is the summatory…

In this paper, we focus on Narayana numbers which can be written as a products of four repdigits in base $g$, where $g$ is an integer with $g\geq2$. We prove that for $g$ between $2$ and $12$, there are finitely many of these numbers.…

We perform numerical experiments on one-dimensional singularly perturbed problems of reaction-convection-diffusion type, using isogeometric analysis. In particular, we use a Galerkin formulation with B-splines as basis functions. The…

We study four particular 3-dimensional natural Hamiltonian systems defined in conformally Euclidean spaces. We prove their superintegrability and we obtain, in the four cases, the maximal number of functionally independent integrals of…

Algebraic relations are established that determine the invariance of the transformed number after several transformations. The restrictions that determine the group structure of these relationships are analyzed, as is the case of the Klein…

This paper addresses the problem of seeking a common fixed point for a collection of nonexpansive operators over time-varying multi-agent networks in real Hilbert spaces, where each operator is only privately and approximately known to each…

Let $K$ be the sum of the reciprocals of the integers with no occurrence of the digit $b-1$ in base $b$. We show $K = b\log(b) - A/b - B/b^2-C/b^3+O(1/b^4)$ with $A=\zeta(2)/2$, $B = (3\zeta(2)+\zeta(3))/3$ and $C =…

Let $\mathbb{F}_q$ be the finite field of order $q$ and $E\subset \mathbb{F}_q^d$, where $4|d$. Using Fourier analytic techniques, we prove that if $|E|>\frac{q^{d-1}}{d}\binom{d}{d/2}\binom{d/2}{d/4}$, then the points of $E$ determine a…

This paper considers the minimization problem of relaxed submodular functions. For a positive integer $k$, a set function is called $k$-distant submodular if the submodular inequality holds for every pair whose symmetric difference is at…

We consider the NP-hard problem of minimizing a separable concave quadratic function over the integral points in a polyhedron, and we denote by D the largest absolute value of the subdeterminants of the constraint matrix. In this paper we…

We demonstrate an iterative scheme to approximate the optimal transportation problem with a discrete target measure under certain standard conditions on the cost function. Additionally, we give a finite upper bound on the number of…

The main focus of this paper is a pair of new approximation algorithms for certain integer programs. First, for covering integer programs {min cx: Ax >= b, 0 <= x <= d} where A has at most k nonzeroes per row, we give a k-approximation…

A difference equation w.r.t. space-time dimension $d$ for $n$-point one-loop integrals with arbitrary momenta and masses is introduced and a solution presented. The result can in general be written as multiple hypergeometric series with…

The $k$-independence number of a graph $G$ is the maximum size of a set of vertices at pairwise distance greater than $k$. In this paper, for each positive integer $k$, we prove sharp upper bounds for the $k$-independence number in an…