Related papers: Doodles and commutator identities
Just as $\Cstar$ principal bundles provide a geometric realisation of two-dimensional integral cohomology; gerbes or sheaves of groupoids, provide a geometric realisation of three dimensional integral cohomology through their Dixmier-Douady…
We advocate an account of dualities between physical theories: the basic idea is that dual theories are isomorphic representations of a common core. We defend and illustrate this account, which we call a Schema, in relation to symmetries.…
Given word on $n$ letters, we study groups which satisfiy "iterated identity" $w$, meaning that for all $x_1, \dots, x_n$ there exists $m$ such that $m$-the iteration of $w$ of Engel type, applied to $x_1, \dots, x_n$, is equal to the…
Riddles are concise linguistic puzzles that describe an object or idea through indirect, figurative, or playful clues. They are a longstanding form of creative expression, requiring the solver to interpret hints, recognize patterns, and…
In this thesis we develop the cohomology of diagrams of algebras and then apply this to the cases of the $\lambda$-rings and the $\Psi$-rings. A diagram of algebras is a functor from a small category to some category of algebras. For an…
The motivation of this paper is to construct a deformation theory of coderivations of coassociative coalgebras. We introduce a notion of a Coder pair, that is, a coassociative coalgebra with a coderivation. Then we define a proper…
In this work we investigate the Swampland Cobordism Conjecture in the context of type IIB string theory geometries with non-trivial duality bundle. Quite remarkably, we find that many non-trivial bordism classes with duality bundles in…
We consider pairs (X,Y) where X is a compact, locally CAT(-1) space, and Y is a totally geodesic subspace. The inclusion induces an embedding of the boundaries at infinity of the universal covers; we focus on the case where these are…
Networks are a general language for representing relational information among objects. An effective way to model, reason about, and summarize networks, is to discover sets of nodes with common connectivity patterns. Such sets are commonly…
We prove the 2-torus $\mathbb T$, an abelian linear algebraic group, is a fine moduli space of labeled, oriented, possibly-degenerate inscribable similarity classes of triangles, where a triangle is {\it inscribable} if it can be inscribed…
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…
We consider certain modules of the symmetric groups whose basis elements are called tabloids. Some of these modules are isomorphic to subspaces of the cohomology rings of subvarieties of flag varieties as modules of the symmetric groups. We…
Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…
It has been hypothesized that some form of "modular" structure in artificial neural networks should be useful for learning, compositionality, and generalization. However, defining and quantifying modularity remains an open problem. We cast…
The data for many useful bidirectional constructions in applied category theory (optics, learners, games, quantum combs) can be expressed in terms of diagrams containing "holes" or "incomplete parts", sometimes known as comb diagrams. We…
A concrete computation -- twelve slidings with sixteen tiles -- reveals that certain commutativity phenomena occur in every double semigroup. This can be seen as a sort of Eckmann-Hilton argument, but it does not use units. The result…
We investigate the normal subgroups of the groups of invertibles and unitaries in the connected component of the identity. By relating normal subgroups to closed two-sided ideals we obtain a "sandwich condition" describing all the closed…
We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.
Free cumulants were introduced as the proper analog of classical cumulants in the theory of free probability. There is a mix of similarities and differences, when one considers the two families of cumulants. Whereas the combinatorics of…
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…