Related papers: An extension of the digital method based on $b$-ad…
A method of fast linear transform algorithm synthesis for an arbitrary tensor, matrix, or vector is proposed. The method is based on factorization of a tensor and using the factors for building computational structures performing fast…
We prove that digital sequences modulo $m$ along squares are normal, which covers some prominent sequences like the sum of digits in base $q$ modulo $m$, the Rudin-Shapiro sequence and some generalizations. This gives, for any base, a class…
We show that the sum of a sequence of integers can be computed in linear time on a Turing machine. In particular, the most obvious algorithm for this problem, which appears to require quadratic time due to carry propagation, actually runs…
In many modern applications, there is interest in analyzing enormous data sets that cannot be easily moved across computers or loaded into memory on a single computer. In such settings, it is very common to be interested in clustering.…
Models generalizing the su(2) XX spin-chain were recently introduced. These XXC models also have an underlying su(2) structure. Their construction method is shown to generalize to the chains based on the fundamental representations of the…
The dominant approach to sequence generation is to produce a sequence in some predefined order, e.g. left to right. In contrast, we propose a more general model that can generate the output sequence by inserting tokens in any arbitrary…
Dynamic or temporal networks enable representation of time-varying edges between nodes. Conventional adjacency-based data structures used for storing networks such as adjacency lists were designed without incorporating time and can thus…
Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…
A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.
We introduce an algorithm for the uniform generation of infinite traces, i.e., infinite words up to commutation of some letters. The algorithm outputs on-the-fly approximations of a theoretical infinite trace, the latter being distributed…
We give the images of the adjoint representations of exceptional simple Lie algebras by matrices over complex numbers. Next, we digitalize these matrices by the use of Maxima, which is a computer algebra system. These digitalized matrices…
Let $b \geq 2$ be an integer base with prime factors $p_1, \ldots, p_s$. In this paper we study sequences of "$b$-adic valuations" and last nonzero digits in $b$-adic expansions of the values $f(n) = (f_1(n), \ldots, f_s(n))$, where each…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…
We consider the hash function $h(x) = ((ax+b) \bmod p) \bmod n$ where $a,b$ are chosen uniformly at random from $\{0,1,\ldots,p-1\}$. We prove that when we use $h(x)$ in hashing with chaining to insert $n$ elements into a table of size $n$…
In a Dedekind domain $D$, every non-zero proper ideal $A$ factors as a product $A=P_1^{t_1}\cdots P_k^{t_k}$ of powers of distinct prime ideals $P_i$. For a Dedekind domain $D$, the $D$-modules $D/P_i^{t_i}$ are uniserial. We extend this…
The notion of 'bifurcating continued fractions' is introduced. Two coupled sequences of non-negative integers are obtained from an ordered pair of positive real numbers in a manner that generalizes the notion of continued fractions. These…
In this paper, we study some new factorizations of period-doubling sequences over a $k$-letter alphabet, where $k\geq 2$. First, we define the combinatorial and arithmetic properties of these sequences. Then, we define the kernel words of…
We present a matrix factorization algorithm that scales to input matrices that are large in both dimensions (i.e., that contains morethan 1TB of data). The algorithm streams the matrix columns while subsampling them, resulting in low…
In this paper we present an efficient and robust approach to compute a normalized B-spline-like basis for spline spaces with pieces drawn from extended Tchebycheff spaces. The extended Tchebycheff spaces and their dimensions are allowed to…
In this paper, we introduce a bilateral adding machine based on a zip space with two sets of alphabets. We demonstrate that these adding machines are homeomorphisms and provide necessary and sufficient conditions for their characterization.