English
Related papers

Related papers: A 2-Categorical Bridge Between Henkin Construction…

200 papers

We start the general structure theory of not necessarily semisimple finite tensor categories, generalizing the results in the semisimple case (i.e. for fusion categories), obtained recently in our joint work with D.Nikshych. In particular,…

Quantum Algebra · Mathematics 2007-05-23 Pavel Etingof , Viktor Ostrik

Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…

Programming Languages · Computer Science 2015-02-05 Mauro Jaskelioff , Russell O'Connor

The category of topological spaces endowed with two marked points is equipped with two families $\mathbf F_n$ and $\mathbf H_n$ of functors to the category of abelian groups, indexed by a nonnegative integer $n$: namely, the functor…

Algebraic Topology · Mathematics 2023-01-04 Benjamin Enriquez , Florence Lecomte

We obtain a family of explicit "polyhedral" combinatorial expressions for multiplicities in the tensor product of two simple finite-dimensional modules over a complex semisimple Lie algebra. Here "polyhedral" means that the multiplicity in…

Representation Theory · Mathematics 2007-05-23 Arkady Berenstein , Andrei Zelevinsky

Reasoning about weak higher categorical structures constitutes a challenging task, even to the experts. One principal reason is that the language of set theory is not invariant under the weaker notions of equivalence at play, such as…

Category Theory · Mathematics 2022-03-01 Jonathan Weinberger

This paper is part of a series of articles in which we reproduce the statements regarding the abstract six-functor formalism developed by Liu-Zheng. In this paper, we prove a theorem, which is an $\infty$-categorical version for defining…

Algebraic Geometry · Mathematics 2025-01-30 Chirantan Chowdhury

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

This paper lays the groundwork for the theory of categorical diagonalization. Given a diagonalizable operator, tools in linear algebra (such as Lagrange interpolation) allow one to construct a collection of idempotents which project to each…

Representation Theory · Mathematics 2017-07-17 Ben Elias , Matthew Hogancamp

We develop the theory of Hopf bimodules for a finite rigid tensor category C. Then we use this theory to define a distinguished invertible object D of C and an isomorphism of tensor functors ?^{**} and D tensor ^{**}? tensor D^{-1}. This…

Quantum Algebra · Mathematics 2009-05-19 Pavel Etingof , Dmitri Nikshych , Viktor Ostrik

In proof-theoretic semantics, model-theoretic validity is replaced by proof-theoretic validity. Validity of formulae is defined inductively from a base giving the validity of atoms using inductive clauses derived from proof-theoretic rules.…

Logic · Mathematics 2024-02-02 David Pym , Eike Ritter , Edmund Robinson

We study compound systems with a classical sector and a quantum sector. Among other consistency conditions we require a canonical structure, that is, a Lie bracket for the dynamical evolution of hybrid observables in the Heisenberg picture,…

Quantum Physics · Physics 2017-02-01 V. Gil , L. L. Salcedo

In the context of the two dimensional sigma model, we show that classical field theory naturally defines a functor from Segal's category of Riemann surfaces to the Guillemin-Sternberg/Weinstein category of canonical relations in symplectic…

Symplectic Geometry · Mathematics 2014-04-11 Patrick Vaclav Nabelek , Douglas Pickrell

Decidability of definitional equality and conversion of terms into canonical form play a central role in the meta-theory of a type-theoretic logical framework. Most studies of definitional equality are based on a confluent,…

Logic in Computer Science · Computer Science 2007-05-23 Robert Harper , Frank Pfenning

Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…

Functional Analysis · Mathematics 2008-02-18 M. Marques Alves , B. F. Svaiter

The spaces of point configurations on the projective line up to the action of $\mathrm{SL}(2,\mathbb K)$ and its maximal torus are canonically compactified by the Grothdieck-Knudsen and Losev-Manin moduli spaces $\overline M_{0,n}$ and…

Algebraic Geometry · Mathematics 2014-08-10 Hendrik Bäker

We extend the analysis of the Hamiltonian formalism of the d-dimensional tetrad-connection gravity to the fermionic field by fixing the non-dynamic part of the spatial connection to zero. Although the reduced phase space is equipped with…

General Relativity and Quantum Cosmology · Physics 2018-06-15 M. H. Lagraa , M. Lagraa

In a previous work, by extending the classical Quillen construction to the non-simply connected case, we have built a pair of adjoint functors, 'model' and 'realization', between the categories of simplicial sets and complete differential…

Algebraic Topology · Mathematics 2018-10-22 Urtzi Buijs , Yves Félix , Aniceto Murillo , Daniel Tanré

In the the present contribution, we prove an Omitting Types Theorem (OTT) for an arbitrary fragment of hybriddynamic first-order logic with rigid symbols (i.e. symbols with fixed interpretations across worlds) closed under negation and…

Logic · Mathematics 2022-03-17 Daniel Gaina , Guillermo Badia , Tomasz Kowalski

Motivated by team semantics and existential second-order logic, we develop a model-theoretic framework for studying second-order objects such as sets and relations. We introduce a notion of abstract elementary team categories that…

Logic · Mathematics 2026-05-08 Tapani Hyttinen , Joni Puljujärvi , Davide Emilio Quadrellaro

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…

Formal Languages and Automata Theory · Computer Science 2011-11-03 Michał Skrzypczak
‹ Prev 1 4 5 6 7 8 10 Next ›