English
Related papers

Related papers: A categorification of biclosed sets of strings

200 papers

We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show…

Geometric Topology · Mathematics 2013-12-17 Jozef H. Przytycki , Krzysztof K. Putyra

Let G be a simple complex algebraic group. By using a notion of a G-category we define invariants of tangles with flat G-connections in their complements. We also show that quantized universal enveloping algebras at roots of unity provide…

Quantum Algebra · Mathematics 2010-08-10 R. Kashaev , N. Reshetikhin

The shard intersection order is a new lattice structure on a finite Coxeter group W which encodes the geometry of the reflection arrangement and the lattice theory of the weak order. In the case where W is the symmetric group, we…

Combinatorics · Mathematics 2011-03-11 Erin Bancroft

For a lattice L, let Princ L denote the ordered set of principal congruences of L. In a pioneering paper, G. Gratzer characterized the ordered sets Princ L of finite lattices L; here we do the same for countable lattices. He also showed…

Rings and Algebras · Mathematics 2013-05-09 Gabor Czedli

This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…

Group Theory · Mathematics 2020-05-26 James East , Nik Ruskuc

We explain how the spacetime diffeomorphism in the classical bosonic closed string field theory (SFT) is represented as $L_\infty$ gauge transformations in weakly curved backgrounds. In particular, we demonstrate the explicit map between…

High Energy Physics - Theory · Physics 2025-04-17 Ben Mazel , Charles Wang , Xi Yin

To a tree of semi-simple algebras we associate a qurve (or formally smooth algebra) S. We introduce a Zariski- and etale quiver describing the finite dimensional representations of S. In particular, we show that all quotient varieties of…

Rings and Algebras · Mathematics 2007-05-23 Jan Adriaenssens , Lieven Le Bruyn

In this paper we explore some applications of a certain technique (that we call the Freese's technique), which is a tool for identifying certain lattices as sublattices of the congruence lattice of a given algebra. In particular we will…

Rings and Algebras · Mathematics 2023-09-14 Paolo Aglianò , Stefano Bartali , Stefano Fioravanti

The data of a "2D field theory with a closed string compactification" is an equivariant chain level action of a cell decomposition of the union of all moduli spaces of punctured Riemann surfaces with each component compactified as a…

Geometric Topology · Mathematics 2007-10-24 Dennis Sullivan

A discrete subgroup $\Gamma$ of a locally compact group $H$ is called a uniform lattice if the quotient $H/\Gamma$ is compact. Such an $H$ is called an envelope of $\Gamma$. In this paper we study the problem of classifying envelopes of…

Group Theory · Mathematics 2014-04-22 Tullia Dymarz

In this paper we seek geometric and invariant-theoretic characterizations of (Schur-)representation finite algebras. To this end, we introduce two classes of finite-dimensional algebras: those with the dense-orbit property and those with…

Representation Theory · Mathematics 2015-09-18 Calin Chindris , Ryan Kinser , Jerzy Weyman

In this paper we introduce abstract string modules and give an explicit bijection between the submodule lattice of an abstract string module and the perfect matching lattice of the corresponding abstract snake graph. In particular, we make…

Representation Theory · Mathematics 2018-11-16 Ilke Canakci , Sibylle Schroll

We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…

Group Theory · Mathematics 2016-10-20 Maurice Chiodo

We use string-net models to accomplish a direct, purely two-dimensional, approach to correlators of two-dimensional rational conformal field theories. We obtain concise geometric expressions for the objects describing bulk and boundary…

Quantum Algebra · Mathematics 2022-11-09 Jürgen Fuchs , Christoph Schweigert , Yang Yang

We study the class of finite lattices that are isomorphic to the congruence lattices of algebras from a given finitely generated congruence-distributive variety. If this class is as large as allowed by an obvious necessary condition, the…

Rings and Algebras · Mathematics 2014-03-31 Pierre Gillibert , Miroslav Ploscica

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

Discrete Mathematics · Computer Science 2013-08-29 Alexander Grigoriev , Athanassios Koutsonas , Dimitrios M. Thilikos

Let $X$ be a simply connected closed oriented manifold of rationally elliptic homotopy type. We prove that the string topology bracket on the $S^1$-equivariant homology $\overline{H}_{\ast}^{S^1}(\mathcal{L}X,\mathbb{Q}) $ of the free loop…

Quantum Algebra · Mathematics 2021-07-01 Yuri Berest , Ajay C. Ramadoss , Yining Zhang

We use Constraint Satisfaction Methods to construct and enumerate finite $L$-algebras up to isomorphism. These objects were recently introduced by Rump and appear in Garside theory, algebraic logic, and the study of the combinatorial…

Logic · Mathematics 2023-07-04 C. Dietzel , P. Menchón , L. Vendramin

Candelas and Font introduced the notion of a `top' as half of a three dimensional reflexive polytope and noticed that Dynkin diagrams of enhanced gauge groups in string theory can be read off from them. We classify all tops satisfying a…

High Energy Physics - Theory · Physics 2007-05-23 Vincent Bouchard , Harald Skarke

In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…

Computational Complexity · Computer Science 2019-01-01 Laurent Lyaudet
‹ Prev 1 3 4 5 6 7 10 Next ›