Related papers: Minimal digit sets for parallel addition in non-st…
The min-cost matching problem suffers from being very sensitive to small changes of the input. Even in a simple setting, e.g., when the costs come from the metric on the line, adding two nodes to the input might change the optimal solution…
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…
Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and $\omega$-primality. While progress in this field has been accelerated by the…
Let $A$ be an $n \times n$ matrix with rational entries and let \[ \mathbb{Z}^n[A] := \bigcup_{k=1}^{\infty} \left( \mathbb{Z}^n + A\mathbb{Z}^n + \dots + A^{k-1}\mathbb{Z}^n\right) \] be the minimal $A$-invariant $\mathbb{Z}$-module…
We study the performance of a family of randomized parallel coordinate descent methods for minimizing the sum of a nonsmooth and separable convex functions. The problem class includes as a special case L1-regularized L1 regression and the…
Let $\alpha$ and $\beta$ belong to the same quadratic field. We show that the inhomogeneous Beatty sequence $(\lfloor n \alpha + \beta \rfloor)_{n \geq 1}$ is synchronized, in the sense that there is a finite automaton that takes as input…
In this article, we investigate the $\beta$-expansions of real algebraic numbers. In particular, we give new lower bounds for the number of digit exchanges in the case where $\beta$ is a Pisot or Salem number. Moreover, we define a new…
A number of constructions in function field arithmetic involve extensions from linear objects using digit expansions. This technique is described here as a method of constructing orthonormal bases in spaces of continuous functions. We…
We characterize those $k$-automatic sets $S$ of natural numbers that form an additive basis for the natural numbers, and we show that this characterization is effective. In addition, we give an algorithm to determine the smallest $j$ such…
The $(-\beta)$-integers are natural generalisations of the $\beta$-integers, and thus of the integers, for negative real bases. When $\beta$ is the analogue of a Parry number, we describe the structure of the set of $(-\beta)$-integers by a…
The approximate minimum degree algorithm is widely used before numerical factorization to reduce fill-in for sparse matrices. While considerable attention has been given to the numerical factorization process, less focus has been placed on…
Self-synchronization under the presence of additive noise can be achieved by allocating a certain number of bits of each codeword as markers for synchronization. Difference systems of sets are combinatorial designs which specify the…
A numerical set $S$ with Frobenius number $g$ is a set of integers with $\min(S) = 0$ and $\max(\Zbb - S)=g$, and its atom monoid is $A(S) = \setpres{n \in \Zbb}{$n+s \in S$ for all $s \in S$}$. Let $\gamma_g$ be the number of numerical…
We consider approximation algorithms for covering integer programs of the form min $\langle c, x \rangle $ over $x \in \mathbb{N}^n $ subject to $A x \geq b $ and $x \leq d$; where $A \in \mathbb{R}_{\geq 0}^{m \times n}$, $b \in…
Converting binary integers to variable-length decimal strings is a fundamental operation in computing. Conventional fast approaches rely on recursive division and small lookup tables. We propose a SIMD-based algorithm that leverages integer…
Massively-parallel graph algorithms have received extensive attention over the past decade, with research focusing on three memory regimes: the superlinear regime, the near-linear regime, and the sublinear regime. The sublinear regime is…
We present a shared memory implementation of a parallel algorithm, called delta-stepping, for solving the single source shortest path problem for directed and undirected graphs. In order to reduce synchronization costs we make some…
We study rational numbers with purely periodic R\'enyi $\beta$-expansions. For bases $\beta$ satisfying $\beta^2=a\beta+b$ with $b$ dividing $a$, we give a necessary and sufficient condition for $\gamma(\beta)=1$, i.e., that all rational…
This paper introduces the Adaptive Base Representation (ABR) Theorem and proposes a novel number system that offers a structured alternative to the binary number system for digital computers. The ABR number system enables each decimal…
We study the sets DF({\beta}) of digit frequencies of {\beta}-expansions of numbers in [0,1]. We show that DF({\beta}) is a compact convex set with countably many extreme points which varies continuously with {\beta}; that there is a full…