相关论文: A Refinement of the Function $g(m)$ on Grimm Conje…

Following Symanzik we argue that the Schr\"odinger functional in lattice gauge theories without matter fields has a well-defined continuum limit. Due to gauge invariance no extra counter terms are required. The Schr\"odinger functional is,…

We consider the function $G(n)=\frac{\sigma(n)}{n\log\log n}$ (where $\sigma(n)=\sum_{d|n}d$) and set an imposed condition on its argument $n$, the fulfillment of which is sufficient for the existence of a prime $p$, at which $G(np)>G(n)$.…

We first give a combinatorial proof of Stanley's shuffle theorem by using the insertion lemma of Haglund, Loehr and Remmel. Based on this combinatorial construction, we establish several refinements of Stanley's shuffle theorem.

Here we simplify the proof of the de Rham theorem for Schwartz functions on affine Nash manifolds and generalize the result to the case of non affine Nash manifolds.

It is expected that Schanuel's Conjecture contains all ``reasonable" statements that can be made on the values of {\em the exponential function}. In particular it implies the Lindemann-Weierstrass Theorem and the Conjecture on algebraic…

In this paper, we establish a generalized Taylor expansion of a given function $f$ in the form $\displaystyle{f(x) = \sum_{j=0}^m c_j^{\alpha,\rho}\left(x^\rho-a^\rho\right)^{j\alpha} + e_m(x)}$ \noindent with $m\in \mathbb{N}$,…

This paper proves a conjecture proposed by Ren and Li (2015: 393, \emph{Journal of Inequalities and Applications}). Our result eliminates the constraints on the parity and size of $m$, as well as the restriction $x > 1$, required in Ren and…

Transformation formulas for four-parameter refinements of the q-trinomial coefficients are proven. The iterative nature of these transformations allows for the easy derivation of several infinite series of q-trinomial identities, and can be…

Ron Graham introduced a function, $g(n)$, on the non-negative integers, in the 1986 Issue $3$ Problems column of \textit{Mathematical Magazine}: For each non-negative integer $n$, $g(n)$ is the least integer $s$ so that the integers $n + 1,…

With the aim of treating the local behaviour of additive functions, we develop analogues of the Matom\"{a}ki-Radziwill theorem that allow us to approximate the average of a general additive function over a typical short interval in terms of…

We provide empirical evidence for the Erd\H{o}s-Straus conjecture by improving computational bounds to $10^{18}$ and by evaluating the solution-counting function $f(p)$ for this conjecture.

The series expansion at the origin of the Airy function Ai(x) is alternating and hence problematic to evaluate for x > 0 due to cancellation. Based on a method recently proposed by Gawronski, M\"uller, and Reinhard, we exhibit two functions…

Some Titchmarsh results following Gram's law are improved in this paper.

In this paper we establish a result on subextension of $m$-subharmonic functions in the class $\mathcal{F}_m(\Omega,f)$ without changing the hessian measures. As application, we approximate a $m$-subharmonic function with given boudary…

In this paper we improve the result of Akbary and Hambrook by a factor of log x by obtaining a better version of Vaughan's inequality and using the explicit variant of an inequality connected to the M\"obius function, derived by Helfgott in…

In this paper, we propose a new height function for a variety defined over a finitely generated field over Q. For this height function, we will prove Northcott's theorem and Bogomolov's conjecture, so that we can recover the original…

Mimetic gravity analysis has been studied as a theory in various types of general relativity extensions, such as mimetic f(R) gravity, mimetic f(R, T) gravity, mimetic f(R, G) gravity, etc., in the literature. This paper presents a set of…

Lifting theorems are theorems that bound the communication complexity of a composed function $f\circ g^{n}$ in terms of the query complexity of $f$ and the communication complexity of $g$. Such theorems constitute a powerful generalization…

We improve the theorem on continuous dependence of solutions of functional differential equations (see J. Hale, Functional differential equations, theorem 5.1), using some new results on continuous convergences. Namely, we prove this…

We prove that any stable method for resolving the Gibbs phenomenon - that is, recovering high-order accuracy from the first $m$ Fourier coefficients of an analytic and nonperiodic function - can converge at best root-exponentially fast in…