Related papers: Complex Algebras of Arithmetic
We study the computational complexity of the membership problem for arithmetic circuits over natural numbers with division. We consider different subsets of the operations {intersection,union,complement,+,x,/}, where / is the element-wise…
Leibniz algebras generated by one element, called cyclic, provide simple and illuminating examples of many basic concepts. It is the purpose of this paper to illustrate this fact.
We study a numerical semigroup ring as an algebra over another numerical semigroup ring. The complete intersection property of numerical semigroup algebras is investigated using factorizations of monomials into minimal ones. The goal is to…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
A rational number can be naturally presented by an arithmetic computation (AC): a sequence of elementary arithmetic operations starting from a fixed constant, say 1. The asymptotic complexity issues of such a representation are studied e.g.…
A separating algebra is, roughly speaking, a subalgebra of the ring of invariants whose elements distinguish between any two orbits that can be distinguished using invariants. In this paper, we introduce a geometric notion of separating…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
Information algebra is algebraic structure for local computation and inference. Given an initial universe set and a parameter set, we show that a soft set system over them is an information algebra. Moreover, in a soft set system, the…
Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some…
The central open question of algebraic complexity is whether VP is unequal to VNP, which is saying that the permanent cannot be represented by families of polynomial-size algebraic circuits. For symmetric algebraic circuits, this has been…
It is not commonly realized that the algebra of complex numbers can be used in an elegant way to represent the images of ordinary 3-dimensional figures, orthographically projected to the plane. We describe these ideas here, both using…
We give a definition of associative schemes, schemes of associative rings, over a field $k,$ using the definition of completion of an associative $k$-algebra in a finite set of simple modules. We start by giving a weaker but sufficient…
We describe an algebra for composing automata which includes both classical and quantum entities and their communications. We illustrate by describing in detail a quantum protocol.
We give a general account of family algebras over a finitely presented linear operad, this operad together with its presentation naturally defining an algebraic structure on the set of parameters.
The purpose of this paper is to make the theory of vertex algebras trivial. We do this by setting up some categorical machinery so that vertex algebras are just ``singular commutative rings'' in a certain category. This makes it easy to…
Algebraic lattices are those obtained from modules in the ring of integers of algebraic number fields through the canonical or twisted embeddings. In turn, well-rounded lattices are those with maximal cardinality of linearly independent…
The range of a trigonometric polynomial with complex coefficients can be interpreted as the image of the unit circle under a Laurent polynomial. We show that this range is contained in a real algebraic subset of the complex plane. Although…
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…
This paper presents a graded hierarchy or chain of binary operations on the reals and the complex numbers. The operations are related distributively in the sense that any one of them distributes over the next lower operation in the chain.…