Related papers: Minimal digit sets for parallel addition in non-st…
This paper is devoted to computational algorithms designed to describe the classical Ising magnet in some specific cases when an additional macroscopic restriction in form of constant charge density exists in the system. We developed and…
For a given base $\gamma$ and a digit set ${\mathcal B}$ we consider optimal representations of a number $x$, as defined by Dajani at al. in 2012. For a non-integer negative base $\gamma=-\beta<-1$ and the digit set ${\mathcal…
To the existing dynamic algorithm FactorizationsUpToElement for factorization sets of elements in a numerical semigroup, we add lexicographic and parallel behavior. To the existing parallel lexicographic algorithm for the same, we add…
In this paper we consider parallelization for applications whose objective can be expressed as maximizing a non-monotone submodular function under a cardinality constraint. Our main result is an algorithm whose approximation is arbitrarily…
We present an algorithm based on continuation techniques that can be applied to solve numerically minimization problems with equality constraints. We focus on problems with a great number of local minima which are hard to obtain by local…
Symmetric submodular function minimization admits purely combinatorial algorithms using special orderings of the ground set. Extending the minimum-cut algorithm of Nagamochi and Ibaraki (1992), Queyranne (1998) showed that the maximum…
In the literature of algorithms, the specific computation model is often not explicit as it is assumed that the model of computation is the RAM (Random Access Machine) model. However, the RAM model itself is ill-founded in the literature,…
We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…
For an integer $b \geqslant 2$ and a set $S\subset \{0,\cdots,b-1\}$, we define the Kempner set $\mathcal{K}(S,b)$ to be the set of all non-negative integers whose base-$b$ digital expansions contain only digits from $S$. These well-studied…
We prove that finite sets of real numbers satisfying $|AA| \leq |A|^{1+\epsilon}$ with sufficiently small $\epsilon > 0$ cannot have small additive bases nor can they be written as a set of sums $B+C$ with $|B|, |C| \geq 2$. The result can…
A definition for a class of asynchronous cellular arrays is proposed. An example of such asynchrony would be independent Poisson arrivals of cell iterations. The Ising model in the continuous time formulation of Glauber falls into this…
For scientific computations on a digital computer the set of real number is usually approximated by a finite set F of "floating-point" numbers. We compare the numerical accuracy possible with difference choices of F having approximately the…
This paper provides an introduction to the design of augmented data structures that offer an efficient representation of a mathematical sequence and fast sequential summation algorithms, which guarantee both logarithmic running time and…
We introduce a nabla, a delta, and a symmetric fractional calculus on arbitrary nonempty closed subsets of the real numbers. These fractional calculi provide a study of differentiation and integration of noninteger order on discrete,…
A set $A$ of nonnegative integers is an asymptotic basis of order $h$ if every sufficiently large integer can be represented as the sum of $h$ not necessarily distinct elements of $A$. The asymptotic basis $A$ is minimal if removing any…
This article introduces new multiplicative updates for nonnegative matrix factorization with the $\beta$-divergence and sparse regularization of one of the two factors (say, the activation matrix). It is well known that the norm of the…
In our study we implemented and compared seven sequential and parallel sorting algorithms: bitonic sort, multistep bitonic sort, adaptive bitonic sort, merge sort, quicksort, radix sort and sample sort. Sequential algorithms were…
In the present article, we introduce beta-expansions in the ring $\mathbb{Z}_p$ of $p$-adic integers. We characterise the sets of numbers with eventually periodic and finite expansions.
We present a parallel algorithm for calculating very large determinants with arbitrary precision on computer clusters. This algorithm minimises data movements between the nodes and computes not only the determinant but also all minors…
We developed a flexible parallel algorithm for graph summarization based on vertex-centric programming and parameterized message passing. The base algorithm supports infinitely many structural graph summary models defined in a formal…