Related papers: On bi-embeddable categoricity of algebraic structu…
We prove that an arbitrary countable dimensional Lie algebra over a field of characteristic $\neq 2$ that is locally of subexponential growth is embeddable in a finitely generated Lie algebra of subexponential growth.
We consider discriminating between bipartite boxes with 2 binary inputs and 2 binary outputs (2x2) using the class of completely locality preserving operations i.e. those, which transform boxes with local hidden variable model (LHVM) into…
We review the higher gauge symmetries in double and exceptional field theory from the viewpoint of an embedding tensor construction. This is based on a (typically infinite-dimensional) Lie algebra $\frak{g}$ and a choice of representation…
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…
We investigate how classifiers for Boolean networks (BNs) can be constructed and modified under constraints. A typical constraint is to observe only states in attractors or even more specifically steady states of BNs. Steady states of BNs…
An embedding is a mapping from a set of nodes of a network into a real vector space. Embeddings can have various aims like capturing the underlying graph topology and structure, node-to-node relationship, or other relevant information about…
Deep embedding methods have influenced many areas of unsupervised learning. However, the best methods for learning hierarchical structure use non-Euclidean representations, whereas Euclidean geometry underlies the theory behind many…
Any algebra herein is intended over a field of characteristic 0. Let $E$ denote the infinite dimensional Grassman algebra. Given a power associative finite dimensional {$\mathbb{Z}_2$-graded-central-simple} $A$ and a supertrace algebra $B$,…
We find a new braided Hopf structure for the algebra satisfied by the entries of the braided matrix $BSL_q(2)$. A new nonbraided algebra whose coalgebra structure is the same as the braided one is found to be a two parameter deformed…
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…
Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…
We show that braided, sylleptic and symmetric monoidal bicategories are precisely the $\mathsf{E}_k$-monoids in the cartesian monoidal $(\infty,1)$-category of bicategories for respective integers $k$. To manage the underlying computations,…
In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…
A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of posets. We show that order complexes of thick geometric…
An algebraic variety X is embedded to the order k via a line bundle L if the global sections of L generate all (simultaneous) jets of order k on X or if they separate all zero-dimensional subschemes of length at most k+1. Even though we…
We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…
Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…
We discuss an embedding of $su(n)$ rank-two antisymmetric supercharges in the $su(2,2|d_n)$ superalgebra, where $d_n=n(n-1)/2$. We describe an algorithm to construct the explicit form of the generators of the superalgebra.
Natural language text exhibits hierarchical structure in a variety of respects. Ideally, we could incorporate our prior knowledge of this hierarchical structure into unsupervised learning algorithms that work on text data. Recent work by…
Let $B$ be an arrangement of linear complex hyperplanes in $C^d$. Then a classical result by Orlik \& Solomon asserts that the cohomology algebra of the complement can be constructed from the combinatorial data that are given by the…