Related papers: Dualizability of automatic algebras
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First,…
Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…
In this paper we prove that in classifying of complex filiform Leibniz algebras, for which its naturally graded algebra is non-Lie algebra, it suffices to consider some special basis transformations. Moreover, we establish a criterion…
We establish new combinatorial transcendence criteria for continued fraction expansions. Let $\alpha = [0; a_1, a_2,...]$ be an algebraic number of degree at least three. One of our criteria implies that the sequence of partial quotients…
We generalize to the super context, the known fact that if an affine algebraic group $G$ over a commutative ring $k$ acts freely (in an appropriate sense) on an affine scheme $X$ over $k$, then the dur sheaf $X\tilde{\tilde{/}}G$ of…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
For a large class of Abelian lattice models with sign problems, including the case of non-zero chemical potential, duality maps models with complex actions into dual models with real actions. For extended regions of parameter space,…
We consider the computability and complexity of decision questions for Probabilistic Finite Automata (PFA) with sub-exponential ambiguity. We show that the emptiness problem for strict and non-strict cut-points of polynomially ambiguous…
A converse to Lie's theorem for Leibniz algebras is found and generalized. The result is used to find cases in which the generalized property, called triangulable, is 2-recognizeable; that is, if all 2-generated subalgebras are…
A differential algebra of finite type over a field k is a filtered algebra A, such that the associated graded algebra is finite over its center, and the center is a finitely generated k-algebra. The prototypical example is the algebra of…
We clarify what it means for two full dualities based on the same algebra to be different. Our main theorem gives conditions on two different alter egos of a finite algebra under which, if one yields a full duality, then the other does too.…
It is shown that if two transcendental entire functions permute, and if one of them satisfies an algebraic differential equation, then so does the other one.
Let $M$ be a T-motive. We introduce the notion of duality for $M$. Main results of the paper (we consider uniformizable $M$ over $F_q[T]$ of rank $r$, dimension $n$, whose nilpotent operator $N$ is 0): 1. Algebraic duality implies analytic…
In this paper we consider linear combinations of two trivariate homogeneous polynomials of second degree. We formulate and solve two problems: i) Characterization of polynomials for which all linear combinations are factorizable. ii) How…
Let G be a finite group and A a finite dimensional G-graded algebra over a field of characteristic zero. When A is simple as a G-graded algebra, by mean of Regev central polynomials we construct multialternating graded polynomials of…
We study commutative algebras with Gorenstein duality, i.e. algebras $A$ equipped with a non-degenerate bilinear pairing such that $\langle ac,b\rangle=\langle a,bc\rangle$ for any $a,b,c\in A$. If an algebra $A$ is Artinian, such pairing…
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical…
We consider certain systems of three linked simultaneous diagonal equations in ten variables with total degree exceeding five. By means of a complification argument, we obtain an asymptotic formula for the number of integral solutions of…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…