Related papers: Minimal non-integer alphabets allowing parallel ad…
We present an auxiliary space theory that provides a unified framework for analyzing various iterative methods for solving linear systems that may be semidefinite. By interpreting a given iterative method for the original system as an…
Ideally, the time that an incremental algorithm uses to process a change should be a function of the size of the change rather than, say, the size of the entire current input. Based on a formalization of ``the set of things changed'' by an…
We study the effect of addition on the Hamming weight of a positive integer. Consider the first $2^n$ positive integers, and fix an $\alpha$ among them. We show that if the binary representation of $\alpha$ consists of $\Theta(n)$ blocks of…
We study the structure of the codifferent and of additively indecomposable integers in families of totally real cubic fields. We prove that for cubic orders in these fields, the minimal trace of indecomposable integers multiplied by totally…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
For a Lie algebra $L$ and a subalgebra $M$ of $L$ we say that a subalgebra $U$ of $L$ is a {\em supplement} to $M$ in $L$ if $L = M + U$. We investigate those Lie algebras all of whose maximal subalgebras have abelian supplements, those…
We present a method for the enumeration of restricted words over a finite alphabet. Restrictions are described through the inclusion or exclusion of suitable building blocks used to construct the words by concatenation. Our approach, which…
In this paper, we introduce a novel generalization of the classical property of algebras known as "being alternative," which we term "partially alternative." This new concept broadens the scope of alternative algebras, offering a fresh…
In probabilistic cloning with two auxiliary systems, we consider and compare three different protocols for the success probabilities of cloning. We show that, in certain circumstances, it may increase the success probability to add an…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
Extended multi-adjoint logic programming arises as an extension of multi-adjoint normal logic programming where constraints and a special type of aggregator operator have been included. The use of this general aggregator operator permits to…
We present a base class of automata that induce a numeration system and we give an algorithm to give the n-th word in the language of the automaton when the expansion of n in the induced numeration system is feeded to the automaton.…
Parallel programming remains a daunting challenge, from the struggle to express a parallel algorithm without cluttering the underlying synchronous logic, to describing which devices to employ in a calculation, to correctness. Over the…
Suppose that a random n-bit number V is multiplied by an odd constant M, greater than or equal to 3, by adding shifted versions of the number V corresponding to the 1s in the binary representation of the constant M. Suppose further that the…
Some iterative calculations can be carried out by parallel communicating processors, and yield the same results whether or not the processors are synchronized. We show that this is the case if and only if the iteration is a contraction that…
Sorting is one of the most fundamental problems in the field of computer science. With the rapid development of manycore processors, it shows great importance to design efficient parallel sort algorithm on manycore architecture. This paper…
We deal with the existing problem of filtered multiplicative bases of finite-dimensional associative algebras. For an associative algebra A over a field, we investigate when the property of having a filtered multiplicative basis is…
A graph G on n vertices is said to be extendable if G can be modified to form a new graph H on more than n vertices, while preserving the degrees of the vertices common to G and H. The added vertices all have the same degree and we define…
Suffix trees have recently become very successful data structures in handling large data sequences such as DNA or Protein sequences. Consequently parallel architectures have become ubiquitous. We present a novel alphabet-dependent parallel…
Let $C,W\subseteq \mathbb{Z}$. If $C+W=\mathbb{Z}$, then the set $C$ is called an additive complement to $W$ in $\mathbb{Z}$. If no proper subset of $C$ is an additive complement to $W$, then $C$ is called a minimal additive complement. Let…