相关论文: A streamlined proof of Goodwillie's n-excisive app…

In this paper we give simple proofs for the bounds (some of them sharp) of the difference of the moduli of the second and the first logarithmic coefficient for the general class of univalent functions and for the class of convex univalent…

We give a new proof of Dunn's additivity for the little $n$-cubes operads $C_n$, which has the advantage of being considerably shorter than the ones in the literature. At the end we remark on how our proof can be adjusted to work for the…

In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…

Following T. H. Chan, we consider the problem of approximation of a given rational fraction a/q by sums of several rational fractions a_1/q_1, ..., a_n/q_n with smaller denominators. We show that in the special cases of n=3 and n=4 and…

In recent research, some of the present authors introduced the concept of an n-dimensional Boolean algebra and its corresponding propositional logic nCL, generalising the Boolean propositional calculus to n>= 2 perfectly symmetric truth…

In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…

For odd primes we prove some structure theorems for finite $p$-groups $G$, such that $G''\neq 1$ and $|G'/G''|=p^3$. Building on results of Blackburn and Hall, it is shown that $\lcs G3$ is a maximal subgroup of $G'$, the group $G$ has a…

The spectral sequence associated to the Arone-Goodwillie tower for the n-fold loop space functor is used to show that the first two non-trivial layers of the nilpotent filtration of the reduced mod 2 cohomology of a (sufficiently connected)…

For processes involving structure functions and/or fragmentation functions, arguments that there is a part that dominates the NLO corrections are briefly reviewed. The arguments are tested against more recent NLO and in particular NNLO…

We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to express the exact partition function Z of a graphical model as a…

We prove the so-called inverse conjecture for the Gowers U^{s+1}-norm in the case s = 3 (the cases s < 3 being established in previous literature). That is, we establish that if f : [N] -> C is a function with |f(n)| <= 1 for all n and || f…

We introduce a variant of the multiplicative Sewing Lemma in [Gerasimovi\v{c}s, Hocquet, Nilssen; J. Funct. Anal. 281 (2021)] which yields arbitrary high order weak approximations to stochastic differential equations, extending the cubature…

This article describes a formal strategy of geometric complexity theory (GCT) to resolve the {\em self referential paradox} in the $P$ vs. $NP$ and related problems. The strategy, called the {\em flip}, is to go for {\em explicit proofs} of…

We develop a method to construct elusive functions using techniques of commutative algebra and algebraic geometry. The key notions of this method are elusive subsets and evaluation mappings. We also develop the effective elimination theory…

We establish a Liouville type theorem for the fractional Lane-Emden system: \begin{eqnarray*} \left\{\begin{array}{l@{\quad }l} (-\Delta)^\alpha u=v^q&{\rm in}\,\,\R^N,\\ (-\Delta)^\alpha v=u^p&{\rm in}\,\,\R^N, \end{array} \right.…

We present a constructive proof of Ky Fan's combinatorial lemma concerning labellings of triangulated spheres. Our construction works for triangulations of $S^n$ that contain a flag of hemispheres. As a consequence, we produce a…

We lay down the foundations of a theory of parametrised functor calculus, generalising parts of the functor calculus of Goodwillie. We introduce the notion of excisable posets and develop a theory of excisive approximations in this context.…

We prove the famous Faber intersection number conjecture and other more general results by using a recursion formula of $n$-point functions for intersection numbers on moduli spaces of curves. We also present some vanishing properties of…

A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…

The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional programs. The reachability problem, however, often becomes undecidable for a slight…