Related papers: Applicability of Partial Ternary Full Adder in Ter…
We prove that any function with real-valued coefficients, whose input is 4 binary variables and whose output is a real number, is perfectly equivalent to a quadratic function whose input is 5 binary variables and is minimized over the new…
Tensor train (TT) representation has achieved tremendous success in visual data completion tasks, especially when it is combined with tensor folding. However, folding an image or video tensor breaks the original data structure, leading to…
Recently, linear codes constructed from defining sets have been investigated extensively and they have many applications. In this paper, for an odd prime $p$, we propose a class of $p$-ary linear codes by choosing a proper defining set.…
Addition theorems can be constructed by doing three-dimensional Taylor expansions according to $f (\mathbf{r} + \mathbf{r}') = \exp (\mathbf{r}' \cdot \mathbf{\nabla}) f (\mathbf{r})$. Since, however, one is normally interested in addition…
In the literature on algorithms for performing the multi-term addition $s_n=\sum_{i=1}^n x_i$ using floating-point arithmetic it is often shown that a hardware unit that has single normalization and rounding improves precision, area,…
Two types of finite element spaces on a tetrahedron are constructed for divdiv conforming symmetric tensors in three dimensions. The key tools of the construction are the decomposition of polynomial tensor spaces and the characterization of…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
The present work establishes necessary and sufficient conditions for a nonlinear system with two inputs to be described by a specific triangular form. Except for some regularity conditions, such triangular form is flat. This may lead to the…
Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…
Tensor completion is a problem of filling the missing or unobserved entries of partially observed tensors. Due to the multidimensional character of tensors in describing complex datasets, tensor completion algorithms and their applications…
We propose an approach to extending the concept of a Lie algebra to ternary structures based on $\omega$-symmetry, where $\omega$ is a primitive cube root of unity. We give a definition of a corresponding structure, called a ternary Lie…
The characterization of commutators in associative algebras is a classical problem in ring theory. In this paper, we address this problem for the natural class of generalized block-triangular algebras. To this end, we introduce a new…
We show that the weight enumerator of any binary linear code is equal to the permanent of a 3-dimensional hypermatrix (3-matrix). We also show that each permanent is a determinant of a 3-matrix. As an application we write the dimer…
We sometimes need to compute the most significant digits of the product of small integers with a multiplier requiring much storage: e.g., a large integer (e.g., $5^{100}$) or an irrational number ($\pi$). We only need to access the most…
Let $A$ be a DG algebra with a trivial differential over a commutative unital ring. This paper investigates the image of the totaling functor, defined from the category of complexes of graded $A$-modules to the category of DG $A$-modules.…
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…
A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and…
In many instances of fixed-point multiplication, a full precision result is not required. Instead it is sufficient to return a faithfully rounded result. Faithful rounding permits the machine representable number either immediately above or…
We consider several types of non-existence theorems for functors. For example, there are no nontrivial functors from the category of groups (or the category of pointed sets, or vector spaces) to any small category. Another type of questions…
It was claimed in [4] that for any integer $n\geqslant 2$, a neutral element can be adjoined to an $n$-ary semigroup if and only if the $n$-ary semigroup is reducible to a binary semigroup. We show that the `only if' direction of this…