English
Related papers

Related papers: Generalizations of the Recursion Theorem

200 papers

We discuss the (non)effectivity of Arslanov's completeness criterion. In particular, we show that a parameterized version, similar to the recursion theorem with parameters, fails. We also discuss the parameterized version of another…

Logic · Mathematics 2018-04-05 Sebastiaan A. Terwijn

In the context of his theory of numberings, Ershov showed that Kleene's recursion theorem holds for any precomplete numbering. We discuss various generalizations of this result. Among other things, we show that Arslanov's completeness…

Logic · Mathematics 2018-10-23 H. P. Barendregt , S. A. Terwijn

We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions

Number Theory · Mathematics 2013-07-02 Cheng Lien Lang , Mong Lung Lang

We prove two generalisations of the Binomial theorem that are also generalisations of the q-binomial theorem. These generalisations arise from the commutation relations satisfied by the components of the co-multiplications of non-simple…

Quantum Algebra · Mathematics 2007-05-23 Sacha C. Blumen

A great number of articles widen a known scientific result $P(a)$ (such as: a theorem, an inequality, or a math/physics/chemical etc. proposition or formula) by a simple recurrence procedure and using, in the proof, the proposition $P(a)$…

General Mathematics · Mathematics 2010-03-29 Florentin Smarandache

We obtain a unification of two refinements of Euler's partition theorem respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodt's insertion algorithm for a generalization of the Andrews-Olsson partition identity is used…

Combinatorics · Mathematics 2009-02-25 William Y. C. Chen , Henry Y. Gao , Kathy Q. Ji , Martin Y. X. Li

Girstmair in [1, Theorem 1] gave a generalization of Murty's irreducibility criterion (see [2, Theorem 1]). In this article, we further generalize these criteria.

History and Overview · Mathematics 2023-04-28 Jitender Singh , Sanjeev Kumar

Empirically, neural networks that attempt to learn programs from data have exhibited poor generalizability. Moreover, it has traditionally been difficult to reason about the behavior of these models beyond a certain level of input…

Machine Learning · Computer Science 2017-04-24 Jonathon Cai , Richard Shin , Dawn Song

We prove two universality results for random tensors of arbitrary rank D. We first prove that a random tensor whose entries are N^D independent, identically distributed, complex random variables converges in distribution in the large N…

Probability · Mathematics 2013-05-07 Razvan Gurau

Consider a system $(X, \mathcal{F}, \mu, T)$, bounded functions $f_1, f_2 \in L^\infty(\mu)$ and $a,b \in \ZZ.$ We show that there exists a set of full measure $X_{f_1, f_2}$ in $X$ such that for all $x \in X_{f_1, f_2}$ and for every…

Dynamical Systems · Mathematics 2016-09-19 Idris Assani

In high-dimensional statistical inference, sparsity regularizations have shown advantages in consistency and convergence rates for coefficient estimation. We consider a generalized version of Sparse-Group Lasso which captures both…

Machine Learning · Statistics 2020-08-12 Xinyu Zhang

We use the theory of $x-y$ duality to propose a new definition / construction for the correlation differentials of topological recursion; we call it "generalized topological recursion". This new definition coincides with the original…

Mathematical Physics · Physics 2025-05-13 Alexander Alexandrov , Boris Bychkov , Petr Dunin-Barkowski , Maxim Kazarian , Sergey Shadrin

We extend the authors' previous work on Wiener-Wintner double recurrence theorem to the case of polynomials.

Dynamical Systems · Mathematics 2014-08-26 Idris Assani , Ryo Moore

We prove a general statement about the integrality of the sequences generated by a recursion of the following form: $nu_n$ equals a linear combination of $u_{n-1},u_{n-2},\dots,u_0$ with polynomial coefficients in $n$ of special form. This…

Number Theory · Mathematics 2026-04-21 Florian Fürnsinn , Danylo Radchenko , Wadim Zudilin

In this paper we introduce a general theory for nonlinear sufficient dimension reduction, and explore its ramifications and scope. This theory subsumes recent work employing reproducing kernel Hilbert spaces, and reveals many parallels…

Statistics Theory · Mathematics 2013-04-03 Kuang-Yao Lee , Bing Li , Francesca Chiaromonte

In this paper, we outline a method to determine all recursive relations for a subnormal 2-variable weighted shift, up to total degree $k$, entirely from the representing measure. This allows us to show that the densities of the atoms do not…

Functional Analysis · Mathematics 2025-07-04 Edward L. White

The main result is a generalization of Keller's recursion equation for finding a prime number given the previous primes. We also examine the convergence of the limit in Keller's equation and the convergence of the limit in the general…

Number Theory · Mathematics 2013-11-19 James Haley

We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general…

Statistics Theory · Mathematics 2007-05-23 Teo Sharia

In this paper, the improvement about the generalized Kolmogorov-type three series theorem, in the case of NQD random variables, is obtained by different method. Furthermore, the generalized Kolmogorov-type three series theorem is…

Probability · Mathematics 2014-02-14 Shi Jianhua , Chen Xiaoping

We show that certain general properties of threshold and joint resummations in Drell-Yan cross sections hold as well for their crossed analogs in semi-inclusive deep-inelastic scattering and double-inclusive leptonic annihilation. We show…

High Energy Physics - Phenomenology · Physics 2008-11-26 George Sterman , Werner Vogelsang
‹ Prev 1 2 3 10 Next ›