Related papers: Categorifying induction formulae via divergent ser…
Let $G$ be a finite group. A contravariant functor from the category of finite free $G$-sets to vector spaces has an associated Hilbert series, which records the underlying sequence of $G^n$ representations, $n \in \mathbb N$. We prove that…
We provide a family of group measure space II_1 factors for which all finite index subfactors can be explicitly listed. In particular, the set of all indices of irreducible subfactors can be computed. Concrete examples show that this index…
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
Departing from a class of infinite series with central binomial coefficients in the numerator and depending on a positive integer parameter, we first extend known identities to all complex parameters. Then we use various methods, including…
Lusztig proved the compatibility of induction functors and restriction functors for Lusztig's perverse sheaves. Fang-Lan-Xiao established a categorification of Green's formula and gave a sheaf-level proof of this compatibility for all…
We extend the theory of Mackey 2-functors introduced in arXiv:1808.04902 by defining the appropriate notion of rings, namely Green 2-functors. After providing the first results of our theory and abundant examples, we show how all classical…
We derive modular parametrizations for certain infinite series whose summands involve central binomial coefficients and higher-order harmonic numbers. When the rates of convergence are certain rational numbers, modularity allows us to…
This note is motivated by the problem to understand, given a commutative ring F, which G-sets X, Y give rise to isomorphic F[G]-representations F[X]\cong F[Y]. A typical step in such investigations is an argument that uses induction…
The paper presents a new algorithmic construction of a finite generating set of rational invariants for the rational action of an algebraic group on the affine space. The construction provides an algebraic counterpart of the moving frame…
We present new induction principles for the syntax of dependent type theories, which we call relative induction principles. The result of the induction principle relative to a functor F into the syntax is stable over the codomain of F. We…
Using a variant of Schreier's Theorem, and the theory of Green's relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to…
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values),…
This paper proposes new derivations of three well-known sorting algorithms, in their functional formulation. The approach we use is based on three main ingredients: first, the algorithms are derived from a simpler algorithm, i.e. the…
A family of formal power series, such that its coefficients satisfy a recursion formula, is characterized in terms of the summability, in the sense of J. P. Ramis, of its elements along certain well chosen directions. We describe a set of…
We introduce a method for associating a chain complex to a module over a combinatorial category, such that if the complex is exact then the module has a rational Hilbert series. We prove homology--vanishing theorems for these complexes for…
Conceiving of premises as collected into sets or multisets, instead of sequences, may lead to triviality for classical and intuitionistic logic in general proof theory, where we investigate identity of deductions. Any two deductions with…
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…
We show how to convert divergent series, which typically occur in many applications in physics, into rapidly convergent inverse factorial series. This can be interpreted physically as a novel resummation of perturbative series. Being…
The algorithm of computing generalized Green functions of a finite reductive group contains some unkonwn scalars occuring from the F_q structure of irreducible local systems on unipotent classes on G. In this paper, we determine such…