相关论文: The initial meadows

In this paper we introduce a class of mathematical objects called \emph{extensors} and develop some aspects of their theory with considerable detail. We give special names to several particular but important cases of extensors. The…

Spectral spaces, introduced by Hochster, are topological spaces homeomorphic to the prime spectra of commutative rings. In this paper we study spectral spaces in perspective of idempotent semirings which are algebraic structures receiving a…

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

We establish the undecidability of conditional affine information inequalities, the undecidability of the conditional independence implication problem with a constraint that one random variable is binary, and the undecidability of the…

Let $k$ be an algebraically closed field of characteristic $p>0$. For a loop $\circlearrowleft$, denote its path coalgebra by $k\circlearrowleft$. In this paper, all the finite-dimensional commutative Hopf algebras over the sub coalgebras…

We study the geometry of algebraic monoids. We prove that the group of invertible elements of an irreducible algebraic monoid is an algebraic group, open in the monoid. Moreover, if this group is reductive, then the monoid is affine. We…

We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These include the temporal logics CTL and EF, and first-order logic over…

We solve an open problem concerning the well-known $(\alpha,\beta,\gamma)$-derivations, proving that the spaces of $(\alpha,1,0)$-derivations of any Lie algebra are isomorphic ($\alpha\neq 0,1$). Also, we prove sharp bounds for the…

The term \emph{moderate deviations} is often used in the literature to mean a class of large deviation principles that, in some sense, fill the gap between a convergence in probability to zero (governed by a large deviation principle) and a…

For a new class of algebras, called $EMV$-algebras, every idempotent element $a$ determines an $MV$-algebra which is important for the structure of the $EMV$-algebra. Therefore, instead of standard homomorphisms of $EMV$-algebras, we…

In this work we prove the undecidability (and $\Sigma^0_1$-completeness) of several theories of semirings with fixed points. The generality of our results stems from recursion theoretic methods, namely the technique of effective…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

In this article we provide effective characterisations of regular languages of infinite trees that belong to the low levels of the Wadge hierarchy. More precisely we prove decidability for each of the finite levels of the hierarchy; for the…

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

We prove that a nonzero idempotent is zero-diagonal if and only if it is not a Hilbert-Schmidt perturbation of a projection, along with other useful equivalences. Zero-diagonal operators are those whose diagonal entries are identically zero…

The Modular Isomorphism Problem asks, if an isomorphism between modular group algebras of finite $p$-groups over a field $F$ implies an isomorphism of the group bases. We explore the differences of knowledge on the problem when $F$ is…

We study a class of inverse monoids of the form M = Inv< X | w=1 >, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that the word problem for M is decidable. We also show that the…

$\omega$-clones are multi-sorted structures that naturally emerge as algebras for infinite trees, just as $\omega$-semigroups are convenient algebras for infinite words. In the algebraic theory of languages, one hopes that a language is…

In a simple C*-algebra with suitable regularity properties, any unitary or invertible element with de la Harpe--Skandalis determinant zero is a finite product of commutators.

We examine languages of unranked forests definable using the temporal operators EF and EX. We characterize the languages definable in this logic, and various fragments thereof, using the syntactic forest algebras introduced by Bojanczyk and…