相关论文: Applicability of Partial Ternary Full Adder in Ter…

In this paper we introduce the notion of extension of a numerical semigroup. We provide a characterization of the numerical semigroups whose extensions are all arithmetic and we give an algorithm for the computation of the whole set of…

We study Falconer's subadditive pressure function with emphasis on analyticity. We begin by deriving a simple closed form expression for the pressure in the case of diagonal matrices and, by identifying phase transitions with zeros of…

The alternating ternary sum in an associative algebra, $abc - acb - bac + bca + cab - cba$, gives rise to the partially alternating ternary sum in an associative dialgebra with products $\dashv$ and $\vdash$ by making the argument $a$ the…

We generalize the tensor product theory for modules for a vertex operator algebra previously developed in a series of papers by the first two authors to suitable module categories for a ''conformal vertex algebra'' or even more generally,…

In recent years, reversible logic has emerged as a promising computing paradigm having application in low power CMOS, quantum computing, nanotechnology, and optical computing. The classical set of gates such as AND, OR, and EXOR are not…

Commutative semirings with divisible additive semigroup are studied. We show that an additively divisible commutative semiring is idempotent, provided that it is finitely generated and torsion. In case that a one-generated additively…

The Additive Transform of an arithmetic function represents a novel approach to examining the interplay between multiplicative arithmetic function and additive functions. This transform concept introduces a method to systematically generate…

Binary multipliers have long been a staple component in digital circuitry, serving crucial roles in microprocessor design, digital signal processing units and many more applications. This work presents a unique design for a multiplier that…

In recent years several classes of structured matrices are extended to classes of tensors in the context of tensor complementarity problem. The tensor complementarity problem is a class of nonlinear complementarity problem where the…

The existence of a median-type ternary operation on a metric space is known to have a number of implications for the geometry of the space. For such operations, if two of the three arguments coincide, they also coincide with the output of…

We show that if $T$ is any of four semigroups of two elements that are not groups, there exists a finite dimensional associative $T$-graded algebra over a field of characteristic $0$ such that the codimensions of its graded polynomial…

Congruential pseudorandom number generators rely on good multipliers, that is, integers that have good performance with respect to the spectral test. We provide lists of multipliers with a good lattice structure up to dimension eight and up…

For any algebra morphism in a monoidal category, we provide sufficient conditions (which are also necessary if the unit is a left tensor generator) for the attached induction functor being semiseparable. Under mild assumptions, we prove…

The tubal tensor framework provides a clean and effective algebraic setting for tensor computations, supporting matrix-mimetic features like Singular Value Decomposition and Eckart-Young-like optimality results. Underlying the tubal tensor…

Pseudo-Boolean constraints, also known as 0-1 Integer Linear Constraints, are used to model many real-world problems. A common approach to solve these constraints is to encode them into a SAT formula. The runtime of the SAT solver on such…

We discuss various necessary and sufficient conditions for the complete reducibility of a ternary cubic form. In doing so, we prove the claim made in the 19th century that such a form is completely reducible if and only if its Hessian is a…

Arithmetic circuits, such as adders and multipliers, are fundamental components of digital systems, directly impacting the performance, power efficiency, and area footprint. However, optimizing these circuits remains challenging due to the…

We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the…

Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…

We design new tools to study variants of Total Dual Integrality. As an application, we obtain a geometric characterization of Total Dual Integrality for the case where the associated polyhedron is non-degenerate. We also give sufficient…