Related papers: Data structures for quasistrict higher categories
In a previous work, the authors resolved a conjecture about the structure of prime-detecting quasi-modular forms by studying sign changes occurring in quasi-modular cusp forms. In this paper, we extend the considerations to prime-detecting…
A near-group category is an additively semisimple category with a product such that all but one of the simple objects is invertible. We classify braided structures on near-group categories, and give explicit numerical formulas for their…
A higher associativity was introduced by Jim Stasheff in [Sta63] with higher coherence conditions and now becomes one of the most important structures on spaces and algebras. He also claims that the condition on unit can be weakened, using…
Category theory in homotopy type theory is intricate as categorical laws can only be stated "up to homotopy", and thus require coherences. The established notion of a univalent category (Ahrens, Kapulkin, Shulman) solves this by considering…
We introduce the notion of a cellular system in order to deal with quasi-hereditary algebras. We shall prove that a necessary and sufficient condition for an algebra to be quasi-hereditary is the existence of a full divisible cellular…
We consider notions of metrized categories, and then approximate categorical structures defined by a function of three variables generalizing the notion of $2$-metric space. We prove an embedding theorem giving sufficient conditions for an…
A Q-system is a unitary version of a separable Frobenius algebra object in a C*-tensor category. In a recent joint work with P. Das, S. Ghosh and C. Jones, the author has categorified Bratteli diagrams and unitary connections by building a…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine…
A model structure on the category of (small) bigroupoids and pseudofunctors is constructed. In this model structure, every object is cofibrant. In order to keep certain calculations of manageable size, a coherence theorem for bigroupoids…
Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore…
We study quasi-semisimple elements of disconnected reductive algebraic groups over an algebraically closed field. We describe their centralizers, define isolated and quasi-isolated quasi-semisimple elements and classify their conjugacy…
We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary…
We present the first definition of strictly associative and unital $\infty$-category. Our proposal takes the form of a type theory whose terms describe the operations of such structures, and whose definitional equality relation enforces…
Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network…
Highest weight categories are described in terms of standard objects and recollements of abelian categories, working over an arbitrary commutative base ring. Then the highest weight structure for categories of strict polynomial functors is…
We show that small quasicategories embed, both simplicially and 2-categorically, into prederivators defined on arbitrary small categories, so that in some senses prederivators can serve as a model for $(\infty,1)$-categories. The result for…
We define and construct a new data structure, the tables, this structure generalizes the (finite) $k$-sets sets of Eilenberg \cite{Ei}, it is versatile (one can vary the letters, the words and the coefficients). We derive from this…
Succinct data structures give space-efficient representations of large amounts of data without sacrificing performance. They rely one cleverly designed data representations and algorithms. We present here the formalization in Coq/SSReflect…
With any non necessarily orientable unpunctured marked surface (S,M) we associate a commutative algebra, called quasi-cluster algebra, equipped with a distinguished set of generators, called quasi-cluster variables, in bijection with the…