Related papers: Most Complex Regular Ideal Languages
We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…
We consider rings whose one-sided ideals are close to automorphism-invariant modules. We study rings in which every (finitely generated) right ideal is automorphism invariant and rings in which every right ideal is a finite direct sum of…
Here we characterize regular and completely regular ordered semigroups by their minimal bi-ideals. A minimal bi-ideal is expressed as a product of a minimal right ideal and a minimal left ideal. Furthermore, we show that every bi-ideal in a…
We give a thorough structural analysis of the principal one-sided ideals of arbitrary semigroups, and then apply this to full transformation semigroups and symmetric inverse monoids. One-sided ideals of these semigroups naturally occur as…
A quasi-Gray code of dimension $n$ and length $\ell$ over an alphabet $\Sigma$ is a sequence of distinct words $w_1,w_2,\dots,w_\ell$ from $\Sigma^n$ such that any two consecutive words differ in at most $c$ coordinates, for some fixed…
We show that the quasiequational theory of a relatively congruence modular quasivariety of left $R$-modules is determined by a two-sided ideal in $R$ together with a filter of left ideals. The two-sided ideal encodes the identities that…
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related…
A left ideal of any C*-algebra is an example of an operator algebra with a right contractive approximate identity (r.c.a.i.). Conversely, we show here and in a `pre-quel' to this paper [B], that operator algebras with r.c.a.i. should be…
From the theory of finite dimensional Lie algebras it is known that every finite dimensional Lie algebra is decomposed into a semidirect sum of semisimple subalgebra and solvable radical. Moreover, due to work of Mal'cev the study of…
HyperQPTL and HyperQPTL$^+$ are expressive specification languages for hyperproperties, properties that relate multiple executions of a system. Tight complexity bounds are known for HyperQPTL finite-state satisfiability and model-checking.…
I study the state complexity of binary operations on regular languages over different alphabets. It is well known that if $L'_m$ and $L_n$ are languages restricted to be over the same alphabet, with $m$ and $n$ quotients, respectively, the…
We observe that the class of left and right artinian left and right morphic rings agrees with the class of artinian principal ideal rings. For $R$ an artinian principal ideal ring and $G$ a group, we characterize when $RG$ is a principal…
We introduce two-sided type systems, which are sequent calculi for typing formulas. Two-sided type systems allow for hypothetical reasoning over the typing of compound program expressions, and the refutation of typing formulas. By…
This short article is aimed at educators and teachers of mathematics.Its goal is simple and direct:to explore some of the basic/elementary properties of proper rational numbers.A proper rational number is a rational which is not an integer.…
Descriptional complexity is the study of the conciseness of the various models representing formal languages. The state complexity of a regular language is the size, measured by the number of states of the smallest, either deterministic or…
For every natural number $n\geq 2$ and every finite sequence $L$ of natural numbers, we consider the set $UD_n(L)$ of all uniquely decodable codes over an $n$-letter alphabet with the sequence $L$ as the sequence of code word lengths, as…
We provide an algorithm that, given any order $O$ in a quaternion algebra over a global field, computes representatives of all right equivalence classes of right $O$-ideals, including the non-invertible ones. The theory is developed for a…
Given any positive integer n, we prove the existence of infinitely many right triangles with area n and side lengths in certain number fields. This generalizes the famous congruent number problem. The proof allows the explicit construction…
We discuss conjectures related to the following two conjectures: (1) for each complex numbers x_1,...,x_n there exist rationals y_1,...,y_n \in [-2^{n-1},2^{n-1}] such that \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in…
Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvantages of Kolmogorov complexity, also known as algorithmic information…