Related papers: Higher limits, homology theories and fr-codes
It is known that, for $C$ an abelian category and $I$ small, the functor category $C^I$ is again abelian; thus we can do homology in such categories, and examine how it relates to homology in $C$ itself. However, there does not seem to be…
The field of analytic combinatorics is dedicated to the creation of effective techniques to study the large-scale behaviour of combinatorial objects. Although classical results in analytic combinatorics are mainly concerned with univariate…
Let $n$ be a prime power, $r$ be a prime with $r\mid n-1$, and $\varepsilon\in (0,1/2)$. Using the theory of multiplicative character sums and superelliptic curves, we construct new codes over $\mathbb F_r$ having length $n$, relative…
In this article we describe an algebraic framework which can be used in three related but different contexts: string topology, symplectic field theory, and Lagrangian Floer theory of higher genus. It turns out that the relevant algebraic…
The concept of a variance on a category is introduced as a two-sided strict factorization system. By employing variances, we define functors of variance in a more general setting than is usually considered, thereby eliminating the need for…
In this article we mainly study linear codes over $\mathbb{F}_{2^n}$ and their binary subfield codes. We construct linear codes over $\mathbb{F}_{2^n}$ whose defining sets are the certain subsets of $\mathbb{F}_{2^n}^m$ obtained from…
We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…
This is the writeup of an expository talk. It is intended as an introduction to the work of Hopkins, Kuhn, and Ravenel on generalized group characters, which seems to fit very well with the theory of what physicists call higher twisted…
A connection between the Galois-theoretic approach to semi-abelian homology and the homological closure operators is established. In particular, a generalised Hopf formula for homology is obtained, allowing the choice of a new kind of…
This article is an introduction to formal languages from the point of view of combinatorial group theory. Group theoretic applications are included and language classes are defined algebraically.
We study the problem of lifting and restricting TTF triples (equivalently, recollement data) for a certain wide type of triangulated categories. This, together with the parametrizations of TTF triples given in "Parametrizing recollement…
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of…
In this note some recent developments in the study of homology in semi-abelian categories are briefly presented. In particular the role of protoadditive functors in the study of Hopf formulae for homology is explained.
Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…
The codewords of the homomorphism code $\operatorname{aHom}(G,H)$ are the affine homomorphisms between two finite groups, $G$ and $H$, generalizing Hadamard codes. Following the work of Goldreich--Levin (1989), Grigorescu et al. (2006),…
Second-order Boolean logic is a generalization of QBF, whose constant alternation fragments are known to be complete for the levels of the exponential time hierarchy. We consider two types of restriction of this logic: 1) restrictions to…
Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…
Holderian functions have strong non-linearities, which result in singularities in the derivatives. This manuscript presents several fractional-order Taylor expansions of H\"olderian functions around points of non- differentiability. These…
Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with…
We introduce the factor complex of a neural code, and show how intervals and maximal codewords are captured by the combinatorics of factor complexes. We use these results to obtain algebraic and combinatorial characterizations of…