Related papers: A {\omega}-REA Set Forming A Minimal Pair With 0'
We introduce post-associative algebra structures and study their relationship to post-Lie algebra structures, Rota--Baxter operators and decompositions of associative algebras and Lie algebras. We show several results on the existence of…
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
We consider a family of pairs of m-by-p and m-by-q matrices, in which some entries are required to be zero and the others are arbitrary, with respect to transformations (A,B)--> (SAR,SBL) with nonsingular S, R, L. We prove that almost all…
In the computation of a Gr"obner basis using Buchberger's algorithm, a key issue for improving the efficiency is to produce techniques for avoiding as many unnecessary critical pairs as possible. A good solution would be to avoid _all_…
Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…
We reintroduce a previously discovered method for constructing tree pair representations for Algebraic Bieri-Strebel groups, as well as demonstrate a class of higher order groups that cannot have a tree pair representation. In doing so, we…
It is a classical problem to compute a minimal set of invariant polynomial generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case.…
Nontrivial pairs of zero-divisors in group rings are introduced and discussed. A problem on the existence of nontrivial pairs of zero-divisors in group rings of free Burnside groups of odd exponent $n \gg 1$ is solved in the affirmative.…
It is possible to enumerate all computer programs. In particular, for every partial computable function, there is a shortest program which computes that function. f-MIN is the set of indices for shortest programs. In 1972, Meyer showed that…
We introduce a weak division-like property for noncommutative rings: a nontrivial ring is fadelian if for all nonzero $a,x$ there exist $b,c$ such that $x=ab+ca$. We prove properties of fadelian rings, and construct examples of such rings…
The Riemann hypothesis states that all nontrivial zeros of the zeta function lie in the critical line $\Re(s)=1/2$. Hilbert and P\'olya suggested that one possible way to prove the Riemann hypothesis is to interpret the nontrivial zeros in…
We work with the structure consisting of all computably enumerable (c.e.) sets ordered by set inclusion. The question we will partially address is which c.e.\ sets are autormorphic to low (or low$_2$ sets. Using work of Miller, we can see…
This paper is devoted to studying $R$-diagonal and $\eta$-diagonal pairs of random variables. We generalize circular elements to the bi-free setting, defining bi-circular element pairs of random variables, which provide examples of…
Assuming the Riemann Hypothesis (RH), Montgomery proved a theorem in 1973 concerning the pair correlation of zeros of the Riemann zeta-function and applied this to prove that at least $2/3$ of the zeros are simple. In this paper, we…
In this article, we show that for a partial skew group ring R*G, where R is a commutative ring, each non-zero ideal of R*G intersects R non-trivially if and only if R is a maximal commutative subring of R*G. As a consequence, we obtain…
We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…
We extend the notion of standard pairs to the context of monomial ideals in semigroup rings. Standard pairs can be used as a data structure to encode such monomial ideals, providing an alternative to generating sets that is well suited to…
We prove the existence of good log minimal models for dlt pairs of numerical log Kodaira dimension 0.
In this paper we consider linear relations with conjugates of a Salem number $\alpha$. We show that every such a relation arises from a linear relation between conjugates of the corresponding totally real algebraic integer…
An oracle $A$ is low-for-speed if it is unable to speed up the computation of a set which is already computable: if a decidable language can be decided in time $t(n)$ using $A$ as an oracle, then it can be decided without an oracle in time…