相关论文: Generalizations of the Recursion Theorem
The Defect Recollement, Restriction Recollement, Auslander-Gruson-Jensen Recollement, and others, are shown to be instances of a general construction using derived functors and methods from stable module theory. The right derived functors…
Two new formulations of general relativity are introduced. The first one is a parabolization of the Arnowitt, Deser, Misner (ADM) formulation and is derived by addition of combinations of the constraints and their derivatives to the…
We derive an infinite set of recursion formulae for Nekrasov instanton partition function for linear quiver U(N) supersymmetric gauge theories in 4D. They have a structure of a deformed version of W_{1+\infty} algebra which is called SH^c…
The notion of a $\delta$-generic sequence of P-points is introduced in this paper. It is proved assuming the Continuum Hypothesis that for each $\delta < {\omega}_{2}$, any $\delta$-generic sequence of P-points can be extended to an…
In this article, intended for the Handbook of Recursion Theory, we survey recursion theory on the ordinal numbers, with sections devoted to $\alpha$-recursion theory, $\beta$-recursion theory and the study of the admissibility spectrum.
After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…
Taking a hint from Dirac's large number hypothesis, we note the existence of cosmologically combined conservation laws that work to cosmologically long time. We thus modify Einstein's theory of general relativity with fixed gravitation…
We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the…
We carry out a proof theoretic analysis of the wellfoundedness of recursive path orders in an abstract setting. We outline a very general termination principle and extract from its wellfoundedness proof subrecursive bounds on the size of…
Using a Zariski topology associated to a finite field extensions, we give new proofs and generalize the primitive and normal basis theorems.
This paper gives the most general form of the Adler-Kostant-Symes Theorem, and many applications of it, both finite and infinite dimensional, the former yielding algebraic completely integrable (a.c.i.) systems, and the latter examples in…
Explicit determinations of several classes of trigonometric sums are given. These sums can be viewed as analogues or generalizations of Gauss sums. In a previous paper, two of the present authors considered primarily sine sums associated…
The author in [7] was proved the generalized remainder and quotient theorems of polynomial in one indeterminate where the divisor is complete factorization to linear factors. In this paper we give the formula for the generalized remainder…
The objective of this second part of the work is to present heuristic derivations of the three classical tests of general relativity. These derivations are based on the Einstein equivalence principle and use Newtonian physics as a…
The aim of this work is to extend and prove the Onsager conjecture for a class of conservation laws that possess generalized entropy. One of the main findings of this work is the "universality" of the Onsager exponent, $\alpha > 1/3$,…
In 1969, Andrews proved a theorem on partitions with difference conditions which generalises Schur's celebrated partition identity. In this paper, we generalise Andrews' theorem to overpartitions. The proof uses q-differential equations and…
We generalize several classical theorems in extremal combinatorics by replacing a global constraint with an inequality which holds for all objects in a given class. In particular we obtain generalizations of Tur\'an's theorem, the…
This is an elementary expository article regarding the application of Kleene's Recursion Theorems in making definitions by recursion. Whereas the Second Recursion Theorem (SRT) is applicable in a first-order setting, the First Recursion…
The well-known Leibniz theorem (Leibniz Criterion or alternating series test) of convergence of alternating series is generalized for the case when the absolute value of terms of series are "not absolutely monotonously" convergent to zero.…
Given two polynomials, we find a convergence property of the GCD of the rising factorial and the falling factorial. Based on this property, we present a unified approach to computing the universal denominators as given by Gosper's algorithm…