Related papers: Gelfand-Kirillov conjecture as a first-order formu…

In this note, we give a new proof of the fact that an affine semiprime algebra R of Gelfand-Kirillov dimension 1 satisfies a polynomial identity. Our proof uses only the growth properties of the algebra and yields an explicit upper bound…

We address two problems regarding the structure and representation theory of finite W-algebras associated with the general linear Lie algebras. Finite W-algebras can be defined either via the Whittaker model of Kostant or, equivalently, by…

We give a direct proof for the positivity of Kirillov's character on the convolution algebra of smooth, compactly supported functions on a connected, simply connected nilpotent Lie group $G$. Then we use this positivity result to construct…

For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…

Suppose L is a relational language and P in L is a unary predicate. If M is an L-structure then P(M) is the L-structure formed as the substructure of M with domain {a: M models P(a)}. Now suppose T is a complete first order theory in L with…

Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any L_F-sentence \varphi containing only bounded quantifiers, and any positive rational number \delta, decides either "\varphi…

Let g be the Lie algebra of a connected reductive group G over an algebraically closed field k of characteristic p>0. Let $Z$ be the centre of the universal enveloping algebra U=U(g) of g. Its maximal spectrum is called the Zassenhaus…

We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over alphabets with an involution on them. The natural algebras for such languages are…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

In this paper we show that every object in the dg category of relative singularities Sing$(B,\underline{f})$ associated to a pair $(B,\underline{f})$, where $B$ is a ring and $\underline{f}\in B^n$, is equivalent to a retract of a…

Let $\mathfrak{g}$ be a semisimple complex Lie algebra of finite dimension and $\mathfrak{h}$ be a semisimple subalgebra. We present an approach to find the branching rules for the pair $\mathfrak{g}\supset\mathfrak{h}$. According to an…

Let $R$ be a commutative integral unital domain and $L$ a free non-commutative Lie algebra over $R$. In this paper we show that the ring $R$ and its action on $L$ are 0-interpretable in $L$, viewed as a ring with the standard ring language…

We prove that the first-order theory of any function field K of characteristic p>2 is undecidable in the language of rings without parameters. When K is a function field in one variable whose constant field is algebraic over a finite field,…

The Main Theorem for abelian fields (often called Main Conjecture despite proofs in most cases) has a long history which has found a solution by means of "elementary arithmetic", as detailed in Washington's book from Thaine's method having…

In this short note we give an alternative proof of Glivenko's Theorem, stating that a formula $\phi$ is provable in classical propositional logic if and only if $\neg\neg\phi$ is provable in intuitionistic propositional logic. We work in…

The regular languages with a neutral letter expressible in first-order logic with one alternation are characterized. Specifically, it is shown that if an arbitrary $\Sigma_2$ formula defines a regular language with a neutral letter, then…

To each complex semisimple Lie algebra $\mathfrak{g}$ and regular element $a\in\mathfrak{g}_{\text{reg}}$, one associates a Mishchenko-Fomenko subalgebra $\mathcal{F}_a\subseteq\mathbb{C}[\mathfrak{g}]$. This subalgebra amounts to a…

Given a finitely generated free monoid $X$ and a morphism $\phi : X\to X$, we show that one can construct an algebra, which we call an iterative algebra, in a natural way. We show that many ring theoretic properties of iterative algebras…

We introduce in this paper the contractions $\mathfrak{G}_c$ of $n$-Lie (or Filippov) algebras $\mathfrak{G}$ and show that they have a semidirect structure as their $n=2$ Lie algebra counterparts. As an example, we compute the non-trivial…

Let $k$ be a field and let $A$ be a finitely generated $k$-algebra. The algebra $A$ is said to be cancellative if whenever $B$ is another $k$-algebra with the property that $A[x]\cong B[x]$ then we necessarily have $A\cong B$. An important…