English
Related papers

Related papers: On the equational complexity of RRA

200 papers

In the present paper we obtain the list of algebras, up to isomorphism, such that closure of any complex finite-dimensional algebra contains one of the algebra of the given list.

Rings and Algebras · Mathematics 2013-01-25 A. Kh. Khudoyberdiyev , B. A. Omirov

We develop a notion of computability and complexity of functions over the reals, which seems to be very natural when one tries to determine just how "difficult" a certain function is. This notion can be viewed as an extension of both BSS…

Computational Complexity · Computer Science 2007-05-23 Mark Braverman

This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…

Algebraic Geometry · Mathematics 2024-06-18 Olivier Benoist , Olivier Wittenberg

Let $\mathcal{A}=\left(a_i\right)_{i=1}^\infty$ be a weakly increasing sequence of positive integers and let $k$ be a fixed positive integer. For an arbitrary integer $n$, the restricted partition $p_\mathcal{A}(n,k)$ enumerates all the…

Combinatorics · Mathematics 2023-05-02 Krystian Gajdzica

We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…

Logic in Computer Science · Computer Science 2018-10-11 Ruben Gamboa , John Cowles

We introduce the notion of the weak tracial approximate representability of a discrete group action on a unital $C^*$-algebra which could have no projections like the Jiang-Su algebra $\mathcal{Z}$. Then we show a duality between the weak…

Operator Algebras · Mathematics 2022-08-30 Hyun Ho Lee

We show that products of propositional modal logics containing the logic of reflexive frames T as a factor are embeddable into their single-variable fragments. The proof is a simplified version of the proof, to appear, of a similar result…

Logic · Mathematics 2021-12-08 K. Aleksandrov , M. Rybakov , D. Shkatov

We compute the restricted infinitesimal deformations of the restricted simple Lie algebras over an algebraically closed field of characteristic different from 2 and 3.

Algebraic Geometry · Mathematics 2012-10-01 Filippo Viviani

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…

Complex Variables · Mathematics 2020-08-26 Leonid V. Kovalev , Xuerui Yang

A regular realizability (RR) problem is testing nonemptiness of intersection of some fixed language (filter) with given regular language. We study here complexity of RR problems. It appears that for any language L there exists RR problem…

Computational Complexity · Computer Science 2013-01-01 Mikhail N. Vyalyi

In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is representable over a finite base. This result gives a positive…

Logic · Mathematics 2021-12-21 Daniel Rogozin

We show that a gauge bounded Cartier algebra has finite complexity. We also give an example showing that the converse does not hold in general.

Commutative Algebra · Mathematics 2020-10-28 Henry July , Axel Stäbler

Given a hyper loop algebra over a non-algebraically closed field, we address multiplicity problems in the underlying abelian tensor category of finite-dimensional representations. Namely, we give formulas for the l-characters of the simple…

Representation Theory · Mathematics 2012-01-04 Dijana Jakelic , Adriano Moura

We present an algebraic characterization of the complexity classes Logspace and Nlogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is rooted in proof theory…

Logic in Computer Science · Computer Science 2023-06-22 Clément Aubert , Marc Bagnol

We extend the work of Galatos (2004) on nested sums, originally called generalised ordinal sums, of residuated lattices. We show that the nested sum of an odd quasi relation algebra (qRA) satisfying certain conditions and an arbitrary qRA…

Logic · Mathematics 2026-02-06 Andrew Craig , Claudette Robinson , Wilmari Morton

Binary relations are an important abstraction arising in many data representation problems. The data structures proposed so far to represent them support just a few basic operations required to fit one particular application. We identify…

Data Structures and Algorithms · Computer Science 2012-01-18 Jérémy Barbay , Francisco Claude , Gonzalo Navarro

We show how a polar representation of a compact connected Lie group can be linearly determined from its dimension and isotropy subgroup data in the general reducible case.

Differential Geometry · Mathematics 2022-03-01 Francisco J. Gozzi

We present several known formalizations of theorems from computational complexity in bounded arithmetic and formalize the PCP theorem in the theory PV1 (no formalization of this theorem was known). This includes a formalization of the…

Logic · Mathematics 2017-01-11 Ján Pich

We give a simplified complete proof for the classification of the selfinjective representation-finite algebras of finite dimension over an algebraically closed field. We explain the relations between the two different approaches and also to…

Representation Theory · Mathematics 2023-05-30 Klaus Bongartz

This paper is devoted to the description of complex finite-dimensional algebras of level two. We obtain the classification of algebras of level two in the varieties of Jordan, Lie and associative algebras.

Rings and Algebras · Mathematics 2015-12-09 A. Kh. Khudoyberdiyev