Related papers: Cartesian closed 2-categories and permutation equi…
We develop semantics and syntax for bicategorical type theory. Bicategorical type theory features contexts, types, terms, and directed reductions between terms. This type theory is naturally interpreted in a class of structured…
Kronecker products of unitary Fourier matrices play important role in solving multilevel circulant systems by a multidimensional Fast Fourier Transform. They are also special cases of complex Hadamard (Zeilinger) matrices arising in many…
In this note, we define a recollement of additive categories, and prove that such a recollement can induce a recollement of their quotient categories. As an application, we get a recollement of quotient triangulated categories induced by…
In this paper I distinguish two (pre)congruence requirements for semantic equivalences and preorders on processes given as closed terms in a system description language with a recursion construct. A lean congruence preserves equivalence…
Logically constrained term rewriting is a rewriting framework that supports built-in data structures such as integers and bit vectors. Recently, constrained terms play a key role in various analyses and applications of logically constrained…
We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…
One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product. In this paper we continue the work of [7] to adapt the machinery of globular operads [4] to…
In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of…
We write down a series of basic laws for (strict) higher-order circuit diagrams. More precisely, we define higher-order circuit theories in terms of: (a) nesting, (b) temporal and spatial composition, and (c) equivalence between lower-order…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
In this short note we show that E-infinity quasi-categories can be replaced by strictly commutative objects in the larger category of diagrams of simplicial sets indexed by finite sets and injections. This complements earlier work on…
A decidability proof for bisimulation equivalence of first-order grammars (finite sets of labelled rules for rewriting roots of first-order terms) is presented. The equivalence generalizes the DPDA (deterministic pushdown automata)…
We study linear and hermitian representations of finite $C_2$-graded groups. We prove that the category of linear representations is equivalent to a category of antilinear representations as an $\infty$-category. We also prove that the…
This is a survey on permutation classes for the upcoming book Handbook of Enumerative Combinatorics.
We develop a symmetric monoidal closed category of games, incorporating sums and products, to model quantum computation at higher types. This model is expressive, capable of representing all unitary operators at base types. It is compatible…
We prove that a pair of singularities related by a transformation arising from the McKay correspondence are orbifold equivalent. From this we deduce a new proof of a McKay type equivalence for the matrix factorization categories.
We introduce the notion of a definable category--a category equivalent to a full subcategory of a locally finitely presentable category that is closed under products, directed colimits and pure subobjects. Definable subcategories are…
In this paper, we prove that given a differential graded category C and B a full differential graded subcategory closed under coproducts, there is a canonical recollement of differential graded categories, for which we use enriched…
We describe all closed permutation groups which act on the set of vectors of a countable vector space $V$ over a prime field of odd order and which contain all automorphisms of $V$. In particular, we prove that their number is finite. These…
In this paper we have investigated enumeration orders of elements of r.e. sets enumerated by means of Turing machines. We have defined a reducibility based on enumeration orders named "Enumeration Order Reducibility" on computable functions…