Related papers: Proof-theoretic dilator and intermediate pointclas…
This paper is a mixture of expository material and current research material. Among new results are examples of generalised harmonic spinors and their gauged version, the generalised Seiberg-Witten equations.
A Maillet-Malgrange type theorem is proved for a Dulac series (in the general case, with complex exponents), which formally satisfies an analytical ordinary differential equation (ODE). This theorem allows to estimate the growth of the…
In classical set theory, there are many equivalent ways to introduce ordinals. In a constructive setting, however, the different notions split apart, with different advantages and disadvantages for each. We consider three different notions…
This is the revised version of the second paper in a series introducing a generalized Fredholm theory in a new class of smooth spaces called polyfolds. The theory will be illustrated in upcoming papers by applications to Floer Theory,…
The generalization of new mock theta functions of Andrews and Bringmann et al are given. Further we have given the expansion of these bilateral generalized new mock theta functions as 2 phi 1 series by Slaters transformation. After that we…
We study the distribution functions of several classical error terms in analytic number theory, focusing on the remainder term in the Dirichlet divisor problem $\Delta(x)$. We first bound the discrepancy between the distribution function of…
We introduce and systematically develop two classes of discrete integrable operators: those with $2\times 2$ matrix kernels and those possessing general differential kernels, thereby generalizing the discrete analogue previously studied. A…
We develop a wide general theory of bilinear bi-parameter singular integrals $T$. First, we prove a dyadic representation theorem starting from $T1$ assumptions and apply it to show many estimates, including $L^p \times L^q \to L^r$…
In this paper we first offer an alternative approach to extend the original Fueter's Theorem in Dunkl-Clifford analysis to a version of the higher order case. Then this result is used to prove a generlized version of Fueter's Theorem with…
The second author studied arithmetic properties of a class of sequences that generalize the sequence of derangements. The aim of the following paper is to disprove two conjectures stated in \cite{miska}. The first conjecture regards the set…
The recent proposal by Ben-Zvi, Sakellaridis and Venkatesh of a duality in the relative Langlands program, leads, via the process of quantization of Hamiltonian varieties, to a duality theory of branching problems. This often unexpectedly…
Copulas have now become ubiquitous statistical tools for describing, analysing and modelling dependence between random variables. Sklar's theorem, "the fundamental theorem of copulas", makes a clear distinction between the continuous case…
In this paper we study the general group classification of systems of linear second-order ordinary differential equations inspired from earlier works and recent results on the group classification of such systems. Some interesting results…
For $\mathcal{O}$ a reduced operad, a generalized divergence from the derivations of a free $\mathcal{O}$-algebra to a suitable trace space is constructed. In the case of the Lie operad, this corresponds to Satoh's trace map and, for the…
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…
We define a diffeology on the Milnor classifying space of a diffeological group $G$, constructed in a similar fashion to the topological version using an infinite join. Besides obtaining the expected classification theorem for smooth…
Two classifications of second order ODE's cubic with respect to the first order derivative are compared in the case of general position, which is common for both classifications. The correspondence of vectorial, pseudovectorial, scalar, and…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…
Linear Logic refines Intuitionnistic Logic by taking into account the resources used during the proof and program computation. In the past decades, it has been extended to various frameworks. The most famous are indexed linear logics which…