Related papers: On sets with rank one in simple homogeneous struct…
Regular word grammars are restricted context-free grammars that define all the recognizable languages of words. This paper generalizes regular grammars from words to certain classes of graphs, by defining regular grammars for unordered…
Sentence embeddings encode natural language sentences as low-dimensional dense vectors. A great deal of effort has been put into using sentence embeddings to improve several important natural language processing tasks. Relation extraction…
One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…
For certain theories of existentially closed topological differential fields, we show that there is a strong relationship between $\mathcal L\cup\{D\}$-definable sets and their $\mathcal L$-reducts, where $\mathcal L$ is a relational…
We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in…
Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…
The generic digraph $(D,E)$ is the unique countable homogeneous digraph that embeds all finite digraphs. In this paper, we determine the lattice of reducts of $(D,E)$, where a structure $\mathcal{M}$ is a reduct of $(D,E)$ if it has domain…
Estimating the dependences between random variables, and ranking them accordingly, is a prevalent problem in machine learning. Pursuing frequentist and information-theoretic approaches, we first show that the p-value and the mutual…
Let $E$ be a number field and $X$ a smooth geometrically connected variety defined over a characteristic $p$ finite field. Given an $n$-dimensional pure $E$-compatible system of semisimple $\lambda$-adic representations of the \'etale…
We classify (possibly non commutative) algebras of low rank over a domain R. We first review results for algebras of rank 2 and for finite-dimensional division algebras over the real numbers. These results motivate us to consider which…
Let $\mathfrak{g}$ be a Lie algebra all of whose regular subalgebras of rank 2 are type $A_{1}\times A_{1}$, $A_{2}$, or $C_{2}$, and let $B$ be a crystal graph corresponding to a representation of $\mathfrak{g}$. We explicitly describe the…
The notion of defining relations is well-defined for any nilpotent Lie algebra. Therefore a conventional way to present a simple Lie algebra G is by splitting it into the direct sum of a commutative Cartan subalgebra and two maximal…
We show that for a large class of C*-algebras $\mathcal{A}$, containing arbitrary direct limits of separable type I C*-algebras, the following statement holds: If $A\in \mathcal{A}$ and $B$ is a simple projectionless C*-algebra with trivial…
Within dependently typed languages, such as Idris, types can depend on values. This dependency, however, can limit the collection of items in standard containers: all elements must have the same type, and as such their types must contain…
We investigate the possibility of distinguishing among different causal relations starting from a limited set of marginals. Our main tool is the notion of adhesivity, that is, the extension of probability or entropies defined only on…
We prove two structure theorems for simple, locally finite dimensional Lie algebras over an algebraically closed field of characteristic $p$ which give sufficient conditions for the algebras to be of the form $[R^{(-)}, R^{(-)}] / (Z(R)…
We prove, by means of an exact structural description, that every simple triangle-free binary matroid $M$ with $|M| > \tfrac{33}{128}2^{r(M)}$ has critical number at most $2$.
We study finitely homogeneous dependent rosy structures, adapting results of Cherlin, Harrington, and Lachlan proved for $\omega$-stable $\omega$-categorical structures. In particular, we prove that such structures have finite {\th}-rank…
Binary idempotent semirings govern classical path algebras. Their multiplicative structure is dyadic. We examine whether this restriction is structural or accidental. We define ternary idempotent $\Gamma$-semirings as higher-arity ordered…
This is the second paper in a series that aims to provide mathematical descriptions of objects and constructions related to the first few steps of the semantical theory of dependent type systems. We construct for any pair $(R,LM)$, where…