Related papers: On Language Varieties Without Boolean Operations
A unified theory of language combines a Bayesian cognitive linguistic model of language processing, with the proposal that language evolved by sexual selection for the display of intelligence. The theory accounts for the major facts of…
This paper presents a novel concept of a Polyatomic Logic and initiates its systematic study. This approach, inspired by Inquisitive semantics, is obtained by taking a variant of a given logic, obtained by looking at the fragment covered by…
How does the first order language of fields encode birational invariants of varieties?... This question is related to rational points on varieties and effectiveness in algebraic/arithmetic geometry.
In this paper we develop little further the theory of quantum finite automata (QFA). There are already few properties of QFA known, that deterministic and probabilistic finite automata do not have e.g. they cannot recognize all regular…
$\omega$-regular languages are a natural extension of the regular languages to the setting of infinite words. Likewise, they are recognised by a host of automata models, one of the most important being Alternating Parity Automata (APAs), a…
We consider word maps and word maps with constants on a simple algebraic group. We present results on the images of such maps, in particular, we prove a theorem on the dominance of general word maps with constants, which can be viewed as an…
The aim of this article is to study certain categorical-algebraic frameworks for basic homological algebra, introduced in arXiv:2404.15896, with the aim of better understanding the differences between them. We focus on homological…
We consider algebraic varieties canonically associated to any Lie superalgebra, and study them in detail for super-Poincar\'e algebras of physical interest. They are the locus of nilpotent elements in (the projectivized parity reversal of)…
As algebraic semantics of the logic of quantum mechanics there are usually used orthomodular posets, i.e. bounded posets with a complementation which is an antitone involution and where the join of orthogonal elements exists and the…
We prove that the space of coinvariants of functions on an affine variety by a Lie algebra of vector fields whose flow generates finitely many leaves is finite-dimensional. Cases of the theorem include Poisson (or more generally Jacobi)…
We develop a theory of formal multivariate polynomials over commutative rings by treating them as ring terms. Our main result is that two ring terms are s-equivalent (when expanded they yield the same standard polynomial) iff they are…
We give a simple new proof that regular languages defined by first-order sentences with no quantifier alteration can be defined by such sentences in which only regular atomic formulas appear. Earlier proofs of this fact relied on arguments…
We prove lower bounds on the length of regular expressions for finite languages by methods from arithmetic circuit complexity. First, we show a reduction: the length of a regular expression for a language $L\subseteq \{0,1\}^n$ is bounded…
We systematically study the moduli theory of symplectic varieties (in the sense of Beauville) which admit a resolution by an irreducible symplectic manifold. In particular, we prove an analog of Verbitsky's global Torelli theorem for the…
Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove…
We investigate a famous decision problem in automata theory: separation. Given a class of language C, the separation problem for C takes as input two regular languages and asks whether there exists a third one which belongs to C, includes…
A fundamental problem at the confluence of algebraic geometry and representation theory is to describe the cohomology of line bundles on flag varieties over a field of characteristic p. When p=0, the solution is given by the celebrated…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…
Let $\mathfrak{g}$ be a real finite-dimensional Lie algebra equipped with a symmetric bilinear form $\langle\cdot,\cdot\rangle$. We assume that $\langle\cdot,\cdot\rangle $ is nil-invariant. This means that every nilpotent operator in the…