Related papers: Varieties of Data Languages
We classify semisimple rigid monoidal categories with two isomorphism classes of simple objects over the field of complex numbers. In the appendix written by P.Etingof it is proved that the number of semisimple Hopf algebras with a given…
The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known. We…
Futrell and Mahowald (2025) frame the success of neural language models (LMs) as supporting gradient, usage-based linguistic theories. I argue that LMs can also instantiate theories based on formal structures - the types of theories seen in…
In the spirit of arXiv:2501.12985, we propose an abelian categorification of $\hat{Z}$-invariants for negative definite plumbed 3-manifolds. It provides a blueprint for the expected dictionary between these $3$-manifolds and log VOAs; that…
We compare the following three families of geometric objects: Schubert varieties in flag manifolds, matrix Schubert varieties, and Borel orbits of 2-nilpotent matrices. The first family is governed by permutations, the second by partial…
We consider ideals and Boolean combinations of ideals. For the regular languages within these classes we give expressively complete automaton models. In addition, we consider general properties of regular ideals and their Boolean…
A pseudogroup is a complete infinitely distributive inverse monoid. Such inverse monoids bear the same relationship to classical pseudogroups of transformations as frames do to topological spaces. The goal of this paper is to develop the…
Recently L. Nicolaescu and the author formulated a conjecture which relates the geometric genus of a complex analytic normal surface singularity (whose link $M$ is a rational homology sphere) with the Seiberg-Witten invariant of $M$…
For a given variety Var of algebras we define the variety Var of dialgebras. This construction turns to be closely related with varieties of pseudo-algebras: every Var-dialgebra can be embedded into an appropriate pseudo-algebra of the…
We investigate in a method for proving separation results for abstract classes of languages. A well established method to characterize varieties of regular languages are identities. We use a recently established generalization of these…
A monoid is called special if it admits a presentation in which all defining relations are of the form $w = 1$. Every group is special, but not every monoid is special. In this article, we describe the language-theoretic properties of the…
While non-contextual hidden-variable theories are proved to be impossible, contextual ones are possible. In a contextual hidden-variable theory, an observable is called a beable if the hidden-variable assigns its value in a given…
We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…
There is a well known bijective correspondence between isomorphism classes of polystable vector bundles $E$ with $c_i(E)=0$ for $i\geq 1$ on a smooth complex projective variety and equivalence classes of unitary representations of the…
The low-energy expansion of closed-string scattering amplitudes at genus one introduces infinite families of non-holomorphic modular forms called modular graph forms. Their differential and number-theoretic properties motivated Brown's…
I introduce modal group theory, in which we study the category of all groups, considering embeddability as providing a notion of modal possibility. Using HNN extensions and Britton's lemma, I demonstrate that the modal language of groups is…
This paper is a sequel to math.RT/0601155. Let G be a complex symplectic group. In math.RT/0601155, we constructed a certain G-variety N = N_1, which we call the (1-) exotic nilpotent cone. In this paper, we study the set of G-orbits of the…
Pseudo-variograms appear naturally in the context of multivariate Brown-Resnick processes, and are a useful tool for analysis and prediction of multivariate random fields. We give a necessary and sufficient criterion for a matrix-valued…
We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. The abstract approach we take allows us to seamlessly extend known variations of the algorithm to this…
For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…