Related papers: A syntactical proof of the operational equivalence…
In this largely expository paper, we will present a list of En -operads and give complete, and in some cases new, proofs of the equivalences between these operads.
The formal system $\lambda\delta$ is a typed lambda calculus derived from $\Lambda_\infty$, aiming to support the foundations of Mathematics that require an underlying theory of expressions (for example the Minimal Type Theory). The system…
In the present paper we investigate the set $\Sigma_J$ of all $J$-self-adjoint extensions of a symmetric operator $S$ with deficiency indices $<2,2>$ which commutes with a non-trivial fundamental symmetry $J$ of a Krein space…
In the paper, the author presents a double inequality for completely monotonic degree of a remainder for an asymptotic expansion of the trigamma function. This result partially confirms one in a series of conjectures on completely monotonic…
In this report we construct a family of holomorphic functions $\beta_{\lambda,\mu} (s)$ which behave asymptotically like iterated exponentials as $|s| \to \infty$ in the right half plane. Each $\beta_{\lambda,\mu}$ satisfies a convenient…
The present essay aims at investigating whether and how far an algebraic analysis of the Zeta Function and of the Riemann Hypothesis can be carried out. Of course the well-established properties of the Zeta Function, explored in depth in…
We give a type system in which the universe of types is closed by reflection into it of the logical relation defined externally by induction on the structure of types. This contribution is placed in the context of the search for a natural,…
We revisit a representation for the Riemann zeta function $\zeta(s)$ expressed in terms of normalised incomplete gamma functions given by the author and S. Cang in Methods Appl. Anal. {\bf 4} (1997) 449--470. Use of the uniform asymptotics…
We prove the Extended Delta Conjecture of Haglund, Remmel, and Wilson, a combinatorial formula for $\Delta _{h_l}\Delta' _{e_k} e_{n}$, where $\Delta' _{e_k}$ and $\Delta_{h_l}$ are Macdonald eigenoperators and $e_n$ is an elementary…
We propose and analyze a symmetric version of the Zassenhaus formula for disentangling the exponential of two non-commuting operators. A recursive procedure for generating the expansion up to any order is presented which also allows one to…
We systematically study several versions of the disjunction and the existence properties in modal arithmetic. First, we newly introduce three classes $\mathrm{B}$, $\Delta(\mathrm{B})$, and $\Sigma(\mathrm{B})$ of formulas of modal…
We give an elementary proof of the development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions.
We will use a discrete analogue of the classical \emph{Laplace} method to show that for infinitely many positive integers $n$, the main term of the asymptotic expansions of scaled confluent basic hypergeometric functions, including the…
We prove an equivalent of the Riemann hypothesis in terms of the functional equation (in its asymmetrical form) and the $a$-points of the zeta-function, i.e., the roots of the equation $\zeta(s)=a$, where $a$ is an arbitrary fixed complex…
We prove that every abstract elementary class (a.e.c.) with LST number $\kappa$ and vocabulary $\tau$ of cardinality $\leq \kappa$ can be axiomatized in the logic ${\mathbb L}_{\beth_2(\kappa)^{+++},\kappa^+}(\tau)$. In this logic an a.e.c.…
Given a symmetric linear transformation on a Hilbert space, a natural problem to consider is the characterization of its set of symmetric extensions. This problem is equivalent to the study of the partial isometric extensions of a fixed…
Turner's bracket abstraction algorithm is perhaps the most well-known improvement on simple bracket abstraction algorithms. It is also one of the most studied bracket abstraction algorithms. The definition of the algorithm in Turner's…
We define an extension of the simply-typed lambda calculus where two different binding mechanisms, by position and by name, nicely coexist. In the former, as in standard lambda calculus, the matching between parameter and argument is done…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
We prove uniform versions of two classical results in analytic number theory. The first is an asymptotic for the number of points of a complete lattice $\Lambda \subseteq \mathbb{R}^d$ inside the $d$-sphere of radius $R$. In contrast to…