Related papers: Revisiting an infinitely nested radical
We present a new, scalable alternative to the structured singular value, which we call $\nu$, provide a convex upper bound, study their properties and compare them to $\ell_1$ robust control. The analysis relies on a novel result on the…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
Ramanujan's Master Theorem is a decades-old theorem in the theory of Mellin transforms which has wide applications in both mathematics and high energy physics. The unconventional method of Ramanujan in his proof of the theorem left…
In this short note we use the umbral formalism to derive the Ramanujan Master Theorem and discuss its extension to more general cases.
A new sums-of-tails identity involving two parameters $b$ and $d$ is obtained and is used to derive more results of similar type. One of Ramanujan's sums-of-tails identities from the Lost Notebook is shown to be a special case of our…
We present a method for iterating semiproper forcing which uses side conditions and is inspired by the technique recently introduced by Neeman.
Systems of orthogonal polynomials whose recurrence coefficients tend to infinity are considered. A summability condition is imposed on the coefficients and the consequences for the measure of orthogonality are discussed. Also discussed are…
In 1915, Ramanujan proved asymptotic inequalities for the sum of divisors function, assuming the Riemann hypothesis (RH). We consider a strong version of Ramanujan's theorem and define highest abundant numbers that are extreme with respect…
In this work we present a new local to global criterion for proving a form of high dimensional expansion, which we term cosystolic expansion. Applying this criterion on Ramanujan complexes, yields for every dimension, an infinite family of…
In this note, it is shown that the Ramanujan Master Theorem (RMT) when n is a positive integer can be obtained, as a special case, from a new integral formula. Furthermore, we give a simple proof of the RMT when n is not an integer.
We present two tools, which could be useful in determining whether or not a non-Homogenous Linear Recurrence can reach a desired rational. First, we derive the determinant that is equal to the ith term in a non-Homogenous Linear Recurrence.…
The elements of a finite partial order $P$ can be identified with the maximal indecomposable two-sided ideals of its incidence algebra $\A$, and then for two such ideals, $I\prec J \iff IJ \not=0$. This offers one way to recover a poset…
In 1918 S. Ramanujan defined a family of trigonometric sum now known as Ramanujan sums. In the last few years, Ramanujan sums have inspired the signal processing community. In this paper, we have defined an operator termed here as Ramanujan…
In this paper we want to prove some formulas listed by S. Ramanujan in his paper "Modular equations and approximations to $\pi$" \cite{24} with an elementary method.
In this note we discuss a variant of linear logic with idempotent exponential modalities. We propose a sequent calculus system and discuss its semantics. We also give a concrete relational model for this calculus.
A systematic method of summing the corrections to the renormalon residue arising from higher order renormalons is discussed.
We use reproducing kernel methods to study various rigidity problems. The methods and setting allow us to also consider the non-positive case.
I review various aspects of Feynman integrals, regularization and renormalization. Following Bloch, I focus on a linear algebraic approach to the Feynman rules, and I try to bring together several renormalization methods found in the…
This contribution is a technical description of details for implementing infinite elements. The novelty is the closed, analytic form used for most quantities.
Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.