Convergence properties of generalized Lupaş-Kantorovich operators

In the present paper, we consider the Kantorovich modification of generalized Lupaş operators, whose construction depends on a continuously differentiable, increasing and unbounded function $\rho$. For these new operators we give weighted approximation, Voronovskaya type theorem, quantitative estimates for the local approximation.

Growth Analysis of Meromorphic Solutions of Linear Difference Equations with Entire or Meromorphic Coefficients of Finite φ-Order

Many researchers’ attentions have been attracted to various growth properties of meromorphic solution f (of finite φ-order) of the following higher order linear difference equation Anzfz+n+...+A1zfz+1+A0zfz=0, where Anz,…,A0z are entire or meromorphic coefficients (of finite φ-order) in the complex plane (φ:[0,∞)→(0,∞) is a non-decreasing unbounded function). In this paper, by introducing a constant b (depending on φ) defined by lim̲r→∞logrlogφ(r)=b<∞, and we show how nicely diverse known results for the meromorphic solution f of finite φ-order of the above difference equation can be modified.

On Super Strong ETH

Multiple known algorithmic paradigms (backtracking, local search and the polynomial method) only yield a 2n(1-1/O(k)) time algorithm for k-SAT in the worst case. For this reason, it has been hypothesized that the worst-case k-SAT problem cannot be solved in 2n(1-f(k)/k) time for any unbounded function f. This hypothesis has been called the "Super-Strong ETH", modelled after the ETH and the Strong ETH. It has also been hypothesized that k-SAT is hard to solve for randomly chosen instances near the "critical threshold", where the clause-to-variable ratio is such that randomly chosen instances are satisfiable with probability 1/2. We give a randomized algorithm which refutes the Super-Strong ETH for the case of random k-SAT and planted k-SAT for any clause-to-variable ratio. For example, given any random k-SAT instance F with n variables and m clauses, our algorithm decides satisfiability for F in 2n(1-c*log(k)/k) time with high probability (over the choice of the formula and the randomness of the algorithm). It turns out that a well-known algorithm from the literature on SAT algorithms does the job: the PPZ algorithm of Paturi, Pudlak, and Zane (1999). The Unique k-SAT problem is the special case where there is at most one satisfying assignment. Improving prior reductions, we show that the Super-Strong ETHs for Unique k-SAT and k-SAT are equivalent. More precisely, we show the time complexities of Unique k-SAT and k-SAT are very tightly correlated: if Unique k-SAT is in 2n(1-f(k)/k) time for an unbounded f, then k-SAT is in 2n(1-f(k)/(2k)) time.

Convergence of modified Szász-Mirakyan-Durrmeyer operators depending on certain parameters

<p style='text-indent:20px;'>Motivated by certain generalizations, in this paper we consider a new analogue of modified Szá sz-Mirakyan-Durrmeyer operators whose construction depends on a continuously differentiable, increasing and unbounded function <inline-formula><tex-math id="M1">\begin{document}$ \tau $\end{document}</tex-math></inline-formula> with extra parameters <inline-formula><tex-math id="M2">\begin{document}$ \mu $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M3">\begin{document}$ \lambda $\end{document}</tex-math></inline-formula>. Depending on the selection of <inline-formula><tex-math id="M4">\begin{document}$ \mu $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M5">\begin{document}$ \lambda $\end{document}</tex-math></inline-formula>, these operators are more flexible than the modified Szá sz-Mirakyan-Durrmeyer operators while retaining their approximation properties. For these operators we give weighted approximation, Voronovskaya type theorem and quantitative estimates for the local approximation.</p>

On the growth analysis of meromorphic solutions of finite ϕ-order of linear difference equations

In this paper, we investigate some growth properties of meromorphic solutions of higher-order linear difference equationA_{n}(z)f(z+n)+\dots+A_{1}(z)f(z+1)+A_{0}(z)f(z)=0,where {A_{n}(z),\dots,A_{0}(z)} are meromorphic coefficients of finite φ-order in the complex plane where φ is a non-decreasing unbounded function. We extend some earlier results of Latreuch and Belaidi [Z. Latreuch and B. Belaïdi, Growth and oscillation of meromorphic solutions of linear difference equations, Mat. Vesnik 66 2014, 2, 213–222].

Analytic Feynman Integral and a Change of Scale Formula for Wiener Integrals of an Unbounded Cylinder Function

We investigate the behavior of the unbounded cylinder function F x = ∫ 0 T α 1 t d x t 2 k ⋅ ∫ 0 T α 2 t d x t 2 k ⋅ ⋯ ⋅ ∫ 0 T α n t d x t 2 k , k = 1,2 , … whose analytic Wiener integral and analytic Feynman integral exist, we prove some relationships among the analytic Wiener integral, the analytic Feynman integral, and the Wiener integral, and we prove a change of scale formula for the Wiener integral about the unbounded function on the Wiener space C 0 0 , T .

On Different Relative Growth Factors of Entire Functions

In this paper we investigate some properties related to sum and product of different relative growth factors of an entire function with respect to another entire function in connection with a special type of non-decreasing, unbounded function ψ.

Relative (p,q)-φ order and relative (p,q)-φ type based on some growth properties of composite p-adic entire functions

Let K be a complete ultrametric algebraically closed field and A (K) be the K-algebra of entire functions on K. For any p adic entire functions f ∈ A (K) and r > 0, we denote by |f| (r) the number sup {|f (x) | : |x| = r} where |·| (r) is a multiplicative norm on A (K) . In this paper we study some growth properties of composite p-adic entire functions on the basis of their relative (p, q)-ϕ order, relative (p, q)-ϕ type and relative (p, q)-ϕ weak type where p, q are any two positive integers and ϕ (r) : [0, +∞) → (0, +∞) is a non-decreasing unbounded function of r.

Permutations with Orders Coprime to a Given Integer

Let $m$ be a positive integer and let $\rho(m,n)$ be the proportion of permutations of the symmetric group $\mathrm{Sym}(n)$ whose order is coprime to $m$. In 2002, Pouyanne proved that $\rho(n,m)n^{1-\frac{\phi(m)}{m}}\sim \kappa_m$ where $\kappa_m$ is a complicated (unbounded) function of $m$. We show that there exists a positive constant $C(m)$ such that, for all $n \geq m$,\[C(m) \left(\frac{n}{m}\right)^{\frac{\phi(m)}{m}-1} \leq \rho(n,m) \leq \left(\frac{n}{m}\right)^{\frac{\phi(m)}{m}-1}\]where $\phi$ is Euler's totient function.

Approximation by Generalized Lupaş Operators Based on q-Integers

The purpose of this paper is to introduce q-analogues of generalized Lupaş operators, whose construction depends on a continuously differentiable, increasing, and unbounded function ρ . Depending on the selection of q, these operators provide more flexibility in approximation and the convergence is at least as fast as the generalized Lupaş operators, while retaining their approximation properties. For these operators, we give weighted approximations, Voronovskaja-type theorems, and quantitative estimates for the local approximation.