Related papers: On 2-digit and 3-digit Kaprekar's Routine
An optimal heuristic logic is an effective method for finding the sum of all prime numbers up to a given number. This paper presents different approaches, namely, general method and optimal method which facilitate to compare the results and…
In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…
Finite precision computations using digital computers involve the following inherent errors: (1) Round-off error of finite precision computations (2) Binary computer arithmetic precludes exact number representation of traditional decimal…
In this paper, we propose two novel non-stationary first-order primal-dual algorithms to solve nonsmooth composite convex optimization problems. Unlike existing primal-dual schemes where the parameters are often fixed, our methods use…
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…
Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…
Multidimensional record patterns are random sets of lattice points defined by means of a recursive stochastic construction. The patterns thus generated owe their richness to the fact that the construction is not based on a total order,…
In this paper, we introduce and analyze arbitrarily high-order quadrature rules for evaluating the two-dimensional singular integrals of the forms \begin{align} I_{i,j} = \int_{\mathbb{R}^2}\phi(x)\frac{x_ix_j}{|x|^{2+\alpha}} \d x, \quad…
Symmetric submodular maximization is an important class of combinatorial optimization problems, including MAX-CUT on graphs and hyper-graphs. The state-of-the-art algorithm for the problem over general constraints has an approximation ratio…
We propose an approach to data memory prefetching which augments the standard prefetch buffer with selection criteria based on performance and usage pattern of a given instruction. This approach is built on top of a pattern matching based…
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…
In this paper we analyze and implement a second-order-in-time numerical scheme for the three-dimensional phase field crystal (PFC) equation. The numerical scheme was proposed in [46], with the unique solvability and unconditional energy…
A (k,g)-graph is a k-regular graph of girth g, and a (k,g)-cage is a (k,g)-graph of minimum order. We show that a (3,11)-graph of order 112 found by Balaban in 1973 is minimal and unique. We also show that the order of a (4,7)-cage is 67…
We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…
We consider a classical and superadiabatic version of an iterative quantum adiabatic algorithm to solve combinatorial optimization problems. This algorithm is deterministic because it is based on purely classical dynamics, that is, it does…
In this paper we propose a new inexact dual decomposition algorithm for solving separable convex optimization problems. This algorithm is a combination of three techniques: dual Lagrangian decomposition, smoothing and excessive gap. The…
For a fixed positive integer $k$, a set $S$ of vertices of a graph or multigraph is called a $k$-independent set if the subgraph induced by $S$ has maximum degree less than $k$. The well-known algorithm MAX finds a maximal $k$-independent…
Dynamic programming is a class of algorithms used to compute optimal control policies for Markov decision processes. Dynamic programming is ubiquitous in control theory, and is also the foundation of reinforcement learning. In this paper,…
The Krasnosel'skii-Mann (KM) algorithm is the most fundamental iterative scheme designed to find a fixed point of an averaged operator in the framework of a real Hilbert space, since it lies at the heart of various numerical algorithms for…
This study is mainly about the discrete logarithm problem in the ElGamal cryptosystem over the abelian group U(n) where n is one of the following forms p^m, or 2p^m where p is an odd large prime and m is a positive integer. It is another…