Related papers: Trace Forms of Symbol Algebras

Symbolic equations are at the core of scientific discovery. The task of discovering the underlying equation from a set of input-output pairs is called symbolic regression. Traditionally, symbolic regression methods use hand-designed…

We consider C*-algebras associated with stable and unstable equivalence in hyperbolic dynamical systems known as Smale spaces. These systems include shifts of finite type, in which case these C*-algebras are both AF-algebras. These algebras…

We describe the structure present in algebras over the little disks operads for various representations of a finite group $G$, including those that are not necessarily universe or that do not contain trivial summands. We then spell out in…

These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…

We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…

In this paper, we consider the trace theorem for modulation spaces, alpha modulation spaces and Besov spaces. For the modulation space, we obtain the sharp results.

We continue the investigation of tabular algebras with trace (a certain class of associative ${\Bbb Z}[v, v^{-1}]$-algebras equipped with distinguished bases) by determining the extent to which the tabular structure may be recovered from a…

Let $A$ and $B$ be finite-dimensional simple algebras with arbitrary signature over an algebraically closed field. Suppose $A$ and $B$ are graded by a semigroup $S$ so that the graded identitical relations of $A$ are the same as those of…

In process algebras, security properties are expressed as equivalences between processes, but which equivalence is suitable is not clear. This means that there is a gap between an intuitive security notion and the formulation. Appropriate…

A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…

The trace formula is a versatile tool for computing sums of spectral data across families of automorphic forms. Using specialized test functions, one can treat small families with refined spectral properties. This has proven fruitful in…

Properties of relative traces and symmetrizing forms on chains of cyclotomic and affine Hecke algebras are studied. The study relies on a use of bases of these algebras which generalize a normal form for elements of the complex reflection…

Trace formulas are investigated in non-commutative integration theory. The main result is to evaluate the standard trace of a Takesaki dual and, for this, we introduce the notion of interpolator and accompanied boundary objects. The formula…

The aim of this paper is to show that there can be either only one or uncountably many contexts in any spectral effect algebra, answering a question posed in [S. Gudder, Convex and Sequential Effect Algebras, (2018), arXiv:1802.01265]. We…

We interpret tensors on a smooth manifold M as differential forms over a graded commutative algebra called the algebra of iterated differential forms over M. This allows us to put standard tensor calculus in a new differentially closed…

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…

I present a formal connection between algebraic effects and game semantics, two important lines of work in programming languages semantics with applications in compositional software verification. Specifically, the algebraic signature…

In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced…

We develop objective linear algebra in a new setting with a cardinality functor that can take negative values. The signs arise as little homotopies, as ratios between orientations. To illustrate the workings of the theory we give an…

Let $A$ be a finite-dimensional division algebra containing a base field $k$ in its center $F$. We say that $A$ is defined over a subfield $F_0$ of $F$ if $A = A_0\otimes_{F_0} F$ for some $F_0$-subalgebra $A_0$ of $A$. We show that: (1) In…